Math & Optimization · advanced · concept 75 of 311 · Updated Nov 4, 2026
Grokking
A network memorizes a small dataset, sits at near-perfect training accuracy with poor test accuracy for a long time, then suddenly generalizes. Power et al. at OpenAI reported it in 2022 on modular addition. Nanda et al. reverse-engineered a grokked transformer and found a Fourier-based algorithm, with weight decay slowly favoring that circuit over the memorized solution. Test loss can stay flat long after most people would stop training.
Top AI contributors on this
- Geoffrey HintonUniversity of Toronto (emeritus)
- Yoshua BengioLawZero / Université de Montréal
- Yann LeCunAMI Labs / NYU
- Andrew NgDeepLearning.AI / AI Fund
- Ilya SutskeverSafe Superintelligence Inc. (SSI)
- Andrej KarpathyAnthropic
Key terms
Where you meet it in the real world
Studying how networks learn algorithms, mechanistic interpretability research, choosing weight decay and training length, understanding emergent abilities in LLMs
Videos
Welch Labs · YouTube
Yannic Kilcher · YouTube
Guides and articles
Courses, papers, and more