Grokking vs. Learning: Same Features, Different Encodings

Dmitry Manning-Coe, Jacopo Gliozzi, Alexander G. Stapleton, Edward Hirst, Giuseppe De Tomasi +2 more
2/3/2025
cs.LGcond-mat.dis-nncs.AI

No confident code implementation found for this paper.

Abstract

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{manningcoe2025grokking,
  title  = {Grokking vs. Learning: Same Features, Different Encodings},
  author = {Dmitry Manning-Coe and Jacopo Gliozzi and Alexander G. Stapleton and Edward Hirst and Giuseppe De Tomasi and Barry Bradlyn and David S. Berman},
  year   = {2025},
  eprint = {2502.01739},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2502.01739v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2502.01739.svg)](https://codeofpaper.com/paper/2502.01739)

Discussion