Fetching the paper…
Reading the bibliography…
This paper deals with a natural stochastic optimization procedure derived from the so-called Heavy-ball method differential equation, which was introduced by Polyak in the 1960s with his seminal contribution [Pol64].
A stochastic approximation method
H. Robbins and S. Monro · 1951
Earlier work this paper cites.
Stochastic estimation of the maximum of a regression function
J. Kiefer and J. Wolfowitz · 1952
Earlier work this paper cites.
An algorithm for quadratic programming
M. Frank and P. Wolfe · 1956
Earlier work this paper cites.
Some methods of speeding up the convergence of iteration methods
B. T. Polyak · 1964
Earlier work this paper cites.
Ordinary Differential Equations
P. Hartman · 1982
Earlier work this paper cites.
A method of solving a convex programming problem with convergence rate o ( 1 / k 2 ) o(1/k^{2})
Y. Nesterov · 1983
Earlier work this paper cites.
Problem complexity and method efficiency in optimization
A. Nemirovski and D. Yudin · 1983
Earlier work this paper cites.
Markov Processes
S. Ethier and T. Kurtz · 1986
Earlier work this paper cites.
Efficient estimations from a slowly convergent robbins-monro process
D. Ruppert · 1988
Earlier work this paper cites.
Non-convergence to unstable points in urn models and stochastic approximations
R. Pemantle · 1990
Earlier work this paper cites.
Systèmes dynamiques dissipatifs et applications
A. Haraux · 1991
Earlier work this paper cites.
Acceleration of stochastic approximation by averaging
B. T. Polyak and A. Juditsky · 1992
Earlier work this paper cites.
Stability of Markovian processes. III. Foster-Lyapunov criteria for continuous-time processes
Sean P. Meyn and R. L. Tweedie · 1993
Earlier work this paper cites.
Probability for Analysts
K.R. Stromberg · 1994
Earlier work this paper cites.
Convergence of Probability Measures
P. Billingsley · 1995
Earlier work this paper cites.
Les algorithmes stochastiques contournent-ils les pièges ?
O. Brandière and M. Duflo · 1996
Cited alongside, same era.
Asymptotic pseudotrajectories and chain recurrent flows, with applications
M. Benaïm and M.W. Hirsh · 1996
Cited alongside, same era.
Random iterative models, adaptive algorithms and stochastic approximations,
M. Duflo · 1997
Cited alongside, same era.
Multidimensional diffusion processes
D. W. Stroock and S. R. S. Varadhan · 1997
Cited alongside, same era.
Self-interacting diffusions
M. Benaïm, M. Ledoux, and O. Raimond · 2002
Cited alongside, same era.
Ergodicity for SDEs and approximations: locally Lipschitz vector fields and degenerate noise
J. C. Mattingly, A. M. Stuart, and D. J. Higham · 2002
Cited alongside, same era.
Accelerated gradient methods for stochastic optimization and online learning
C. Hu, W. Pan, and J. T. Kwok · 2009
Later among the works it cites.
Hypocoercivity
C. Villani · 2009
Later among the works it cites.
Non-asymptotic analysis of stochastic approximation algorithms for machine learning
F. Bach and E. Moulines · 2011
Later among the works it cites.
An optimal method for stochastic composite optimization
G. Lan · 2012
Later among the works it cites.
Concentration inequalities
S. Boucheron, G. Lugosi, and P. Massart · 2013
Later among the works it cites.
Stochastic first- and zeroth-order methods for nonconvex stochastic programming
S. Ghadimi and G. Lan · 2013
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Stochastic approximation and recursive algorithms and applications
H. J. Kushner and G. Yin · 2003
Cited alongside, same era.
Convex optimization
S. Boyd and L. Vandenberghe · 2004
Cited alongside, same era.
Introductory lectures on convex optimization
Y. Nesterov · 2004
Cited alongside, same era.
Dynamics of stochastic approximation algorithms
M. Benaïm · 2006
Cited alongside, same era.
An adaptive scheme for the approximation of dissipative systems
V. Lemaire · 2007
Cited alongside, same era.
A fast iterative shrinkage-thresholding algorithm for linear inverse problems
M. Teboulle. A. Beck · 2009
Cited alongside, same era.
Adaptivity of averaged stochastic gradient descent to local strong convexity for logistic regression
F. Bach · 2014
Later among the works it cites.
Long time behaviour and stationary regime of memory gradient diffusions
S. Gadat and F. Panloup · 2014
Later among the works it cites.
From averaging to acceleration, there is only a step-size
N. Flammarion and F. Bach · 2015
Later among the works it cites.
A stochastic model for speculative bubbles
S. Gadat, L. Miclo, and F. Panloup · 2015
Later among the works it cites.
Accelerated gradient methods for nonconvex nonlinear and stochastic programming
S. Ghadimi and G. Lan · 2016
Closest in time.
Gradient descent converges to minimizers
J. Lee, M. Simchowitz, M. Jordan, and B. Recht · 2016
Closest in time.
A differential equation for modeling nesterov’s accelerated gradient method: theory and insights
S. Boyd W. Su and E. J. Candes · 2016
Closest in time.
Unified convergence analysis of stochastic momentum methods for convex and non-convex optimization
T. Yang, Q. Lin, and Z. Li · 2016
Closest in time.