mlsanityData to 7 Oct 2026

High-dimensional scaling limits and fluctuations of online least-squares SGD with smooth covariance

arXiv 2304.00707 ↗First posted 3 Apr 2023math.PR math.OC math.STcited by 5

Not on the map. Why?

Abstract (arXiv)

We derive high-dimensional scaling limits and fluctuations for the online least-squares Stochastic Gradient Descent (SGD) algorithm by taking the properties of the data generating model explicitly into consideration. Our approach treats the SGD iterates as an interacting particle system, where the expected interaction is characterized by the covariance structure of the input. Assuming smoothness conditions on moments of order up to eight orders, and without explicitly assuming Gaussianity, we establish the high-dimensional scaling limits and fluctuations in the form of infinite-dimensional Ordinary Differential Equations (ODEs) or Stochastic Differential Equations (SDEs). Our results reveal a precise three-step phase transition of the iterates; it goes from being ballistic, to diffusive, and finally to purely random behavior, as the noise variance goes from low, to moderate and finally to very-high noise setting. In the low-noise setting, we further characterize the precise fluctuations of the (scaled) iterates as infinite-dimensional SDEs. We also show the existence and uniqueness of solutions to the derived limiting ODEs and SDEs. Our results have several applications, including characterization of the limiting mean-square estimation or prediction errors and their fluctuations, which can be obtained by analytically or numerically solving the limiting equations.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 40 of its 94 references that are in the map. First posted on arXiv 3 Apr 2023.

Builds on

40 of 94 references.

References · 40

  1. 2016Optimization Methods for Large-Scale Machine Learningcited by 1,140
  2. 2019Benign Overfitting in Linear Regressioncited by 544
  3. 2018A Mean Field View of the Landscape of Two-Layers Neural Networkscited by 463
  4. 2018On the Global Convergence of Gradient Descent for Over-parameterized Models using Optimal Transportcited by 422
  5. 2022High-dimensional Asymptotics of Feature Learning: How One Gradient Step Improves the Representationcited by 146
  6. 2022The merged-staircase property: a necessary and nearly sufficient condition for SGD learning of sparse functions on two-layer neural networkscited by 141
  7. 2020Online stochastic gradient descent on non-convex losses from high-dimensional inferencecited by 119
  8. 2018Stochastic Modified Equations and Dynamics of Stochastic Gradient Algorithms I: Mathematical Foundationscited by 109
  9. 2018Mean Field Analysis of Neural Networks: A Central Limit Theoremcited by 107
  10. 2018Trainability and Accuracy of Neural Networks: An Interacting Particle System Approachcited by 105
  11. 2017Bridging the Gap between Constant Step Size Stochastic Gradient Descent and Markov Chainscited by 84
  12. 2020On the Almost Sure Convergence of Stochastic Gradient Descent in Non-Convex Problemscited by 79
28 more
  1. 2022High-dimensional limit theorems for SGD: Effective dynamics and critical scalingcited by 69
  2. 2018Stochastic (Approximate) Proximal Point Methods: Convergence, Optimality, and Adaptivitycited by 61
  3. 2022Phase diagram of Stochastic Gradient Descent in high-dimensional two-layer neural networkscited by 50
  4. 2020An Analysis of Constant Step Size SGD in the Non-convex Regime: Asymptotic Normality and Biascited by 45
  5. 2019Mean Field Analysis of Deep Neural Networkscited by 42
  6. 2022Finite-time High-probability Bounds for Polyak-Ruppert Averaged Iterates of Linear Stochastic Approximationcited by 41
  7. 2016Asymptotic Optimality in Stochastic Optimizationcited by 38
  8. 2019Online Stochastic Gradient Descent with Arbitrary Initialization Solves Non-smooth, Non-convex Phase Retrievalcited by 34
  9. 2021SGD in the Large: Average-case Analysis, Asymptotics, and Stepsize Criticalitycited by 33
  10. 2022On Almost Sure Convergence Rates of Stochastic Gradient Methodscited by 32
  11. 2019Normal Approximation for Stochastic Gradient Descent via Non-Asymptotic Rates of Martingale CLTcited by 30
  12. 2021Tight High Probability Bounds for Linear Stochastic Approximation with Fixed Stepsizecited by 26
  13. 2022Homogenization of SGD in high-dimensions: Exact dynamics and generalization propertiescited by 26
  14. 2021Overparameterization of deep ResNet: zero loss and mean-field analysiscited by 24
  15. 2022Implicit Regularization or Implicit Conditioning? Exact Risk Trajectories of SGD in High Dimensionscited by 23
  16. 2021Near-optimal inference in adaptive linear regressioncited by 20
  17. 2020Statistical Inference for Online Decision Making via Stochastic Gradient Descentcited by 17
  18. 2021Dynamics of Stochastic Momentum Methods on Large-scale, Quadratic Modelscited by 15
  19. 2020Halting Time is Predictable for Large Models: A Universality Property and Average-case Analysiscited by 14
  20. 2023Asymptotic normality and optimality in nonsmooth stochastic approximationcited by 14
  21. 2016Near-Optimal Stochastic Approximation for Online Principal Component Estimationcited by 11
  22. 2017Scaling Limit: Exact and Tractable Analysis of Online Learning Algorithms with Applications to Regularized Regression and PCAcited by 11
  23. 2020Stochastic optimization with momentum: convergence, fluctuations, and traps avoidancecited by 10
  24. 2022Alternating minimization for generalized rank one matrix sensing: Sharp predictions from a random initializationcited by 9
  25. 2017The Scaling Limit of High-Dimensional Online Independent Component Analysiscited by 5
  26. 2021Limiting fluctuation and trajectorial stability of multilayer neural networks with mean field trainingcited by 5
  27. 2022The TAP free energy for high-dimensional linear regressioncited by 3
  28. 2022Conservative SPDEs as fluctuating mean field limits of stochastic gradient descentcited by 3

Built on by

Cited by year

Citing papers per year: 2023: 1; 2024: 2; 2025: 2.

5 papers.