mlsanityData to 7 Oct 2026

A dynamic view of some anomalous phenomena in SGD

arXiv 2505.01751 ↗First posted 3 May 2025math.OC cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

It has been observed by Belkin et al. that over-parametrized neural networks exhibit a `double descent' phenomenon. That is, as the model complexity (as reflected in the number of features) increases, the test error initially decreases, then increases, and then decreases again. A counterpart of this phenomenon in the time domain has been noted in the context of epoch-wise training, viz., the test error decreases with the number of iterates, then increases, then decreases again. Another anomalous phenomenon is that of textitgrokking wherein two regimes of descent are interrupted by a third regime wherein the mean loss remains almost constant. This note presents a plausible explanation for these and related phenomena by using the theory of two time scale stochastic approximation, applied to the continuous time limit of the gradient dynamics. This gives a novel perspective for an already well studied theme.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 22 of its 51 references that are in the map. First posted on arXiv 3 May 2025.

Builds on

22 of 51 references.

References · 22

  1. 2018Reconciling modern machine learning practice and the bias-variance trade-offcited by 919
  2. 2019Deep Double Descent: Where Bigger Models and More Data Hurtcited by 667
  3. 2022Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasetscited by 599
  4. 2019Surprises in High-Dimensional Ridgeless Least Squares Interpolationcited by 508
  5. 2019The generalization error of random features regression: Precise asymptotics and double descent curvecited by 410
  6. 2022Towards Understanding Grokking: An Effective Theory of Representation Learningcited by 229
  7. 2019Two models of double descent for weak featurescited by 194
  8. 2023Explaining grokking through circuit efficiencycited by 105
  9. 2020Triple descent and the two kinds of overfitting: Where & why do they appear?cited by 64
  10. 2020A Brief Prehistory of Double Descentcited by 44
  11. 2020Multiple Descent: Design Your Own Generalization Curvecited by 44
  12. 2020Early Stopping in Deep Networks: Double Descent and How to Eliminate itcited by 40
10 more
  1. 2023Double Descent Demystified: Identifying, Interpreting & Ablating the Sources of a Deep Learning Puzzlecited by 36
  2. 2024Emergence in non-neural models: grokking modular arithmetic via average gradient outer productcited by 26
  3. 2021Multi-scale Feature Learning Dynamics: Insights for Double Descentcited by 24
  4. 2021When and how epochwise double descent happenscited by 20
  5. 2022Quadratic models for understanding catapult dynamics of neural networkscited by 17
  6. 2018Concentration bounds for two time scale stochastic approximationcited by 8
  7. 2025The global convergence time of stochastic gradient descent in non-convex landscapes: Sharp estimates via large deviationscited by 8
  8. 2021On the Role of Optimization in Double Descent: A Least Squares Studycited by 7
  9. 2024Understanding the Double Descent Phenomenon in Deep Learningcited by 3
  10. 2024Towards Understanding Epoch-wise Double descent in Two-layer Linear Neural Networkscited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 2.

2 papers.