Noise Balance and Stationary Distribution of Stochastic Gradient Descent
Not on the map. Why?
Abstract (arXiv)
The stochastic gradient descent (SGD) algorithm is the algorithm we use to train neural networks. However, it remains poorly understood how the SGD navigates the highly nonlinear and degenerate loss landscape of a neural network. In this work, we show that the minibatch noise of SGD regularizes the solution towards a noise-balanced solution whenever the loss function contains a rescaling parameter symmetry. Because the difference between a simple diffusion process and SGD dynamics is the most significant when symmetries are present, our theory implies that the loss function symmetries constitute an essential probe of how SGD works. We then apply this result to derive the stationary distribution of stochastic gradient flow for a diagonal linear network with arbitrary depth and width. The stationary distribution exhibits complicated nonlinear phenomena such as phase transitions, broken ergodicity, and fluctuation inversion. These phenomena are shown to exist uniquely in deep networks, implying a fundamental difference between deep and shallow models.
Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). Builds on 7 of its 16 references that are in the map. First posted on arXiv 13 Aug 2023.
Builds on
7 of 16 references.
References · 7
- 2021On the Validity of Modeling SGD with Stochastic Differential Equations (SDEs)cited by 73
- 2021Noether's Learning Dynamics: Role of Symmetry Breaking in Neural Networkscited by 50
- 2021Large Learning Rate Tames Homogeneity: Convergence and Balancing Effectcited by 50
- 2021Stochastic gradient descent with noise of machine learning type. Part II: Continuous time analysiscited by 25
- 2020Analysis of Stochastic Gradient Descent in Continuous Timecited by 24
- 2021The Limiting Dynamics of SGD: Modified Loss, Phase Space Oscillations, and Anomalous Diffusioncited by 19
- 2017Stochastic Gradient Descent in Continuous Time: A Central Limit Theoremcited by 10
Built on by
Citing papers per year: 2023: 1; 2024: 2; 2025: 1; 2026: 3.
7 papers.
- 2024Do Parameters Reveal More than Loss for Membership Inference?cited by 10
- 2025Neural Thermodynamics: Entropic Forces in Deep and Universal Representation Learningcited by 9
- 2024Three Mechanisms of Feature Learning in a Linear Networkcited by 4
- 2026Understanding and inverse design of implicit bias in stochastic learning: a geometric perspectivecited by 3
- 2023Stochastic Thermodynamics of Learning Parametric Probabilistic Modelscited by 0
- 2026Same Error, Different Function: The Optimizer as an Implicit Prior in Financial Time Seriescited by 0
- 2026Broken scale symmetries in undercomplete linear autoencoderscited by 0
- 2026Broken scale symmetries in undercomplete linear autoencoders2 Oct 2026
- 2026Same Error, Different Function: The Optimizer as an Implicit Prior in Financial Time Series3 Mar 2026
- 2026Understanding and inverse design of implicit bias in stochastic learning: a geometric perspective10 Jan 2026
- 2025Neural Thermodynamics: Entropic Forces in Deep and Universal Representation Learning18 May 2025
- 2024Do Parameters Reveal More than Loss for Membership Inference?17 Jun 2024
- 2024Three Mechanisms of Feature Learning in a Linear Network13 Jan 2024
- 2023Stochastic Thermodynamics of Learning Parametric Probabilistic Models4 Oct 2023