Noise-Driven Exploration and Transient Freezing Select Flat Minima in Stochastic Gradient Descent
Not on the map. Why?
Abstract (arXiv)
Stochastic gradient descent (SGD) is central to deep learning, yet the dynamical origin of its preference for flatter, more generalizable solutions remains unclear. Here, by analyzing SGD learning dynamics, we identify a nonequilibrium mechanism that governs solution selection during training. Numerical experiments reveal a transient exploratory phase in which SGD trajectories repeatedly escape sharp valleys and migrate toward flatter regions of the loss landscape before becoming confined to a final basin. Using a tractable physical model, we show that SGD noise reshapes the loss landscape into an effective potential that preferentially stabilizes flat solutions. We further uncover a transient freezing mechanism: as training progresses, the flattening landscape suppresses transitions between competing valleys. Stronger SGD noise delays this freezing transition, prolonging the exploratory phase and thereby increasing the probability of convergence to flatter minima. Together, these results provide a unified physical framework connecting learning dynamics, loss-landscape geometry, and generalization, and suggest guiding principles for the design of more effective optimization algorithms.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 23 of its 38 references that are in the map. First posted on arXiv 16 Jan 2026.
Builds on
23 of 38 references.
References · 23
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
- 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,337
- 2017Visualizing the Loss Landscape of Neural Netscited by 1,126
- 2018Loss Surfaces, Mode Connectivity, and Fast Ensembling of DNNscited by 585
- 2016Entropy-SGD: Biasing Gradient Descent Into Wide Valleyscited by 357
- 2019An Investigation into Neural Net Optimization via Hessian Eigenvalue Densitycited by 289
- 2017Empirical Analysis of the Hessian of Over-Parametrized Neural Networkscited by 283
- 2014The Loss Surfaces of Multilayer Networkscited by 278
- 2017Three Factors Influencing Minima in SGDcited by 270
- 2020Loss landscapes and optimization in over-parameterized non-linear systems and neural networkscited by 231
- 2018Gradient Descent Happens in a Tiny Subspacecited by 208
- 2020The Break-Even Point on Optimization Trajectories of Deep Neural Networkscited by 149
11 more
- 2015Stochastic modified equations and adaptive stochastic gradient algorithmscited by 141
- 2020Shape Matters: Understanding the Implicit Bias of the Noise Covariancecited by 88
- 2017Critical Learning Periods in Deep Neural Networkscited by 78
- 2019Large Scale Structure of Neural Network Loss Landscapescited by 68
- 2020The Global Landscape of Neural Networks: An Overviewcited by 57
- 2019Hessian based analysis of SGD for Deep Nets: Dynamics and Generalizationcited by 37
- 2022Stochastic gradient descent introduces an effective landscape-dependent regularization favoring flat solutionscited by 22
- 2023Phase diagram of early training dynamics in deep neural networks: effect of the learning rate, depth, and widthcited by 19
- 2019How noise affects the Hessian spectrum in overparameterized neural networkscited by 17
- 2022On the Overlooked Structure of Stochastic Gradientscited by 13
- 2022The activity-weight duality in feed forward neural networks: The geometric determinants of generalizationcited by 12
Built on by
Citing papers per year: 2026: 1.
1 paper.