Fetching the paper…
Reading the bibliography…
We study the iteration complexity of stochastic gradient descent (SGD) for minimizing the gradient norm of smooth, possibly nonconvex functions.
Analytic extensions of differentiable functions defined in closed sets
Hassler Whitney · 1934
Earlier work this paper cites.
Problem complexity and method efficiency in optimization
A.S. Nemirovski and D.B. Yudin · 1983
Earlier work this paper cites.
Minimization methods for nonsmooth convex and quasiconvex functions
Yurii E Nesterov · 1984
Earlier work this paper cites.
Convergence and efficiency of subgradient methods for quasiconvex minimization
Krzysztof C Kiwiel · 2001
Earlier work this paper cites.
Stochastic approximation and recursive algorithms and applications
Harold Kushner and G George Yin · 2003
Earlier work this paper cites.
Introductory lectures on convex optimization : a basic course
Y. Nesterov · 2004
Earlier work this paper cites.
Information-theoretic lower bounds on the oracle complexity of convex optimization
Alekh Agarwal, Martin J Wainwright, Peter L Bartlett, and Pradeep K Ravikumar · 2009
Earlier work this paper cites.
Robust stochastic approximation approach to stochastic programming
Arkadi Nemirovski, Anatoli Juditsky, Guanghui Lan, and Alexander Shapiro · 2009
Earlier work this paper cites.
Incremental gradient, subgradient, and proximal methods for convex optimization: A survey
Dimitri P Bertsekas · 2011
Earlier work this paper cites.
Adaptive subgradient methods for online learning and stochastic optimization
John Duchi, Elad Hazan, and Yoram Singer · 2011
Cited alongside, same era.
Non-asymptotic analysis of stochastic approximation algorithms for machine learning
Eric Moulines and Francis R Bach · 2011
Cited alongside, same era.
How to make the gradients small
Yurii Nesterov · 2012
Cited alongside, same era.
Making gradient descent optimal for strongly convex stochastic optimization
Alexander Rakhlin, Ohad Shamir, and Karthik Sridharan · 2012
Cited alongside, same era.
Stochastic first-and zeroth-order methods for nonconvex stochastic programming
Saeed Ghadimi and Guanghui Lan · 2013
Cited alongside, same era.
Performance of first-order methods for smooth convex minimization: a novel approach
Yoel Drori and M. Teboulle · 2014
Interpolation of data by smooth nonnegative functions
Charles Fefferman, Arie Israel, and Garving K Luli · 2017
Later among the works it cites.
Max Simchowitz, Ahmed El Alaoui, and Benjamin Recht · 2017
Later among the works it cites.
Exact worst-case performance of first-order methods for composite convex optimization
Adrien B Taylor, Julien M Hendrickx, and François Glineur · 2017
Later among the works it cites.
Smooth strongly convex interpolation and exact worst-case performance of first-order methods
Adrien B Taylor, Julien M Hendrickx, and François Glineur · 2017
Later among the works it cites.
How to make the gradients small stochastically: Even faster convex and nonconvex SGD
Zeyuan Allen-Zhu · 2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Understanding machine learning: From theory to algorithms
Shai Shalev-Shwartz and Shai Ben-David · 2014
Cited alongside, same era.
An extension theorem for convex functions of class c1, 1 on hilbert spaces
Daniel Azagra and Carlos Mudarra · 2017
Cited alongside, same era.
The exact information-based complexity of smooth convex minimization
Yoel Drori · 2017
Cited alongside, same era.
Optimization methods for large-scale machine learning
Léon Bottou, Frank E Curtis, and Jorge Nocedal · 2018
Later among the works it cites.
Lower bounds for non-convex stochastic optimization
Yossi Arjevani, Yair Carmon, John C Duchi, Dylan J Foster, Nathan Srebro, and Blake Woodworth · 2019
Closest in time.
Sharp analysis for nonconvex SGD escaping from saddle points
Cong Fang, Zhouchen Lin, and Tong Zhang · 2019
Closest in time.
The complexity of making the gradient small in stochastic convex optimization
Dylan Foster, Ayush Sekhari, Ohad Shamir, Nathan Srebro, Karthik Sridharan, and Blake Woodworth · 2019
Closest in time.