mlsanityData to 7 Oct 2026

When Data Falls Short: Grokking Below the Critical Threshold

arXiv 2511.04760 ↗First posted 6 Nov 2025cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

In this paper, we investigate the phenomenon of grokking, where models exhibit delayed generalization following overfitting on training data. We focus on data-scarce regimes where the number of training samples falls below the critical threshold, making grokking unobservable, and on practical scenarios involving distribution shift. We first show that Knowledge Distillation (KD) from a model that has already grokked on a distribution (p1) can induce and accelerate grokking on a different distribution (p2), even when the available data lies below the critical threshold. This highlights the value of KD for deployed models that must adapt to new distributions under limited data. We then study training on the joint distribution (p1, p2) and demonstrate that while standard supervised training fails when either distribution has insufficient data, distilling from models grokked on the individual distributions enables generalization. Finally, we examine a continual pretraining setup, where a grokked model transitions from p1 to p2, and find that KD both accelerates generalization and mitigates catastrophic forgetting, achieving strong performance even with only 10% of the data. Together, our results provide new insights into the mechanics of grokking under knowledge transfer and underscore the central role of KD in enabling generalization in low-data and evolving distribution settings.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 29 of its 37 references that are in the map. First posted on arXiv 6 Nov 2025.

Builds on

29 of 37 references.

References · 29

  1. 2017Attention Is All You Needcited by 59,932
  2. 2017A Closer Look at Memorization in Deep Networkscited by 936
  3. 2023Progress measures for grokking via mechanistic interpretabilitycited by 822
  4. 2019Three scenarios for continual learningcited by 610
  5. 2022Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasetscited by 599
  6. 2019On the Efficacy of Knowledge Distillationcited by 377
  7. 2023A Comprehensive Survey on Test-Time Adaptation under Distribution Shiftscited by 353
  8. 2022Towards Understanding Grokking: An Effective Theory of Representation Learningcited by 229
  9. 2022Hidden Progress in Deep Learning: SGD Learns Parities Near the Computational Limitcited by 184
  10. 2021Towards Understanding Knowledge Distillationcited by 158
  11. 2022Omnigrok: Grokking Beyond Algorithmic Datacited by 142
  12. 2023Explaining grokking through circuit efficiencycited by 105
17 more
  1. 2023Grokking as the Transition from Lazy to Rich Training Dynamicscited by 102
  2. 2020Rethinking Importance Weighting for Deep Learning under Distribution Shiftcited by 92
  3. 2022The Slingshot Mechanism: An Empirical Study of Adaptive Optimizers and the Grokking Phenomenoncited by 90
  4. 2020Understanding and Improving Knowledge Distillationcited by 83
  5. 2023A Tale of Two Circuits: Grokking as Competition of Sparse and Dense Subnetworkscited by 78
  6. 2023Dichotomy of Early and Late Phase Implicit Biases Can Provably Induce Grokkingcited by 76
  7. 2020Do We Need Zero Training Loss After Achieving Zero Training Error?cited by 61
  8. 2024Deep Networks Always Grok and Here is Whycited by 49
  9. 2023Grokking as a First Order Phase Transition in Two Layer Networkscited by 48
  10. 2025Grokking at the Edge of Numerical Stabilitycited by 41
  11. 2024Grokfast: Accelerated Grokking by Amplifying Slow Gradientscited by 38
  12. 2023Predicting Grokking Long Before it Happens: A look into the loss landscape of models which grokcited by 31
  13. 2023Grokking in Linear Estimators -- A Solvable Model that Groks without Understandingcited by 25
  14. 2023To grok or not to grok: Disentangling generalization and memorization on corrupted algorithmic datasetscited by 24
  15. 2024Critical Data Size of Language Models from a Grokking Perspectivecited by 22
  16. 2025Let Me Grok for You: Accelerating Grokking via Embedding Transfer from a Weaker Modelcited by 13
  17. 2024Dual-Phase Continual Learning: Supervised Adaptation Meets Unsupervised Retentioncited by 5

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.