Beyond Progress Measures: Theoretical Insights into the Mechanism of Grokking
Not on the map. Why?
Abstract (arXiv)
Grokking, referring to the abrupt improvement in test accuracy after extended overfitting, offers valuable insights into the mechanisms of model generalization. Existing researches based on progress measures imply that grokking relies on understanding the optimization dynamics when the loss function is dominated solely by the weight decay term. However, we find that this optimization merely leads to token uniformity, which is not a sufficient condition for grokking. In this work, we investigate the grokking mechanism underlying the Transformer in the task of prime number operations. Based on theoretical analysis and experimental validation, we present the following insights: (i) The weight decay term encourages uniformity across all tokens in the embedding space when it is minimized. (ii) The occurrence of grokking is jointly determined by the uniformity of the embedding space and the distribution of the training dataset. Building on these insights, we provide a unified perspective for understanding various previously proposed progress measures and introduce a novel, concise, and effective progress measure that could trace the changes in test loss more accurately. Finally, to demonstrate the versatility of our theoretical framework, we design a dedicated dataset to validate our theory on ResNet-18, successfully showcasing the occurrence of grokking. The code is released at https://github.com/Qihuai27/Grokking-Insight.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 26 of its 30 references that are in the map. First posted on arXiv 4 Apr 2025.
Builds on
26 of 30 references.
References · 26
- 2017Attention Is All You Needcited by 60,361
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2023Progress measures for grokking via mechanistic interpretabilitycited by 839
- 2022Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasetscited by 629
- 2022Towards Understanding Grokking: An Effective Theory of Representation Learningcited by 230
- 2022Hidden Progress in Deep Learning: SGD Learns Parities Near the Computational Limitcited by 187
- 2019Complexity of Linear Regions in Deep Networkscited by 167
- 2022The Slingshot Mechanism: An Empirical Study of Adaptive Optimizers and the Grokking Phenomenoncited by 94
- 2023Grokking modular arithmeticcited by 83
- 2023Dichotomy of Early and Late Phase Implicit Biases Can Provably Induce Grokkingcited by 80
- 2024Grokked Transformers are Implicit Reasoners: A Mechanistic Journey to the Edge of Generalizationcited by 79
- 2024Deep Networks Always Grok and Here is Whycited by 51
14 more
- 2024Get rich quick: exact solutions reveal how unbalanced initializations promote rapid feature learningcited by 42
- 2024Grokfast: Accelerated Grokking by Amplifying Slow Gradientscited by 41
- 2024Learning to grok: Emergence of in-context learning and skill composition in modular arithmetic taskscited by 40
- 2024Why Do You Grok? A Theoretical Analysis of Grokking Modular Additioncited by 36
- 2024Approaching Deep Learning through the Spectral Dynamics of Weightscited by 31
- 2024Emergence in non-neural models: grokking modular arithmetic via average gradient outer productcited by 28
- 2024Critical Data Size of Language Models from a Grokking Perspectivecited by 24
- 2024Unified View of Grokking, Double Descent and Emergent Abilities: A Perspective from Circuits Competitioncited by 23
- 2024Towards Uncovering How Large Language Model Works: An Explainability Perspectivecited by 22
- 2024Information-Theoretic Progress Measures reveal Grokking is an Emergent Phase Transitioncited by 17
- 2024Acceleration of Grokking in Learning Arithmetic Operations via Kolmogorov-Arnold Representationcited by 3
- 2024A rationale from frequency perspective for grokking in training neural networkcited by 3
- 2024Unveiling the Dynamics of Information Interplay in Supervised Learningcited by 3
- 2024Measuring Sharpness in Grokkingcited by 1
Built on by
Citing papers per year: 2026: 1.
1 paper.