Gaussian Limits for SGD Without Stationary Moments
Not on the map. Why?
Abstract (arXiv)
Temporal dependence can separate the Gaussian approximation of stochastic gradient descent from its stationary moments. For unmodified least-squares SGD, we construct a design with standard Gaussian marginals whose stationary error has every positive moment infinite. Independent observations with the same marginals instead give finite stationary variance. Both regimes retain a Gaussian small-step limit. Our general theory establishes pathwise contraction from a finite second design moment, then uses score cancellation and localization to obtain stationary Gaussian and Ornstein--Uhlenbeck limits. Independent Gaussian regression errors yield an exact conditional Gaussian law and total-variation convergence under the same design integrability. Stronger design conditions identify a positive first-order total-variation constant and a deterministic covariance correction with o(a) error. A scalar coverage expansion translates this correction into its inference consequence. Experiments examine distributional error, coverage, and calibration with dependent scores. Together, these results establish precise probability-law approximation beyond moment-based stationary analysis.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 17 of its 29 references that are in the map. First posted on arXiv 4 Oct 2026.
Builds on
17 of 29 references.
References · 17
- 2017Stochastic Gradient Descent as Approximate Bayesian Inferencecited by 300
- 2019Finite-Time Error Bounds For Linear Stochastic Approximation and TD Learningcited by 166
- 2020The Heavy-Tail Phenomenon in SGDcited by 124
- 2018Stochastic Modified Equations and Dynamics of Stochastic Gradient Algorithms I: Mathematical Foundationscited by 114
- 2017Bridging the Gap between Constant Step Size Stochastic Gradient Descent and Markov Chainscited by 88
- 2020On Linear Stochastic Approximation: Fine-grained Polyak-Ruppert and Non-Asymptotic Concentrationcited by 68
- 2020An Analysis of Constant Step Size SGD in the Non-convex Regime: Asymptotic Normality and Biascited by 48
- 2022Bias and Extrapolation in Markovian Linear Stochastic Approximation with Constant Stepsizescited by 30
- 2021Tight High Probability Bounds for Linear Stochastic Approximation with Fixed Stepsizecited by 27
- 2021On the Stability of Random Matrix Product with Markovian Noise: Application to Linear Stochastic Approximation and TD Learningcited by 23
- 2020Multiplicative noise and heavy tails in stochastic optimizationcited by 17
- 2021Stationary Behavior of Constant Stepsize SGD Type Algorithms: An Asymptotic Characterizationcited by 13
5 more
- 2023Convergence and concentration properties of constant step-size SGD through Markov chainscited by 11
- 2026SGD with Dependent Data: Optimal Estimation, Regret, and Inferencecited by 6
- 2026Constant-Stepsize Stochastic Approximation: Finite-Time Convergence, Gaussian Approximation, and Tail Boundscited by 3
- 2024Analysing heavy-tail properties of Stochastic Gradient Descent by means of Stochastic Recurrence Equationscited by 2
- 2025On the Rate of Gaussian Approximation for Linear Regression Problemscited by 2
Built on by
Not cited yet.