Fetching the paper…
Reading the bibliography…
We propose a new stochastic gradient method for optimizing the sum of a finite set of smooth functions, where the sum is strongly convex.
A stochastic approximation method
H. Robbins and S. Monro · 1951
Earlier work this paper cites.
Accelerated stochastic approximation
H. Kesten · 1958
Earlier work this paper cites.
Problem complexity and method efficiency in optimization
A. Nemirovski and D. B. Yudin · 1983
Earlier work this paper cites.
A method for unconstrained convex minimization problem with the rate of convergence O ( 1 / k 2 ) {O}(1/k^{2})
Y. Nesterov · 1983
Earlier work this paper cites.
Acceleration of stochastic approximation by averaging
B. T. Polyak and A. B. Juditsky · 1992
Earlier work this paper cites.
Accelerated stochastic approximation
B. Delyon and A. Juditsky · 1993
Earlier work this paper cites.
A new class of incremental gradient methods for least squares problems
D. P. Bertsekas · 1997
Earlier work this paper cites.
Incremental gradient algorithms with stepsizes bounded away from zero
M. Solodov · 1998
Earlier work this paper cites.
An incremental gradient(-projection) method with momentum term and adaptive stepsize rule
P. Tseng · 1998
Earlier work this paper cites.
Local gain adaptation in stochastic gradient descent
N. Schraudolph · 1999
Earlier work this paper cites.
Convergence rate of incremental subgradient algorithms
A. Nedic and D. Bertsekas · 2000
Earlier work this paper cites.
Large scale online learning
L. Bottou and Y. LeCun · 2003
Cited alongside, same era.
Stochastic approximation and recursive algorithms and applications
H. J. Kushner and G. Yin · 2003
Cited alongside, same era.
Introductory lectures on convex optimization: A basic course
Y. Nesterov · 2004
Cited alongside, same era.
A convergent incremental gradient method with a constant step size
D. Blatt, A. O. Hero, and H. Gauchman · 2007
Cited alongside, same era.
The tradeoffs of large scale learning
L. Bottou and O. Bousquet · 2007
Cited alongside, same era.
Pegasos: Primal estimated sub-gradient solver for svm
S. Shalev-Shwartz, Y. Singer, and N. Srebro · 2007
Cited alongside, same era.
Primal-dual subgradient methods for convex problems
Y. Nesterov · 2009
Later among the works it cites.
Variable metric stochastic approximation theory
P. Sunehag, J. Trumpf, S. Vishwanathan, and N. Schraudolph · 2009
Later among the works it cites.
Optimal stochastic‘ approximation algorithms for strongly convex stochastic composite optimization
S. Ghadimi and G. Lan · 2010
Later among the works it cites.
Deep learning via Hessian-free optimization
J. Martens · 2010
Later among the works it cites.
Efficiency of coordinate descent methods on huge-scale optimization problems
Y. Nesterov · 2010
Later among the works it cites.
Dual averaging methods for regularized stochastic learning and online optimization
L. Xiao · 2010
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
C. H. Teo, Q. Le, A. J. Smola, and S. V. N. Vishwanathan · 2007
Cited alongside, same era.
Fast rates for regularized objectives
K. Sridharan, S. Shalev-Shwartz, and N. Srebro · 2008
Cited alongside, same era.
Asymptotically optimal regularization in smooth parametric models
P. Liang, F. Bach, and M. I. Jordan · 2009
Cited alongside, same era.
Large-scale sparse logistic regression
J. Liu, J. Chen, and J. Ye · 2009
Cited alongside, same era.
Robust stochastic approximation approach to stochastic programming
A. Nemirovski, A. Juditsky, G. Lan, and A. Shapiro · 2009
Cited alongside, same era.
Méthode générale pour la résolution des systèmes d’équations simultanées
M. A. Cauchy
Cited in the paper.
Non-asymptotic analysis of stochastic approximation algorithms for machine learning
F. Bach and E. Moulines · 2011
Later among the works it cites.
Optimal learning rates for least squares SVMs using Gaussian kernels
M. Eberts and I. Steinwart · 2011
Later among the works it cites.
Beyond the regret minimization barrier: an optimal algorithm for stochastic strongly-convex optimization
E. Hazan and S. Kale · 2011
Later among the works it cites.
Information-theoretic lower bounds on the oracle complexity of stochastic convex optimization
A. Agarwal, P. L. Bartlett, P. Ravikumar, and M. J. Wainwright · 2012
Closest in time.
Hybrid deterministic-stochastic methods for data fitting
M. P. Friedlander and M. Schmidt · 2012
Closest in time.