Vibe Engines
YouTube
Paper Breakdowns  /  Chinchilla
Paper 08~7 min readDeepMind · 2022
Paper Breakdown

Chinchilla,
explained.

For years the race was simple: more parameters, bigger model, better AI. Then DeepMind ran the numbers and found the whole field had been building models backwards — too big, and starved of data. Their fix produced a model a quarter the size of the giants that beat all of them.

The delta

What changes against Scaling Laws: the same axis, the opposite answer

This rung exists to overturn the one below it, and it is worth being precise about how narrow the disagreement is. Rung 4 and this paper agree that test loss follows a power law in compute; they agree on the method of fitting curves to smaller runs and extrapolating; they measure the same quantity, the compute-optimal split of a fixed budget between parameters and training tokens, in the same units. They disagree only on the answer — and the disagreement is large enough to have misallocated the field's compute for two years.

Rung 4: raise compute, and grow parameters several times faster than data. This paper: grow them at roughly the same rate, which lands on the rule of thumb of about 20 training tokens per parameter.

Now put the ladder's numbers through that rule. GPT-3: 175B parameters on ~300B tokens — about 1.7 tokens per parameter, roughly a twelfth of optimal. Gopher, the 280B model this paper's authors had trained the year before on the same ~300B tokens, is about 1.1. Both were not merely suboptimal; they were spending most of their budget on the wrong side of the trade.

The proof is the part to take seriously, because it is a like-for-like swap rather than a new record: the same compute budget as Gopher, spent at the predicted ratio, produces a 70B model trained on 1.4T tokens — a quarter of the parameters, about four and a half times the data — and it outperforms the 280B model it replaces. A smaller model that is also cheaper to serve. The exercise below re-derives that 70B from Gopher's budget using nothing but the two rules.

01

The bigger-is-better race

After GPT-3, the headline number was parameter count. 175 billion, then 280 billion (Gopher), then 530 billion. Each lab poured its compute budget into stacking more parameters, on the assumption that size was the lever that mattered most.

But every model is really a bet about how to spend one thing — a fixed compute budget — across two knobs: how many parameters the model has, and how many tokens of data it trains on. The whole field had quietly turned one knob to the maximum and left the other alone.

02

The real question

DeepMind asked it precisely: for a fixed amount of compute, what split between parameters and data gives the best model? To answer, they trained over 400 models across a wide range of sizes and data amounts, and fit curves to how loss falls as you trade one knob against the other.

The answer contradicted the entire industry.

03

The answer: scale both, in lockstep

To use compute optimally, parameters and training tokens should grow together — roughly in equal proportion. Their rule of thumb: about 20 training tokens per parameter. A 10-billion-parameter model wants ~200 billion tokens; double the model, double the data.

Two rules turn that into an exact recipe. Training compute is C ≈ 6·N·D (params × tokens), and the optimal split sets D = 20·N. Substitute one into the other and the whole budget collapses to a single unknown:

Give me a compute budget and this returns the one best model size — no sweep, just a square root.

By that measure, GPT-3 and Gopher were wildly out of balance — enormous models fed far too little data. They were undertrained: all that parameter capacity sat half-empty because the models never saw enough text to fill it.

Worth knowing

The earlier scaling laws (Kaplan et al., 2020) had suggested most compute should go to parameters. Chinchilla corrected that — its curves put far more weight on data — and it's why post-2022 models are trained on trillions of tokens.

04

The proof: Chinchilla vs Gopher

To settle it, they built Chinchilla: same compute budget as their own 280B Gopher, but spent the compute-optimal way — 70 billion parameters (a quarter the size) trained on 1.4 trillion tokens (about four times the data).

Same compute budget, spent two ways
Gopher
280B params
300B tok
Chinchilla
70B
1.4T tokens
parameterstraining data

Same total compute — just a different split between the two knobs.

05

The numbers

Chinchilla outperformed Gopher, GPT-3, and other far larger models across a broad sweep of benchmarks — language understanding, reasoning, reading comprehension — despite being a fraction of their size.

ModelParametersTraining tokensTokens / param
GPT-3175B~300B~1.7
Gopher280B~300B~1.1
Chinchilla70B1.4T~20

And a deployment bonus falls out for free: a 70B model is far cheaper and faster to run than a 280B one — which matters enormously once millions of people are querying it every day.

06

Why it still matters

Chinchilla rewired how the field spends compute. "Chinchilla-optimal" became standard vocabulary, and the trillion-token training runs behind LLaMA and nearly every capable model since are its direct consequence — smaller, data-rich models tuned for both quality and cheap inference.

It's also a caution against the obvious metric. For years "bigger" was the number everyone chased, and it was the wrong knob to max out. The lesson — balance your budget, don't just crank the one number people brag about — outlasts any single model.

Since then

What the authors admit, and what happened next

The paper's own caveats are load-bearing. The fit is over a specific family of models, tokenizer and training setup, and the authors do not claim the ~20:1 coefficient transfers outside it. They note their largest verification run is a single model, so the confirmation of the extrapolation rests on one data point at the scale that matters most. And they are clear that the objective being optimised is training compute for a target loss — not the total cost of the model over its life.

That last one turned out to be the important limitation, and it was the field rather than the paper that drew the conclusion: if a model is going to serve a great many requests, inference cost dominates, and you should deliberately train past the compute-optimal point — a smaller model on far more tokens than 20:1 — because you pay the extra training once and save on every query. Most widely deployed open-weight models since are trained well beyond Chinchilla-optimal for exactly this reason, which means the rule is routinely and knowingly violated in production. It is not a refutation; it is a different objective function.

How it held up otherwise: the correction itself held. The claim that parameters and data should scale together is now standard, and "Chinchilla-optimal" entered the vocabulary. The trillion-token training runs behind essentially every capable model since are downstream of this page. Rung 6 then attacks the axis this paper does not measure at all.

SOLVE IT YOURSELF

Re-derive Chinchilla from Gopher's budget

The paper's headline model isn't a mystery — it's a square root. This takes Gopher's exact compute budget and spends it compute-optimally using just the two rules (C = 6·N·D and D = 20·N), landing on ~65B parameters and ~1.3T tokens — essentially the 70B / 1.4T Chinchilla the authors actually built. Then it scores GPT-3, Gopher, and Chinchilla on tokens-per-param and flags which were starved of data. Change the budget and watch the optimal model resize.

YOUR TASK

Write the body of optimal_split. Everything else in the file is already written; this is the function the paper is about. Press ▶ Run to check it against the 5 assertions below — they start red.

WHAT IT HAS TO SATISFY — 5 ASSERTIONS
  1. Chinchilla trained at ~20 tokens per parameter
  2. Gopher's compute is 6·N·D ≈ 5e23 FLOPs
  3. Spending that budget optimally lands near Chinchilla's 70B
  4. The optimal split always obeys the 20:1 rule
  5. Gopher was badly undertrained (well under 20:1)
CPython · WebAssembly
Check yourself

5 questions on this paper

Answer each one out loud before you open it. Recalling an answer is what makes it stick; recognising one you have just read is not. Your score is kept on this device.

What is the Chinchilla scaling law?

Show answer

The Chinchilla paper (2022) found that for a fixed compute budget, the best language model comes from scaling the number of parameters and the number of training tokens together, in roughly equal measure — about 20 training tokens per parameter. Earlier models were far too large for how little data they saw, wasting compute; the compute-optimal frontier is much more data-heavy than people assumed.

Why were models before Chinchilla too big?

Show answer

Models like GPT-3 (175B) and Gopher (280B) put almost all of their compute budget into parameters and trained on relatively few tokens. Chinchilla showed this is inefficient: those giant models were undertrained, and a smaller model trained on much more data would reach the same or better performance for the same compute.

How did a 70B model beat a 280B model?

Show answer

Chinchilla has 70 billion parameters — a quarter of Gopher's 280 billion — but was trained on about 1.4 trillion tokens, roughly four times more data, using the same compute budget. Following the compute-optimal balance, this smaller-but-better-trained model outperformed Gopher and other larger models across a wide range of benchmarks.

What does 20 tokens per parameter mean?

Show answer

It's the rough rule of thumb from the paper's fitted scaling curves: to train a model compute-optimally, use about 20 training tokens for every parameter. A 10-billion-parameter model, for example, should see on the order of 200 billion tokens. It's a heuristic, not a hard law, but it reframed how teams size models and datasets.

Is bigger always better for language models?

Show answer

Not for a fixed compute budget. Chinchilla showed that beyond a point, adding parameters without adding proportional data wastes compute. It also highlighted a practical bonus: a smaller compute-optimal model is cheaper and faster to run at inference, which matters enormously once a model is deployed to millions of users.

Where this sits

Pre-training, and the scaling laws

The ladder where rung 5 overturns rung 4. Read `scaling-laws` before `chinchilla` — the second measures the same axis in the same units and gets a different answer.

  1. 1BERT2019
  2. 2T52020
  3. 3GPT-32020
  4. 4Scaling Laws2020
  5. 5Chinchilla2022
  6. 6Textbooks Are All You Need2023
  7. 7Muon2024

All 110 papers, in 19 ladders →

Finished this one? 0 / 110 Paper Breakdowns done

Explore the topic

See this alongside everything else on the same subject — handbooks, system designs, challenges and tools, in one place.

More Paper Breakdowns