mlsanityData to 7 Oct 2026

Grokking vs. Learning: Same Features, Different Encodings

arXiv 2502.01739 ↗First posted 3 Feb 2025cs.LG cond-mat.dis-nn cs.AIcited by 2

Not on the map. Why?

Abstract (arXiv)

Grokking typically achieves similar loss to ordinary, "steady", learning. We ask whether these different learning paths - grokking versus ordinary training - lead to fundamental differences in the learned models. To do so we compare the features, compressibility, and learning dynamics of models trained via each path in two tasks. We find that grokked and steadily trained models learn the same features, but there can be large differences in the efficiency with which these features are encoded. In particular, we find a novel "compressive regime" of steady training in which there emerges a linear trade-off between model loss and compressibility, and which is absent in grokking. In this regime, we can achieve compression factors 25x times the base model, and 5x times the compression achieved in grokking. We then track how model features and compressibility develop through training. We show that model development in grokking is task-dependent, and that peak compressibility is achieved immediately after the grokking plateau. Finally, novel information-geometric measures are introduced which demonstrate that models undergoing grokking follow a straight path in information space.

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

Builds on

25 of 48 references.

References · 25

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2016Understanding intermediate layers using linear classifier probescited by 1,279
  3. 2023Progress measures for grokking via mechanistic interpretabilitycited by 822
  4. 2022Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasetscited by 599
  5. 2022Towards Understanding Grokking: An Effective Theory of Representation Learningcited by 229
  6. 2023Grokking as the Transition from Lazy to Rich Training Dynamicscited by 102
  7. 2022The Slingshot Mechanism: An Empirical Study of Adaptive Optimizers and the Grokking Phenomenoncited by 90
  8. 2021Separation of Scales and a Thermodynamic Description of Feature Learning in Some CNNscited by 53
  9. 2023The Local Learning Coefficient: A Singularity-Aware Complexity Measurecited by 50
  10. 2024Deep Networks Always Grok and Here is Whycited by 49
  11. 2023Grokking as a First Order Phase Transition in Two Layer Networkscited by 48
  12. 2025Grokking at the Edge of Numerical Stabilitycited by 41
13 more
  1. 2020On the training dynamics of deep networks with L2 regularizationcited by 38
  2. 2024Why Do You Grok? A Theoretical Analysis of Grokking Modular Additioncited by 34
  3. 2018Fisher Information and Natural Gradient Learning of Random Deep Networkscited by 28
  4. 2023Dynamical versus Bayesian Phase Transitions in a Toy Model of Superpositioncited by 28
  5. 2023To grok or not to grok: Disentangling generalization and memorization on corrupted algorithmic datasetscited by 24
  6. 2024Critical Data Size of Language Models from a Grokking Perspectivecited by 22
  7. 2023Grokking as Compression: A Nonlinear Complexity Perspectivecited by 14
  8. 2024Deep Grokking: Would Deep Neural Networks Generalize Better?cited by 13
  9. 2022The Inverse of Exact Renormalization Group Flows as Statistical Inferencecited by 11
  10. 2023Understanding Grokking Through A Robustness Viewpointcited by 10
  11. 2022On the Dynamics of Inference and Learningcited by 9
  12. 2024Bayesian RG Flow in Neural Network Field Theoriescited by 9
  13. 2024NCoder -- A Quantum Field Theory approach to encoding datacited by 7

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 2.

2 papers.