Scaling Laws & Compute · 2022
Training Compute-Optimal Large Language Models (Chinchilla)
Corrected the earlier scaling prescription by showing parameters and training tokens should be scaled in roughly equal proportion, revealing that then-current large models were badly undertrained for their compute budgets.
Editorial record
Plain-language summary
DeepMind trained over 400 models at varied size and token counts and re-estimated the compute-optimal frontier, finding that for a given compute budget parameters and data should grow together at about a 1:1 ratio rather than favoring size. To demonstrate it they trained Chinchilla, a 70B model on 1.4 trillion tokens, which outperformed the 280B Gopher and other larger models while being cheaper to run at inference. The result redirected the field toward training smaller models on far more data.
Knowledge graph
Relationships
Antecedents
EnablesEvidence: Strongly supported
Scaling Data-Constrained Language Models
Chinchilla token hunger raises the data-scarcity question
P-104 intro
EnablesEvidence: Direct
LLaMA: Open and Efficient Foundation Language Models
Chinchilla-informed over-training shapes LLaMA
P-360
Descendants
ChallengesEvidence: Direct
Scaling Laws for Neural Language Models
Chinchilla corrects Kaplan optimal N/D allocation
P-101 abstract
Source record
Provenance
- Record ID
- P-101
- Record created
- 2026-07-13
- Last reviewed
- 2026-07-14
- Record version
- 2
- https://arxiv.org/abs/2203.15556
- arXiv:2203.15556
Citation caveat: Citation metadata is approximate and marked unverified in the source dataset.