Paper Breakdowns  /  Scaling Laws
Paper 18~8 min readOpenAI · 2020
Paper Breakdown

Scaling Laws,
explained.

Most of deep learning is alchemy — try something, see if it works. This paper found a rare piece of physics: make a language model bigger, feed it more data, or give it more compute, and its error falls along a smooth, straight line you can draw on a log-log plot. Suddenly you could predict how good a model would be before spending a fortune training it. That forecast is what made GPT-3 a calculated bet.

Video breakdown
The animated walkthrough is in production.
Read the full breakdown below in the meantime ↓
01

The question nobody had answered cleanly

By 2020, "bigger models are better" was folk wisdom, but folk wisdom is a terrible basis for spending millions on a training run. Nobody could say how much better a model would get if you doubled its size, or whether returns would suddenly flatten. Every large run was, in part, a leap of faith.

The Kaplan et al. paper asked the question as a scientist would: hold everything else fixed and measure exactly how a Transformer's test loss — its next-word prediction error — changes as you vary model size, data, and compute across many orders of magnitude. Not a hunch. A curve.

02

The finding: loss falls as a power law

The headline result is startlingly clean. Plot loss against model size (or data, or compute) on a log-log scale and you get a straight line — the signature of a power law. Over seven orders of magnitude, the relationship holds: each time you multiply the resource, loss drops by a predictable, constant fraction.

Straight lines on a log-log plot are the same math that describes earthquakes and city sizes. Finding one inside neural networks meant that scaling wasn't chaotic or task-specific luck — it was a regular, extrapolatable trend. And crucially, within the range studied there was no wall: the line kept going down.

What a power law means here

A power law says loss ≈ (resource)−α. The exponent α is small, so you need to multiply resources by 10× to shave loss by a modest amount — diminishing returns, but reliable ones. You always know roughly what the next 10× buys.

03

The three knobs

Loss responds to three resources, each its own power law when it's the bottleneck:

The three levers of scale
N
Parameters
How big the model is — the number of weights it has to learn with.
D
Data
How many tokens of text it trains on.
C
Compute
Total FLOPs spent training — roughly N × D.

The key insight is the interaction: loss is set by whichever resource is scarcest. A giant model starved of data plateaus; a mountain of data fed to a tiny model plateaus too. To keep loss falling you have to grow all three together — and the paper gives a combined formula predicting loss from N and D at once.

04

Loss you can forecast

Here's the practical magic. Because the curves are so regular, you can run a handful of small, cheap experiments, fit the power law, and extrapolate to predict the loss of a model 100× or 1000× bigger — one you haven't built yet. The forecast is close enough to plan around.

That converts a gamble into an engineering decision. Instead of "let's train a huge model and pray," a lab can say "our curve predicts this budget yields this loss, which should unlock these capabilities — worth it." Scaling laws made the cost of frontier models justifiable to the people signing the checks.

05

Compute-optimal: how to spend a fixed budget

The sharpest practical question: if you have a fixed pile of compute, should you train a bigger model or train on more data? The Kaplan paper's answer was to lean heavily toward size — make the model much bigger and, perhaps surprisingly, don't train it all the way to convergence; stop early and spend the compute on parameters instead.

This prescription directly shaped the era: GPT-3 is enormous (175B) but trained on comparatively modest data. It was the scaling laws saying "go big." Two years later, Chinchilla revisited the analysis and found a correction — those models were undertrained. For truly compute-optimal training, parameters and tokens should grow in roughly equal measure, meaning smaller models on much more data. The power-law framework survived; the recommended recipe flipped.

The plot twist

Kaplan (2020) said: bigger models, less data. Chinchilla (2022) said: not so fast — you're undertraining. Same laws, better constants. It's a rare case where the field publicly corrected its own influential rule of thumb.

06

What it unlocked

Scaling laws are the intellectual license for the entire modern-LLM era. They gave labs the confidence — and the numbers — to commit to nine-figure training runs, because the payoff could be estimated in advance. The chain runs straight from this paper to GPT-3 and every frontier model after it.

Before scaling lawsAfter scaling laws
"Bigger seems better" (folk wisdom)Loss predictable from N, D, C
Each big run is a gambleExtrapolate from small runs
Scale by intuitionScale by forecast

They also reframed research priorities. If loss falls predictably with scale, then compute and data are first-class levers, sometimes beating architectural cleverness. A lot of the last few years' progress is, bluntly, this paper's curves being ridden upward.

07

The fine print

Scaling laws measure loss, not usefulness. Lower next-word error correlates with capability, but the mapping is loose — a big drop in loss can yield a small or a surprising jump in real skill (emergent abilities). The laws forecast the curve, not exactly which abilities appear where on it.

They also have boundaries: the exponents depend on architecture and data quality, the specific compute-optimal ratio was revised by Chinchilla, and no power law can extend forever — eventually data runs out or the curve must bend. And "just scale" says nothing about alignment, safety, or truthfulness, which don't come for free with size.

08

Why it still matters

This is the paper that turned scaling from a vibe into a discipline. Every time a lab announces a bigger model with a straight face about expected gains, they're invoking scaling laws. The practice of fitting small-scale curves and extrapolating to plan a flagship run is now standard operating procedure across the industry.

More deeply, it changed what the field believes. The "scaling hypothesis" — that a large fraction of intelligence-like behavior falls out of scale applied to a simple objective — got its empirical backbone here. Whether that belief is exactly right is still argued, but it has driven the trajectory of AI more than almost any single idea since the Transformer itself.

The pairing

Read this with Chinchilla (the correction) and GPT-3 (scaling in action). Together they're the story of how "make it bigger" became a rigorous plan.

Frequently asked

Quick answers

What are neural scaling laws?

Empirical power laws (Kaplan et al., 2020) showing a language model's loss falls smoothly and predictably as you increase model size, data, or compute — so you can forecast performance before training.

What are the three factors?

N (parameters), D (dataset size in tokens), and C (training compute ≈ N × D). Loss is limited by whichever is scarcest, so you scale all three together.

What is compute-optimal training?

For a fixed compute budget, the model and data sizes that minimize loss. Kaplan leaned toward bigger models; Chinchilla later showed parameters and tokens should scale about equally.

Why do scaling laws matter?

They made huge training runs a forecast instead of a gamble — the justification behind GPT-3 and every frontier model, and the empirical backbone of the scaling hypothesis.

Did Chinchilla replace them?

It refined them. Same power-law framework, but a corrected compute-optimal ratio: smaller models trained on much more data.

Finished this one? 0 / 30 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