Gold-likelihood predicts GSM8K pass rates better than compute scaling laws

RylanSchaeffer · x · 2026-10-20

Schaeffer showcases pretraining papers: (1) scaling laws for generative evals — gold reference log-likelihood fits GSM8K pass@k more tightly than compute scaling laws; (2) scale-dependent data duplication — NN cosine similarity on 190M FineWeb-Edu docs deviates sharply from power-law predictions at large corpus sizes; (3) data repetition shows a U-shaped compute-equivalent-gain curve, with a 344M model losing 33% of compute at 100 repeats before gains recover past 1,000 repeats.

Related event: Meta Researcher Rylan Schaeffer Leaves to Found Startup, Reflects on Pretraining Research(4 posts)→

Original post →

More from Research

Research channel →