mlsanityData to 7 Oct 2026

On the Superlinear Relationship between SGD Noise Covariance and Loss Landscape Curvature

arXiv 2602.05600 ↗First posted 5 Feb 2026cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

Stochastic Gradient Descent (SGD) introduces anisotropic noise that is correlated with the local curvature of the loss landscape, thereby biasing optimization toward flat minima. Prior work often assumes an equivalence between the Fisher Information Matrix and the Hessian for negative log-likelihood losses, leading to the claim that the SGD noise covariance C is proportional to the Hessian H. We show that this assumption holds only under restrictive conditions that are typically violated in deep neural networks. Using the recently discovered Activity--Weight Duality, we find a more general relationship agnostic to the specific loss formulation, showing that C propto mathbbEp[hp2], where hp denotes the per-sample Hessian with H = mathbbEp[hp]. As a consequence, C and H commute approximately rather than coincide exactly. We further find that, within the analyzed fully connected layers, their diagonal elements follow per-layer empirical power laws Cii propto Hiiγ, with layer-dependent fitted exponents bounded by 1 ≤ γ ≤ 2. Experiments across datasets, architectures, and loss functions support the resulting layerwise bounds, providing a unified characterization of the noise-curvature relationship in deep learning.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 49 of its 66 references that are in the map. First posted on arXiv 5 Feb 2026.

Builds on

49 of 66 references.

References · 49

  1. 2016Understanding deep learning requires rethinking generalizationcited by 1,657
  2. 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,337
  3. 2017A Closer Look at Memorization in Deep Networkscited by 936
  4. 2017The Implicit Bias of Gradient Descent on Separable Datacited by 649
  5. 2017Exploring Generalization in Deep Learningcited by 595
  6. 2015Train faster, generalize better: Stability of stochastic gradient descentcited by 547
  7. 2017Computing Nonvacuous Generalization Bounds for Deep (Stochastic) Neural Networks with Many More Parameters than Training Datacited by 527
  8. 2019Fantastic Generalization Measures and Where to Find Themcited by 507
  9. 2017Sharp Minima Can Generalize For Deep Netscited by 462
  10. 2016Entropy-SGD: Biasing Gradient Descent Into Wide Valleyscited by 357
  11. 2017Stochastic Gradient Descent as Approximate Bayesian Inferencecited by 298
  12. 2019PyHessian: Neural Networks Through the Lens of the Hessiancited by 291
37 more
  1. 2019An Investigation into Neural Net Optimization via Hessian Eigenvalue Densitycited by 289
  2. 2014Identifying and attacking the saddle point problem in high-dimensional non-convex optimizationcited by 286
  3. 2017How to Escape Saddle Points Efficientlycited by 284
  4. 2017Empirical Analysis of the Hessian of Over-Parametrized Neural Networkscited by 283
  5. 2017Train longer, generalize better: closing the generalization gap in large batch training of neural networkscited by 278
  6. 2017Three Factors Influencing Minima in SGDcited by 270
  7. 2017Non-convex learning via Stochastic Gradient Langevin Dynamics: a nonasymptotic analysiscited by 242
  8. 2020Loss landscapes and optimization in over-parameterized non-linear systems and neural networkscited by 231
  9. 2016Eigenvalues of the Hessian in Deep Learning: Singularity and Beyondcited by 156
  10. 2015Adding Gradient Noise Improves Learning for Very Deep Networkscited by 144
  11. 2015Stochastic modified equations and adaptive stochastic gradient algorithmscited by 141
  12. 2017Convergence Analysis of Two-layer Neural Networks with ReLU Activationcited by 137
  13. 2017A Bayesian Perspective on Generalization and Stochastic Gradient Descentcited by 134
  14. 2017Stochastic gradient descent performs variational inference, converges to limit cycles for deep networkscited by 108
  15. 2017Global Convergence of Langevin Dynamics Based Algorithms for Nonconvex Optimizationcited by 96
  16. 2020Shape Matters: Understanding the Implicit Bias of the Noise Covariancecited by 88
  17. 2017Towards Understanding Generalization of Deep Learning: Perspective of Loss Landscapescited by 84
  18. 2017SGD Learns Over-parameterized Networks that Provably Generalize on Linearly Separable Datacited by 79
  19. 2018A Walk with SGDcited by 74
  20. 2021On the Validity of Modeling SGD with Stochastic Differential Equations (SDEs)cited by 73
  21. 2017A Hitting Time Analysis of Stochastic Gradient Langevin Dynamicscited by 70
  22. 2019Measurements of Three-Level Hierarchical Structure in the Outliers in the Spectrum of Deepnet Hessianscited by 68
  23. 2018Escaping Saddles with Stochastic Gradientscited by 66
  24. 2019Normalized Flat Minima: Exploring Scale Invariant Definition of Flat Minima for Neural Networks using PAC-Bayesian Analysiscited by 58
  25. 2020The Global Landscape of Neural Networks: An Overviewcited by 57
  26. 2022On the Maximum Hessian Eigenvalue and Generalizationcited by 57
  27. 2020Neural Collapse with Cross-Entropy Losscited by 52
  28. 2019Bad Global Minima Exist and SGD Can Reach Themcited by 49
  29. 2019First Exit Time Analysis of Stochastic Gradient Descent Under Heavy-Tailed Gradient Noisecited by 43
  30. 2019Hessian based analysis of SGD for Deep Nets: Dynamics and Generalizationcited by 37
  31. 2020Artificial Neural Variability for Deep Learning: On Overfitting, Noise Memorization, and Catastrophic Forgettingcited by 28
  32. 2022Stochastic gradient descent introduces an effective landscape-dependent regularization favoring flat solutionscited by 22
  33. 2021Embedding Principle: a hierarchical structure of loss landscape of deep neural networkscited by 21
  34. 2019The asymptotic spectrum of the Hessian of DNN throughout trainingcited by 19
  35. 2022On the Overlooked Structure of Stochastic Gradientscited by 13
  36. 2022The activity-weight duality in feed forward neural networks: The geometric determinants of generalizationcited by 12
  37. 2026Noise-Driven Exploration and Transient Freezing Select Flat Minima in Stochastic Gradient Descentcited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 2.

2 papers.