Onpode
Cover art for How compute and data follow power laws — the durable pattern beneath capability curves

How compute and data follow power laws — the durable pattern beneath capability curves

June 24, 2026 · 5 min

David Sterling & Megan Skiendel

OpenAI's 2020 Kaplan scaling laws paper showed AI loss falls on a smooth power-law curve across seven orders of magnitude of compute — a span from one dollar to U.S. GDP. DeepMind's 2022 Chinchilla paper then showed the optimal parameter-to-token ratio was roughly 1:1, not the 4:1 the field had assumed, making models like PaLM 540B theoretically suboptimal the day Chinchilla published.

AI scaling laws describe the empirical observation that model performance — measured by cross-entropy loss or downstream benchmark scores — improves as a smooth, predictable power-law function of three key variables: model parameter count (N), training dataset size (D), and computational budget (C).

0:005:18
Make your own on Onpode

Describe any topic. Hear it in minutes.

More Onpode episodes on Artificial Intelligence

About this episode

In January 2020, OpenAI published a result that quietly restructured how an entire industry thinks about investment: AI loss falls along a smooth power-law curve as you scale model size, data, and compute — and that curve held across seven orders of magnitude. Not proven from first principles, just empirically observed. And then treated as bedrock. This episode traces what that really means. It starts with Kaplan et al.'s 2020 scaling laws paper, moves through DeepMind's 2022 Chinchilla correction — which found the field had the parameter-to-data ratio roughly four-to-one wrong — and sits with the uncomfortable implication: if the first law was wrong enough to make already-deployed models like PaLM 540B suboptimal, why should anyone trust the revision? The episode also goes one level deeper than most scaling discussions do, into mechanism. The leading explanation involves Zipfian distributions — the heavy-tail structure of language, images, even medical records — and what happens to loss as you cover more of that tail. It's a satisfying story. Maybe too satisfying. Because data-pruning research suggests quality, not just quantity, is doing a lot of the work the curve was getting credit for. What emerges is a portrait of an industry making enormous capital bets on an empirical pattern it doesn't fully understand, correcting itself only in retrospect, and — in the case of the people who wrote the original law — staying committed to the framework even after revising it once. Worth five minutes of your attention.

Frequently asked

What are the Kaplan scaling laws for neural language models?

The Kaplan scaling laws, published by OpenAI in January 2020, show that a language model's cross-entropy loss falls on a smooth power-law curve as model size, training data, and compute increase — a relationship that held across seven orders of magnitude, from trivially small to frontier-scale training runs.

What did the Chinchilla paper change about AI scaling laws?

DeepMind's 2022 Chinchilla paper by Hoffmann et al. showed the optimal training ratio is roughly equal parameters to training tokens, overturning Kaplan's implicit guidance to prioritize parameters. The field had operated on approximately a 4:1 parameter-heavy ratio for two years, making large models like PaLM 540B theoretically undertrained on data.

Why was PaLM 540B considered suboptimal after Chinchilla?

PaLM 540B was already in training when DeepMind published Chinchilla in 2022. Chinchilla's IsoFLOP curves — which fix a compute budget and find the loss-minimizing parameter-to-token balance — showed PaLM's parameter-to-data ratio was misallocated, meaning its compute budget could have produced a more capable model with fewer parameters and more tokens.

Why do scaling laws follow a power-law pattern?

The leading mechanistic explanation is that language, images, and other sequence data follow a Zipfian distribution — a heavy-tailed pattern where a few structures are extremely common and most are rare. Scaling up model size and data progressively covers more of that tail, and because the input distribution is a power law, the loss reduction is also a power law.

Can data pruning beat standard AI scaling laws?

Research suggests selectively removing low-quality training examples can push model performance past the standard power-law improvement curve, potentially toward exponential gains. This implies the classical scaling laws may have been measuring scale contaminated by noisy data — meaning curation efficiency, not just raw size, is a hidden variable in the loss curves.

Grounded in 12 sources
[2001.08361] Scaling Laws for Neural Language Models · arxiv.org
U-shaped and Inverted-U Scaling behind Emergent Abilities of Large Language Models · arxiv.org
Emergent Abilities in Large Language Models: A Survey · arxiv.org
Effective Frontiers: A Unification of Neural Scaling Laws · arxiv.org
How to Upscale Neural Networks with Scaling Law? A Survey and Practical Guidelines · arxiv.org
Beyond neural scaling laws: beating power law scaling via data pruning · doi.org
Scaling Collapse Reveals Universal Dynamics in Compute-Optimally Trained Neural Networks · doi.org
Scaling Laws For Diffusion Transformers · doi.org
A Dynamical Model of Neural Scaling Laws · doi.org
Exploring Scaling Laws for EHR Foundation Models · doi.org
New Approach to Scaling Laws Could Change How AI Models Are Trained | Stanford HAI · hai.stanford.edu
Google DeepMind CEO Demis Hassabis says AI scaling 'must be pushed to the maximum' - Business Insider · businessinsider.com
Read transcript

Megan Skiendel: There's a number I can't stop thinking about. Seven orders of magnitude. Not seven percent. Not sevenfold. Seven orders of magnitude — that's a dollar versus the GDP of the entire United States. And a single curve held across that whole range. That's what OpenAI published in January 2020.

David Sterling: Kaplan and Amodei. The scaling laws paper.

Megan Skiendel: Exactly. And the core idea is almost insultingly simple when you strip it down — AI gets better not randomly, but on a schedule. Predictably. You measure cross-entropy loss, which is just how wrong the model is on its predictions, and it falls in a smooth power-law as you scale up model size, data, compute. Every time. No noise.

David Sterling: The bread analogy actually works here. Double your flour and double your practice hours — the loaf improves by the same margin every time, across every kitchen. That's the structural claim.

Megan Skiendel: And then — listen — that curve, which came from a curve-fit, not a mathematical proof, became the basis for billions in compute spend. The whole capital allocation logic of this industry rests on an empirical observation across seven orders of magnitude. Which is... actually not the same thing as knowing it's true.

David Sterling: That gap — between 'empirically robust' and 'formally proven' — is exactly the slipperiness the whole episode turns on.

David Sterling: The gap broke open in 2022. DeepMind — Hoffmann et al. — publishes Chinchilla. And the finding is, frankly, brutal. Kaplan's framework said pile on parameters. The optimal ratio turned out to be roughly equal — parameters and training tokens scaled together. The field had a four-to-one ratio wrong for two years.

Megan Skiendel: PaLM 540B. Already in motion.

David Sterling: Already in motion. Theoretically suboptimal the day Chinchilla landed. That's the capital-destruction part nobody prices — the compute was spent, the ratio was wrong, and the IsoFLOP curves made it visible in retrospect. Parabolic shape, fixed compute budget — you can see exactly where the optimal balance sits. And PaLM wasn't on that curve.

Megan Skiendel: And look — I'd bet there were people inside those labs who understood the parameter-to-data problem before Chinchilla published. They just didn't have permission to say it. Competitive pressure, boardrooms wanting 'bigger is better for the benchmark' — Chinchilla didn't change the math, it changed who could walk into a room and say what was already obviously true.

David Sterling: Which means the planning culture was reactive, not predictive. And that's — wait, actually, that's the uncomfortable corner here. If Kaplan's curve was wrong enough to constitute a capital-destruction event, what confidence does anyone have in the 2022 revision?

Megan Skiendel: Exactly. The correction corrected itself once. That's not reassuring.

Megan Skiendel: But here's what I want to pull on — what does the curve actually rest on mechanistically? Because 'it works empirically' is not a mechanism. What's underneath it?

David Sterling: The Zipfian explanation. Patterns in language — and apparently in images, in EHR timelines — they're distributed with a heavy tail. A few patterns are everywhere, most are vanishingly rare. And as you scale, you cover more of that tail. Power-law input, power-law output.

Megan Skiendel: That's almost too clean.

David Sterling: It is. The loss surface constraint adds the other half — more parameters and more data together restrict the solution space, they compound. That's why it generalizes across diffusion transformers, EHR models, not just language. The architecture changes, the Zipfian structure of the domain apparently doesn't.

Megan Skiendel: Which — wait, okay, that actually makes the data pruning result stranger. Because if the mechanism is tail-coverage, then removing examples should hurt you. But the research says selectively pruning low-quality data can push performance past the standard power-law curve. Toward exponential, even.

David Sterling: That's the thing I can't fully resolve. If pruning beats the curve, then maybe the law was always secretly describing data quality, not just size. The noisy examples were — I mean, they were actively suppressing tail-coverage efficiency. You weren't measuring scale, you were measuring scale contaminated by garbage.

Megan Skiendel: Which reframes the whole capital problem. Suddenly it's not a compute question — it's a curation question. And Anthropic, Kaplan's own shop, is the one stress-testing exactly this.

David Sterling: The question I keep not being able to answer — and I want to sit with this — is whether anyone at Anthropic, Kaplan himself, could see the next Chinchilla coming. Or whether the correction is always retrospective by definition.

Megan Skiendel: Honestly? I think it's always retrospective. The Chinchilla correction didn't emerge because someone at DeepMind predicted Kaplan would be wrong. Hoffmann's team just ran the IsoFLOP curves and the parabola showed them.

David Sterling: Which means — I mean, that's the thing I can't resolve. The supercollapse result, loss curves collapsing onto a single universal curve tighter than random-seed noise — that's either profound or it's the most elegant measurement artifact ever produced.

Megan Skiendel: Both, maybe.

David Sterling: Both, maybe. And Demis Hassabis is publicly engaging the question of whether scaling is slowing, which — frankly, that's not nothing. That's the CEO of the lab that published Chinchilla saying out loud that the regime has limits.

Megan Skiendel: And Kaplan and Amodei left OpenAI and built Anthropic, which is — still inside the same paradigm, still betting the curve holds. I don't know what to do with that. They corrected the field once by leaving. What does it mean that they stayed in the framework?

How compute and data follow power laws — the durable pattern beneath capability curves · Onpode