mlsanityData to 7 Oct 2026

A Basin-Selection Perspective on Grokking via Singular Learning Theory

arXiv 2603.01192 ↗First posted 1 Mar 2026stat.ML cs.LGcited by 4

Not on the map. Why?

Abstract (arXiv)

Grokking, the abrupt transition from memorization to generalisation after extended training, suggests the presence of competing solution basins with distinct statistical properties. We study this phenomenon through the lens of Singular Learning Theory (SLT), a Bayesian framework that characterizes the geometry of the loss landscape. The key measure is the local learning coefficient (LLC) which quantifies the local degeneracy of the loss surface. SLT links lower-LLC basins to higher posterior mass concentration and lower expected generalisation error. Leveraging SLT, we develop a basin-selection perspective on grokking in quadratic networks: LLC ranks competing near-zero-loss basins by statistical preference, while the training-time transition between them is governed by optimisation dynamics. In this view, grokking corresponds to a transition from a higher-LLC (memorising) basin to a lower-LLC (generalising) basin that dominates the posterior. To support this, we derive analytic formulas for the LLC in shallow quadratic networks under both lazy and feature learning regimes. Empirically, we demonstrate that LLC trajectories estimated from training data track the onset of generalisation and provide an informative probe of the optimisation path.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 26 of its 38 references that are in the map. First posted on arXiv 1 Mar 2026.

Builds on

26 of 38 references.

References · 26

  1. 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
  2. 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,404
  3. 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,337
  4. 2017Visualizing the Loss Landscape of Neural Netscited by 1,126
  5. 2023Progress measures for grokking via mechanistic interpretabilitycited by 822
  6. 2022Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasetscited by 599
  7. 2017Sharp Minima Can Generalize For Deep Netscited by 462
  8. 2017Stochastic Gradient Descent as Approximate Bayesian Inferencecited by 298
  9. 2017Three Factors Influencing Minima in SGDcited by 270
  10. 2022Omnigrok: Grokking Beyond Algorithmic Datacited by 142
  11. 2023Grokking as the Transition from Lazy to Rich Training Dynamicscited by 102
  12. 2020Relative Flatness and Generalizationcited by 88
14 more
  1. 2023Dichotomy of Early and Late Phase Implicit Biases Can Provably Induce Grokkingcited by 76
  2. 2022On the Maximum Hessian Eigenvalue and Generalizationcited by 57
  3. 2023The Local Learning Coefficient: A Singularity-Aware Complexity Measurecited by 50
  4. 2023Grokking as a First Order Phase Transition in Two Layer Networkscited by 48
  5. 2024Loss Landscape Degeneracy and Stagewise Development in Transformerscited by 39
  6. 2024Why Do You Grok? A Theoretical Analysis of Grokking Modular Additioncited by 34
  7. 2022Grokking phase transitions in learning local rules with gradient descentcited by 28
  8. 2023Dynamical versus Bayesian Phase Transitions in a Toy Model of Superpositioncited by 28
  9. 2025Provable Scaling Laws of Feature Emergence from Learning Dynamics of Grokkingcited by 14
  10. 2021Why flatness does and does not correlate with generalization for deep neural networkscited by 13
  11. 2023Grokking Beyond Neural Networks: An Empirical Exploration with Model Complexitycited by 13
  12. 2016Upper Bound of Bayesian Generalization Error in Non-negative Matrix Factorizationcited by 10
  13. 2019A Reparameterization-Invariant Flatness Measure for Deep Neural Networkscited by 7
  14. 2024Geometry of fibers of the multiplication map of deep linear neural networkscited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 4.

4 papers.