Fetching the paper…
Reading the bibliography…
This paper presents a lower bound for optimizing a finite sum of $n$ functions, where each function is $L$-smooth and the sum is $\mu$-strongly convex.
Problem Complexity and Method Efficiency in Optimization
Arkadi Nemirovsky and David B. Yudin · 1983
Earlier work this paper cites.
Introductory Lectures on Convex Optimization
Yurii Nesterov · 2004
Earlier work this paper cites.
Stochastic primal-dual coordinate method for regularized empirical risk minimization
Yuchen Zhang and Lin Xiao · 2004
Earlier work this paper cites.
Gradient methods for minimizing composite objective function, 2007
Yurii Nesterov · 2007
Earlier work this paper cites.
The tradeoffs of large scale learning
Léon Bottou and Olivier Bousquet · 2008
Earlier work this paper cites.
Incremental gradient, subgradient, and proximal methods for convex optimization: A survey
Dimitri P. Bertsekas · 2010
Cited alongside, same era.
Fast global convergence of gradient methods for high-dimensional statistical recovery
Alekh Agarwal, Sahand Negahban, and Martin J Wainwright · 2012
Cited alongside, same era.
A stochastic gradient method with an exponential convergence rate for finite training sets
Nicolas Le Roux, Mark Schmidt, and Francis Bach · 2012
Cited alongside, same era.
Introduction to the non-asymptotic analysis of random matrices
Roman Vershynin · 2012
Cited alongside, same era.
Accelerating stochastic gradient descent using predictive variance reduction
Rie Johnson and Tong Zhang · 2013
Cited alongside, same era.
Minimizing finite sums with the stochastic average gradient
Mark Schmidt, Nicolas Le Roux, and Francis Bach · 2013
Later among the works it cites.
Stochastic dual coordinate ascent methods for regularized loss
Shai Shalev-Shwartz and Tong Zhang · 2013
Later among the works it cites.
On Lower and Upper Bounds in Smooth Strongly Convex Optimization - A Unified Approach via Linear Iterative Methods
Y. Arjevani · 2014
Closest in time.
Saga: A fast incremental gradient method with support for non-strongly convex composite objectives
Aaron Defazio, Francis Bach, and Simon Lacoste-Julien · 2014
Closest in time.
Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization
Shai Shalev-Shwartz and Tong Zhang · 2014
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…