The empirical scaling laws
For language models, Kaplan et al. (2020) and Chinchilla (Hoffmann et al., 2022) showed that loss decreases as a smooth power law in parameters and tokens. Roughly: optimal training compute is split evenly between scaling parameters and scaling tokens. A 70B-parameter model trained on 1.4 trillion tokens (Chinchilla-optimal) outperforms a 175B-parameter model trained on 300 billion tokens, despite using less compute.
The lesson: bigger models alone don't help if you don't have proportionally more data. Many pre-Chinchilla 'huge model, modest data' efforts were actually under-trained.
What scaling actually buys you
- Lower training loss — predictable, follows a power law.
- Emergent capabilities — some abilities (multi-step reasoning, code generation) appear suddenly above certain scales.
- Better few-shot / zero-shot performance — large models generalize from few examples.
- Diminishing returns at the very top — going from 100B to 200B parameters costs much more than the accuracy gain, in most current setups.
For application work
You almost never train at frontier scale. You pick a pretrained model from the menu (3B, 7B, 13B, 32B, 70B, ...) and fine-tune. The scaling-laws intuition matters because it tells you which model size to start with — usually the smallest that meets your accuracy requirement, because inference cost scales with parameter count.