
Grokking: A 777-Parameter Transformer Learned Real Math
In January 2025, something remarkable happened.
以下正文同步自 Hacker News 最新,版权归原站所有,已转换为易读排版。
In January 2025, something remarkable happened.
A transformer with only 777 parameters learned to perform 10-digit addition with 99.69% accuracy.
To memorize all possible 10-digit addition problems, you’d need roughly 10^20 parameters. This model had 777. It couldn’t possibly memorize. Which means it had to actually learn the algorithm.
Grokking is a phenomenon where neural networks suddenly generalize long after they’ve memorized the training data.
Phase 1 (Memorization): The model achieves 100% training accuracy by memorizing examples. Test accuracy stays near random (0%).
Phase 2 (Plateau): Nothing visible happens. Training loss is low. Test accuracy is still garbage. Most people stop training here.
Phase 3 (Grokking): Suddenly — often thousands of epochs later — test accuracy jumps from ~0% to ~100%. The model has “figured out” the underlying algorithm.
The original 2022 paper — Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasets by Alethea Power, Yuri Burda, Harri Edwards, Igor Babuschkin, and Vedant Misra at OpenAI — demonstrated this phenomenon on modular arithmetic (like a + b mod 97). If you have not read it, the YouTube walkthrough is the best 20-minute investment you can make in understanding why this matters. The 777-parameter result pushed it further: grokking works on arbitrary-precision decimal arithmetic — the kind of math we actually use.
The winning model from yhavinga/gpt-acc-jax:
Layers: 1 Hidden dim: 7 Attention heads: 1 FFN dim: 14 (2× expansion) Vocab size: 14 Context length: 35
Key optimizations that got it this small:
This is fascinating: there’s a hard threshold around 800 parameters where models abruptly go from 0% to 100% accuracy.
Below the cliff: no amount of training helps. The model simply lacks capacity. Above the cliff: grokking happens reliably.
The transition is sharp — not gradual. It suggests there’s a minimum representational capacity needed to encode the addition algorithm.
The leading theory involves weight decay and representation compression.
In Neel Nanda’s mechanistic interpretability work, researchers literally reverse-engineered grokked models and found they’d learned Fourier features for modular arithmetic — the same mathematical structure humans would use.
The network didn’t just learn to generalize. It discovered the correct math.
At The Menon Lab, we’re running grokking experiments on modular arithmetic:
Training config (matched to 777-param paper)
OPERATION = 'add' # Modular addition P = 97 # Prime modulus EMBED_DIM = 7 # Match 777-param model NUM_EPOCHS = 100000 # 100k epochs for grokking! LEARNING_RATE = 2e-2 # Higher LR for tiny models WEIGHT_DECAY = 1.0 # Crucial for grokking
Our goal: replicate grokking, visualize the weight evolution, and extend it to other arithmetic operations (subtraction, multiplication, division).
The code lives at menonpg/tiny-transformers.
-
Neural networks can learn algorithms, not just patterns. The 777-parameter model didn’t memorize. It couldn’t. It discovered a general procedure for addition that works on numbers it had never seen.
-
Overtraining might be underrated. We typically stop training when validation loss plateaus. Grokking shows that useful learning can happen long after apparent convergence.
-
Weight decay isn’t just regularization. It’s a force that pushes networks toward simpler, more general solutions — even when memorization works fine on the training set.
-
Interpretability gets concrete. When a model groks, we can often reverse-engineer what it learned. This opens a path to understanding neural networks mechanistically.
These are active research areas. And with transformers this small, anyone with a laptop can run experiments.
git clone https://github.com/menonpg/tiny-transformers cd tiny-transformers/notebooks
Open grokking_arithmetic.ipynb in Colab or Jupyter
Watch the training curves. The sudden jump from memorization to generalization is genuinely thrilling to witness.
Grokking reminds us that neural networks are stranger — and more capable — than we give them credit for. A 777-parameter model discovered addition. What else might be waiting to be grokked?
Dr. Prahlad G. Menon is a researcher and engineer exploring AI, healthcare, and practical tooling. This blog documents interesting projects and tools from the AI/ML ecosystem. Learn more →
正文由 探How 从来源站点 RSS 同步,内容未经改写;遇到排版缺失或需要图片、视频时请以原文为准。