Sharp Stationary Gaussian Approximation for Constant-Stepsize SGD

Junghoon Seo
9/30/2026
cs.LGmath.OC

No confident code implementation found for this paper.

Abstract

We prove a sharp Gaussian approximation for the invariant law of constant-stepsize SGD with bounded additive noise generated by an exogenous uniformly ergodic Markov chain. For a smooth, strongly convex objective with a Lipschitz Hessian and nondegenerate long-run noise covariance, the centered iterate normalized by the square root of the stepsize is $O(\sqrtα)$-close in 1-Wasserstein distance to its limiting Gaussian. The proof combines blockwise Gaussian comparison with long-run contraction. A four-state example gives a matching lower bound although the one-time noise marginal is symmetric and every nonzero-lag autocovariance vanishes. In this example, an adjacent third-order mixed moment produces the leading correction.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{seo2026sharp,
  title  = {Sharp Stationary Gaussian Approximation for Constant-Stepsize SGD},
  author = {Junghoon Seo},
  year   = {2026},
  eprint = {2609.39144},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2609.39144v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2609.39144.svg)](https://codeofpaper.com/paper/2609.39144)

Discussion