Grokking Metrics Overstate Compression; Lag Between Accuracy and Representation
Summary
This paper reveals that common metrics for "grokking" (sudden generalization) overstate representation compression by 3-5x in MLPs and 1.3-1.5x in transformers, as compression lags accuracy by thousands of steps. It introduces an audit toolkit to accurately measure grokking.
Why it matters
Accurate measurement of grokking and representation learning is critical for understanding and improving neural network training dynamics, especially for developing more efficient and robust AI models.
How to implement this in your domain
- 1Adopt the proposed audit toolkit for evaluating representation metrics in your own grokking experiments.
- 2Re-evaluate past grokking studies or internal experiments using the new measurement validity audit.
- 3Consider the lag between accuracy and representation compression when interpreting training dynamics.
- 4Investigate the impact of architectural choices like LayerNorm on the timing and extent of representation compression.
Who benefits
Key takeaways
- Existing grokking representation metrics often significantly overstate actual compression.
- Representation compression lags generalization accuracy by thousands of training steps.
- Architectural components like LayerNorm can influence the timing of compression.
- A new audit toolkit is proposed for more accurate measurement of grokking phenomena.
Original post by Truong Xuan Khanh
"arXiv:2607.06639v1 Announce Type: cross Abstract: On modular arithmetic, a network's embedding keeps compressing for tens of thousands of steps after it has already generalized. Reading effective rank at the grokking transition overstates the converged value by 3-5x on an MLP, an…"
View on XOriginally posted by Truong Xuan Khanh on X · view source
Want to go deeper?
Turn these trends into skills with Learnijoy's hands-on AI & tech courses.
Explore coursesMore in AI Research
Transformers Learn Non-Invertible Modular Multiplication via Stratified Fourier Mechanisms.
This research investigates how small transformers learn modular integer multiplication over composite moduli, a non-invertible operation. It proposes the "monoid extension" theory, suggesting models partition input space into hierarchical algebraic regions where Fourier mechanisms apply, explaining how embeddings, attention, and local features contribute to the computation.
New Interpretable Model Handles Feature Interactions in Tabular Data.
This paper introduces Interaction Aware Interpretable Machine Learning (IAIML), a framework for tabular data that addresses the limitation of traditional interpretable models in capturing feature interactions. IAIML uses adaptive discretization, pairwise interaction scoring, and a partitioned explanation budget to achieve high accuracy while maintaining interpretability.
Principles of Deep Feedforward ReLU Networks Unveiled.
This paper systematically studies the mechanisms of deep feedforward ReLU networks, generalizing principles from two-layer networks to deeper architectures. It explains how hidden-layer units form piecewise linear manifolds to divide input space and how paths and their relationships are central to understanding the back-propagation training solution.