A Spectral Theory of Grokking: Weight Decay induces Feature Learning
Not on the map. Why?
Abstract (arXiv)
In grokking an early fit to the training data separates from a much later improvement in generalization. During this delay, training can move from a fixed neural tangent kernel (NTK) regime to one in which task-relevant kernel eigendirections continue to evolve. We provide a quantitative theory for how this transition from lazy to rich learning can produce delayed generalization. For homogeneous networks trained with squared loss and L2 weight decay, we show that a finite residual remains after memorization, with larger residual fractions in target components associated with smaller NTK eigenvalues. These residuals feed back into the dynamics of the NTK itself, and projecting the resulting dynamics onto task-relevant spectral directions yields a reduced system in which residual-driven kernel growth competes with weight decay. This system predicts that the grokking timescale is controlled by the product of learning rate and weight decay, that feature learning slows logarithmically near a critical decay above which task-aligned NTK structure can no longer support generalization, and that stronger decay can prevent fitting altogether. We test these predictions in modular addition. In a homogeneous MLP, task-aligned Fourier structure continues to emerge in the NTK after training accuracy has saturated, and an 84×90-grid of trained networks across varying learning rate and weight decay recovers the predicted phase geometry and inverse-product scaling of the generalization time with learning rate and weight decay. A one-block Transformer shows similar macroscopic phase structure in a 42×45-grid, as well as the same transition-time scaling despite violating exact homogeneity. Together, these results provide a mechanistic derivation connecting post-fit feature learning to both the onset of generalization and its phase structure in the learning rate and weight decay plane.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 32 of its 36 references that are in the map. First posted on arXiv 22 Sep 2026.
Builds on
32 of 36 references.
References · 32
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
- 2023Progress measures for grokking via mechanistic interpretabilitycited by 822
- 2022Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasetscited by 599
- 2021Gradient Descent on Neural Networks Typically Occurs at the Edge of Stabilitycited by 413
- 2022Towards Understanding Grokking: An Effective Theory of Representation Learningcited by 229
- 2022Omnigrok: Grokking Beyond Algorithmic Datacited by 142
- 2023The Quantization Model of Neural Scalingcited by 137
- 2023Explaining grokking through circuit efficiencycited by 105
- 2023Grokking as the Transition from Lazy to Rich Training Dynamicscited by 102
- 2019Dynamics of Deep Neural Networks and Neural Tangent Hierarchycited by 96
- 2022The Slingshot Mechanism: An Empirical Study of Adaptive Optimizers and the Grokking Phenomenoncited by 90
- 2023A Tale of Two Circuits: Grokking as Competition of Sparse and Dense Subnetworkscited by 78
20 more
- 2023Dichotomy of Early and Late Phase Implicit Biases Can Provably Induce Grokkingcited by 76
- 2026Verbalizable Representations Form a Global Workspace in Language Modelscited by 59
- 2023Grokking as a First Order Phase Transition in Two Layer Networkscited by 48
- 2025Grokking at the Edge of Numerical Stabilitycited by 41
- 2024Why Do You Grok? A Theoretical Analysis of Grokking Modular Additioncited by 34
- 2024Emergence in non-neural models: grokking modular arithmetic via average gradient outer productcited by 26
- 2023Grokking in Linear Estimators -- A Solvable Model that Groks without Understandingcited by 25
- 2023Grokking as Compression: A Nonlinear Complexity Perspectivecited by 14
- 2025Grokking Beyond the Euclidean Norm of Model Parameterscited by 14
- 2025Provable Scaling Laws of Feature Emergence from Learning Dynamics of Grokkingcited by 14
- 2023Grokking Beyond Neural Networks: An Empirical Exploration with Model Complexitycited by 13
- 2024Grokking at the Edge of Linear Separabilitycited by 11
- 2024Deep Learning Through A Telescoping Lens: A Simple Model Provides Empirical Insights On Grokking, Gradient Boosting & Beyondcited by 9
- 2024Survival of the Fittest Representation: A Case Study with Modular Additioncited by 7
- 2026Sequential Group Composition: A Window into the Mechanics of Deep Learningcited by 7
- 2026To Grok Grokking: Provable Grokking in Ridge Regressioncited by 6
- 2026On the Mechanism and Dynamics of Modular Addition: Fourier Features, Lottery Ticket, and Grokkingcited by 5
- 2025Feature Identification via the Empirical NTKcited by 4
- 2025Quiet Feature Learning in Algorithmic Taskscited by 2
- 2026Grokking on the Weight-Decay Clock: A Rate Hierarchy from Softly Broken Symmetriescited by 2
Built on by
Not cited yet.