A reproducible confidence interval for the compute-optimal tokens-per-parameter ratio
Difficulty 18: open loss data (Porian et al., a pooled 814-point IsoFLOP dataset) already exist, so the problem is a careful new sweep plus a bootstrap analysis, well below the scaling-exponents theory problem (47). Application value 40: tells planners how much of the compute-optimal size is estimation noise. Leverage 36: a reference dataset for scaling-law and data-mix work.
The problem
How many training tokens per parameter is compute-optimal, with honest error bars from open, per-run-tuned experiments?
- 1Chinchilla: about 20 tokens per parameter
- 2Its error bars were questioned
- 3Open data exist, no ratio intervals
- 4New sweep plus bootstrap intervals
The question. With a fixed compute budget , a lab can train a bigger model on fewer tokens or a smaller one on more. Training cost is roughly operations, where is the number of parameters and the number of tokens. The compute-optimal split is the one that gives the lowest final loss. Chinchilla (2022) found that and should grow together, with its 70B model trained on 1.4T tokens, about 20 tokens per parameter. The problem asks for that ratio, , measured at several budgets with honest error bars.
Built from
earlier problems → this oneThe problems this one is built from: progress or tools it needs (builds on), special cases that come first (generalizes), and weaker results on the way (implies). On the right, what builds on it.
- Start with
- A reproducible confidence interval for the compute-optimal tokens-per-parameter ratioThis problem
- Then
Path to understanding
foundations → problemThe research entries this problem rests on, in the order to read them. Each links to its explainer.
- Start with
- Reverse-mode automatic differentiationAlgorithm
- Fast matrix multiplicationAlgorithm
- Step 2
- Adam, AdamW and the optimizer zooAlgorithm
- The transformer architectureAlgorithm
- Step 3
- Neural scaling laws and compute-optimal trainingTheory · host
- Then
- A reproducible confidence interval for the compute-optimal tokens-per-parameter ratioThe problem
State of the art
Chinchilla's own models imply about 20 tokens per parameter (70B parameters on 1.4T tokens). Besiroglu et al. (preprint) report that the published parametric-fit intervals were implausibly narrow, requiring over 600,000 experiments where fewer than 500 were likely run, and that a refit agrees with the other two approaches. Pearce and Song attribute Kaplan's different exponents mostly to non-embedding parameter counting and small scale. Porian et al. (arXiv:2406.19146, NeurIPS 2024) reproduced the Kaplan-versus-Chinchilla discrepancy on two datasets, released their losses and code, and give bootstrap 95% intervals for the scaling exponent of optimal model size (about 0.50); for the optimal tokens-per-parameter ratio they report only ranges across budgets (for example 14–16 on RefinedWeb with tuned hyperparameters, 11–22 on OpenWebText2), with hyperparameters tuned at 20 tokens per parameter. A 2026 community dataset pools 814 published IsoFLOP points (open-athena/isoflop-experiments) without intervals. No released sweep gives per-budget bootstrap intervals on the ratio itself under a per-run-tuned schedule.
Realistic applications
A defensible interval tells planners how much of the compute-optimal frontier is estimation noise before they fix model size, and the released data lets others test new parametric forms.
What counts as solved
A public dataset of final losses for every (N, D) run, code that regenerates the intervals, and a statement on whether the three approaches agree, reproduced by an independent party from the released losses.
How it gets verified
ReproductionA training run, experiment or computation rerun by someone else.
Dataset: one public pre-training corpus with fixed token order. Metric: final validation loss per run, fitted per budget with an IsoFLOP parabola; 95% bootstrap intervals over runs. Threshold: report interval widths; the claim of agreement between approaches holds only if the point estimates of each lie within the others' intervals. Budget: at least 5 budgets x 7 sizes = 35 runs spanning 10^18 to 10^21 FLOPs (a total of the order of 10^22 FLOPs), with 3 seeds at the smallest budget to estimate run-to-run noise.
Claims under verification
+ add a claimNo claimed results on the Verification board for this problem yet.
Where the work is
An experimental sweep with a statistical analysis step.
Bottlenecks
ranked by votes- #1ComputeIsoFLOP sweeps up to 10^21 FLOPs
35 or more runs across five budgets is a cluster-scale job.
Community grades
Sign in to add your own grade.
Connected problems
Progress
- Apr 15, 2024Replication attempt (preprint)source
Besiroglu et al. question the published parametric fit and its intervals.