Skip to content
DraconiticResearch
Search Sources API
201,818 studies31 sourcesUpdated 12 min ago
PreprintarXiv licencearXiv

Stochastic Gradient Descent: A Nonlinear Time Series Perspective

Abstract

This paper investigates the statistical behavior of Stochastic Gradient Descent (SGD) with constant step size under the framework of iterated random functions. Compared to previous studies establishing the convergence of SGD in probability measure, e.g., Wasserstein distance, our approach directly provides the convergence in Euclidean distance by showing the Geometric Moment Contraction (GMC) of SGD. This new convergence can address the non-stationarity of SGD due to fixed initial points and can provide a more refined asymptotic analysis of SGD. Specifically, we prove quenched central limit theorem, invariance principle and α-stable convergence for averaged SGD (ASGD) regardless of initialization. Furthermore, we provide a novel perspective to understand the impact of step sizes in SGD by studying its derivative with respect to the step size. The existence of stationary solutions for the derivative processes is shown, enabling the use of interpolation to recover the full-trajectory of SGD. Subsequently, we utilize multiple step sizes and show an enhanced Richardson-Romberg extrapolation with improved bias representation, which brings ASGD estimates closer to the global optimum. Finally, we propose a new online inference method and a bias-reduced variant for the extrapolated ASGD. Empirical confidence intervals are constructed and the coverage probabilities approach the nominal level as n grows.

Related

  1. Continuous Delayed-Memory Stochastic Gradient Descent and Continuous-Time Reinforcement Learning from History of Astrophysical Time Series Studies
    Juncheng Yi
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  2. A Rate Transfer Method: Convergence Rates in Stochastic Gradient Descent via Stochastic Calculus
    Neil Walton
    arXivPreprintCC BY 4.0Full textOptimisation & controlProbabilityarXiv
  3. Convergence rate of stochastic gradient descent under Łojasiewicz type condition and polynomially controlled noise
    Paweł Węgrzyn
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingOptimisation & controlarXiv
  4. Exact Theory and Optimal Stepsizes for Stochastic Gradient Descent in Smooth Convex Minimization
    Benjamin Grimmer, Qining Shen
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  5. Large-Step Last-Iterate Convergence of Random-Reshuffling Stochastic Gradient Descent
    Zijun Chen, Zihan Zhang
    arXivPreprintarXiv licenceFull textOptimisation & controlStatisticsarXiv
BibTeX
@misc{li2026stochastic,
  title = {{Stochastic Gradient Descent: A Nonlinear Time Series Perspective}},
  author = {Jiaqi Li and Zhipeng Lou and Stefan Richter and Wei Biao Wu},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.20894},
  eprint = {2610.20894},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.20894},
}
RIS
TY  - UNPB
TI  - Stochastic Gradient Descent: A Nonlinear Time Series Perspective
AU  - Jiaqi Li
AU  - Zhipeng Lou
AU  - Stefan Richter
AU  - Wei Biao Wu
PY  - 2026
DA  - 2026/10/14
PB  - arXiv
DO  - 10.48550/arxiv.2610.20894
UR  - https://arxiv.org/abs/2610.20894
AB  - This paper investigates the statistical behavior of Stochastic Gradient Descent (SGD) with constant step size under the framework of iterated random functions. Compared to previous studies establishing the convergence of SGD in probability measure, e.g., Wasserstein distance, our approach directly provides the convergence in Euclidean distance by showing the Geometric Moment Contraction (GMC) of SGD. This new convergence can address the non-stationarity of SGD due to fixed initial points and can provide a more refined asymptotic analysis of SGD. Specifically, we prove quenched central limit theorem, invariance principle and α-stable convergence for averaged SGD (ASGD) regardless of initialization. Furthermore, we provide a novel perspective to understand the impact of step sizes in SGD by studying its derivative with respect to the step size. The existence of stationary solutions for the derivative processes is shown, enabling the use of interpolation to recover the full-trajectory of SGD. Subsequently, we utilize multiple step sizes and show an enhanced Richardson-Romberg extrapolation with improved bias representation, which brings ASGD estimates closer to the global optimum. Finally, we propose a new online inference method and a bias-reduced variant for the extrapolated ASGD. Empirical confidence intervals are constructed and the coverage probabilities approach the nominal level as n grows.
ER  -