mlsanityData to 7 Oct 2026

Functional Central Limit Theorem for Stochastic Gradient Descent

arXiv 2602.15538 ↗First posted 17 Feb 2026stat.ML cs.LG math.OCcited by 1

Not on the map. Why?

Abstract (arXiv)

We study the asymptotic shape of the trajectory of the stochastic gradient descent algorithm applied to a convex objective function. Under mild regularity assumptions, we prove a functional central limit theorem for the properly rescaled trajectory. Our result characterizes the long-term fluctuations of the algorithm around the minimizer by providing a diffusion limit for the trajectory. In contrast with classical central limit theorems for the last iterate or Polyak-Ruppert averages, this functional result captures the temporal structure of the fluctuations and applies to non-smooth settings such as robust location estimation, including the geometric median.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 4 of its 30 references that are in the map. First posted on arXiv 17 Feb 2026.

Builds on

4 of 30 references.

References · 4

  1. 2013Non-strongly-convex smooth stochastic approximation with convergence rate O(1/n)cited by 110
  2. 2018Stochastic Modified Equations and Dynamics of Stochastic Gradient Algorithms I: Mathematical Foundationscited by 109
  3. 2017Bridging the Gap between Constant Step Size Stochastic Gradient Descent and Markov Chainscited by 84
  4. 2024Limit Theorems for Stochastic Gradient Descent with Infinite Variancecited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.