Misalignment of Low-Loss Regions Causes Grokking
Not on the map. Why?
Abstract (arXiv)
Grokking refers to the delayed emergence of validation-set generalization after a model has already overfit the training set. Although first observed in small algorithmic tasks trained with transformers, its underlying mechanism remains unsettled. In this work, we develop an analysis framework based on mode connectivity and the geometry of low-loss regions. The framework predicts that the standard modular-arithmetic setting does not always produce grokking: under a symmetry-preserving train/validation split, we observe a stable anti-grokking case in which validation performance does not recover. This counterexample challenges several existing correlational explanations of grokking. More broadly, our analysis framework and results further suggest that grokking arises when the low-loss regions induced by the training and validation partitions are misaligned. Once these regions become well aligned, training hyperparameters alone cannot produce grokking and the observed dynamics collapse to either trainable or non-trainable behavior.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 30 of its 38 references that are in the map. First posted on arXiv 30 Sep 2026.
Builds on
30 of 38 references.
References · 30
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,364
- 2016Densely Connected Convolutional Networkscited by 6,720
- 2022Emergent Abilities of Large Language Modelscited by 2,512
- 2016Understanding deep learning requires rethinking generalizationcited by 1,674
- 2017Visualizing the Loss Landscape of Neural Netscited by 1,130
- 2023Progress measures for grokking via mechanistic interpretabilitycited by 839
- 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 637
- 2022Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasetscited by 629
- 2022Git Re-Basin: Merging Models modulo Permutation Symmetriescited by 471
- 2018Essentially No Barriers in Neural Network Energy Landscapecited by 330
18 more
- 2021The Role of Permutation Invariance in Linear Mode Connectivity of Neural Networkscited by 291
- 2022Towards Understanding Grokking: An Effective Theory of Representation Learningcited by 230
- 2020Deep learning versus kernel learning: an empirical study of loss landscape geometry and the time evolution of the Neural Tangent Kernelcited by 187
- 2023Explaining grokking through circuit efficiencycited by 111
- 2022The Slingshot Mechanism: An Empirical Study of Adaptive Optimizers and the Grokking Phenomenoncited by 94
- 2021Loss Surface Simplexes for Mode Connecting Volumes and Fast Ensemblingcited by 75
- 2023Going Beyond Linear Mode Connectivity: The Layerwise Linear Feature Connectivitycited by 50
- 2020Deep Learning is Singular, and That's Goodcited by 49
- 2025Grokking at the Edge of Numerical Stabilitycited by 46
- 2020On the training dynamics of deep networks with L2 regularizationcited by 39
- 2019Overfitting Mechanism and Avoidance in Deep Neural Networkscited by 30
- 2024Critical Data Size of Language Models from a Grokking Perspectivecited by 24
- 2025A Closer Look at Model Collapse: From a Generalization-to-Memorization Perspectivecited by 18
- 2025Grokking in the Wild: Data Augmentation for Real-World Multi-Hop Reasoning with Transformerscited by 12
- 2024Model-free quantification of completeness, uncertainties, and outliers in atomistic machine learning using information theorycited by 10
- 2026To Grok Grokking: Provable Grokking in Ridge Regressioncited by 8
- 2024How Good is a Single Basin?cited by 4
- 2025Connecting Independently Trained Modes via Layer-Wise Connectivitycited by 3
Built on by
Not cited yet.