On the different regimes of Stochastic Gradient Descent
Antonio Sclocchi, Matthieu Wyart

TL;DR
This paper characterizes the different dynamical regimes of stochastic gradient descent in deep learning, identifying phase transitions based on batch size and learning rate, and relates these regimes to generalization performance.
Contribution
The paper provides a phase diagram of SGD regimes in the batch size and learning rate plane, revealing how these regimes depend on problem hardness and training set size.
Findings
Identifies three SGD regimes: noise-dominated, large-first-step, and gradient descent.
Shows the boundary between regimes scales with training set size and problem difficulty.
Empirically confirms phase diagram predictions in deep neural networks.
Abstract
Modern deep networks are trained with stochastic gradient descent (SGD) whose key hyperparameters are the number of data considered at each step or batch size , and the step size or learning rate . For small and large , SGD corresponds to a stochastic evolution of the parameters, whose noise amplitude is governed by the ''temperature'' . Yet this description is observed to break down for sufficiently large batches , or simplifies to gradient descent (GD) when the temperature is sufficiently small. Understanding where these cross-overs take place remains a central challenge. Here, we resolve these questions for a teacher-student perceptron classification model and show empirically that our key predictions still apply to deep networks. Specifically, we obtain a phase diagram in the - plane that separates three dynamical phases: (i) a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic Gradient Optimization Techniques
MethodsStochastic Gradient Descent
