mlsanityData to 7 Oct 2026

NeuralGrok: Accelerate Grokking by Neural Gradient Transformation

arXiv 2504.17243 ↗First posted 24 Apr 2025cs.LG cs.AIcited by 2

Not on the map. Why?

Abstract (arXiv)

Grokking is proposed and widely studied as an intricate phenomenon in which generalization is achieved after a long-lasting period of overfitting. In this work, we propose NeuralGrok, a novel gradient-based approach that learns an optimal gradient transformation to accelerate the generalization of transformers in arithmetic tasks. Specifically, NeuralGrok trains an auxiliary module (e.g., an MLP block) in conjunction with the base model. This module dynamically modulates the influence of individual gradient components based on their contribution to generalization, guided by a bilevel optimization algorithm. Our extensive experiments demonstrate that NeuralGrok significantly accelerates generalization, particularly in challenging arithmetic tasks. We also show that NeuralGrok promotes a more stable training paradigm, constantly reducing the model's complexity, while traditional regularization methods, such as weight decay, can introduce substantial instability and impede generalization. We further investigate the intrinsic model complexity leveraging a novel Absolute Gradient Entropy (AGE) metric, which explains that NeuralGrok effectively facilitates generalization by reducing the model complexity. We offer valuable insights on the grokking phenomenon of Transformer models, which encourages a deeper understanding of the fundamental principles governing generalization ability.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 14 of its 20 references that are in the map. First posted on arXiv 24 Apr 2025.

Builds on

14 of 20 references.

References · 14

  1. 2022Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasetscited by 599
  2. 2015Train faster, generalize better: Stability of stochastic gradient descentcited by 547
  3. 2022Towards Understanding Grokking: An Effective Theory of Representation Learningcited by 229
  4. 2023Grokking as the Transition from Lazy to Rich Training Dynamicscited by 102
  5. 2022The Slingshot Mechanism: An Empirical Study of Adaptive Optimizers and the Grokking Phenomenoncited by 90
  6. 2019On Generalization Error Bounds of Noisy Gradient Methods for Non-Convex Learningcited by 57
  7. 2023Unifying Grokking and Double Descentcited by 49
  8. 2024Deep Networks Always Grok and Here is Whycited by 49
  9. 2025Grokking at the Edge of Numerical Stabilitycited by 41
  10. 2024Grokfast: Accelerated Grokking by Amplifying Slow Gradientscited by 38
  11. 2020On the Overlooked Pitfalls of Weight Decay and How to Mitigate Them: A Gradient-Norm Perspectivecited by 25
  12. 2024Deep Grokking: Would Deep Neural Networks Generalize Better?cited by 13
2 more
  1. 2024Progress Measures for Grokking on Real-world Taskscited by 7
  2. 2023Inconsistency, Instability, and Generalization Gap of Deep Neural Network Trainingcited by 6

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 2.

2 papers.