A joint scaling law links RL performance to model size, pretraining tokens, and compute
Pavel_Izmailov · x · 2026-07-21
The paper proposes a joint scaling law for RL performance in terms of model size N, PT tokens T, and RL compute C.
- At high compute, RL performance is well predicted by PT loss.
- The slope of RL improvement is close to log-linear in PT tokens.
- The figure shows large sweeps across 36 combinations of model size, PT tokens, and RL compute, with more PT improving both pass@1 slope and final performance.
Related event: New Research Proposes Joint Scaling Law for Pretraining and RL(18 posts)→
More from Research
- Mathematician Daniel Litt Launches Problem Repo to Track Human vs AI Progress: 15 Problems, 1 Solved — littmath · 2026-09-11
- Open ECDSA.fail challenge uses AI agents to shrink Shor's-algorithm quantum circuits for Bitcoin keys — StefanoGogioso · 2026-09-11
- Alex Townsend posts 200 open problems in numerical linear algebra for humans and AI agents — IgorCarron · 2026-09-11
- Navier-Stokes, Riemann, P vs NP: what this week's math buzzwords mean for you — koltregaskes · 2026-09-11
- Fruit fly brain as an LLM: connectome-driven language model demo goes live — ngxson · 2026-09-11
- Harry Collins: LLMs can't do frontier science because they can't invent new language — whoamisri · 2026-09-11