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
- Fable 5 reportedly solves one of algebraic geometry’s most famous problems — we_are_mammals · 2026-07-22
- Stanford HAI publishes eight papers on what AI and law can learn from each other — StanfordHAI · 2026-07-22
- Stanford HAI’s PNAS feature maps the legal questions around generative AI — StanfordHAI · 2026-07-22
- Brain-inspired GCML uses cognitive maps and sampling to plan with less compute — JonLag97 · 2026-07-22
- Proto talk frames generative biology as a high-level programming language — anshulkundaje · 2026-07-22
- NVIDIA pitches World Foundation Models as a way to scale physical AI data generation — MonaJalal_ · 2026-07-22