mlsanityData to 14 Oct 2026

Tracing the Path to Grokking: Embeddings, Dropout, and Network Activation

arXiv 2507.11645 ↗First posted 15 Jul 2025cs.LG cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Grokking refers to delayed generalization in which the increase in test accuracy of a neural network occurs appreciably after the improvement in training accuracy This paper introduces several practical metrics including variance under dropout, robustness, embedding similarity, and sparsity measures, that can forecast grokking behavior. Specifically, the resilience of neural networks to noise during inference is estimated from a Dropout Robustness Curve (DRC) obtained from the variation of the accuracy with the dropout rate as the model transitions from memorization to generalization. The variance of the test accuracy under stochastic dropout across training checkpoints further exhibits a local maximum during the grokking. Additionally, the percentage of inactive neurons decreases during generalization, while the embeddings tend to a bimodal distribution independent of initialization that correlates with the observed cosine similarity patterns and dataset symmetries. These metrics additionally provide valuable insight into the origin and behaviour of grokking.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 22 of its 24 references that are in the map. First posted on arXiv 15 Jul 2025.

Builds on

22 of 24 references.

References · 22

  1. 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,170
  2. 2015Dropout as a Bayesian Approximation: Representing Model Uncertainty in Deep Learningcited by 4,448
  3. 2017Network Dissection: Quantifying Interpretability of Deep Visual Representationscited by 708
  4. 2022Towards Understanding Grokking: An Effective Theory of Representation Learningcited by 230
  5. 2022Hidden Progress in Deep Learning: SGD Learns Parities Near the Computational Limitcited by 187
  6. 2022Omnigrok: Grokking Beyond Algorithmic Datacited by 146
  7. 2023Explaining grokking through circuit efficiencycited by 111
  8. 2023Grokking as the Transition from Lazy to Rich Training Dynamicscited by 108
  9. 2023Grokking modular arithmeticcited by 83
  10. 2023A Tale of Two Circuits: Grokking as Competition of Sparse and Dense Subnetworkscited by 83
  11. 2024Deep Networks Always Grok and Here is Whycited by 51
  12. 2025Grokking at the Edge of Numerical Stabilitycited by 46
10 more
  1. 2024Why Do You Grok? A Theoretical Analysis of Grokking Modular Additioncited by 36
  2. 2023Predicting Grokking Long Before it Happens: A look into the loss landscape of models which grokcited by 35
  3. 2023To grok or not to grok: Disentangling generalization and memorization on corrupted algorithmic datasetscited by 24
  4. 2024The Complexity Dynamics of Grokkingcited by 22
  5. 2024Deep Grokking: Would Deep Neural Networks Generalize Better?cited by 15
  6. 2025Let Me Grok for You: Accelerating Grokking via Embedding Transfer from a Weaker Modelcited by 13
  7. 2024Progress Measures for Grokking on Real-world Taskscited by 8
  8. 2025Mechanistic Insights into Grokking from the Embedding Layercited by 6
  9. 2025Learning the symmetric group: large from smallcited by 3
  10. 2024Controlling Grokking with Nonlinearity and Data Symmetrycited by 1

Built on by

Not cited yet.