arxiv
PublishedJuly 21, 2026 at 4:00 AM
Scaling Limits of Constant-Stepsize SGD at Flat Minima
Publisher summary· verbatim
arXiv:2607.16384v1 Announce Type: new Abstract: For stochastic gradient descent (SGD) with a constant stepsize $\alpha$, the invariant law of the iterates, centered at a minimizer, describes the behavior of the algorithm over long time horizons. In the strongly convex case, this invariant law has th
Stay posted· Newsletter
A 5-min weekly brief — top movers, price watch, story of the week.
Discussion
No replies yet. Be first.
Related coverage
More from ARXIV
arxivCapacity and Redundancy Trade-offs in Multi-Task Learning12harxivPredictive Training with Latent Imagination for Visual Quadruped Navigation12harxivWhere Not to Learn: Prior-Aligned Training with Subset-based Attribution Constraints for Reliable Decision-Making12harxivDid We Actually Fix It? An Independent Adversarial Stress-Test of Post-Point-Adjustment Evaluation Metrics for Time-Series Anomaly Detection12hThe Bubble Brief
WEEKLYRead AI insights every Tuesday — top movers, new releases, story of the week.
Originally published on arxiv ↗