New Research Proposes Joint Scaling Law for Pretraining and RL

A study titled "Understanding Reasoning from Pretraining to Post-Training" introduces a controlled chess testbed, unifying pretraining, SFT, and reinforcement learning (RL) into a computable framework. It provides quantitative answers to long-standing questions about compute allocation and how RL changes models. Paper, code, and models are open-sourced.

Key Details and Core Laws

In 36 experiments spanning 20M to 1B model sizes, the team found that optimal compute allocation shifts with budget: prioritize pretraining at low compute, but as model size grows from 50M to 700M, the optimal strategy leans toward RL, with RL compute reaching up to ~30%. Pretraining tokens still roughly follow Chinchilla scaling. The authors propose a joint scaling law: at high compute, RL performance is well predicted by pretraining loss, and more pretraining tokens strengthen this relationship.

RL Mechanism and Generalization

Regarding RL's mechanism, the authors note that on simple tasks, RL mainly sharpens already decent strategies, while on harder tasks it can uncover low-probability tail solutions. This means RL is not limited to fine-tuning but can discover rare reasoning patterns. @burny_tech had a similar industry question about whether RLVR reinforces existing abilities or elicits new reasoning; this study partially answers it. The chess findings extend to OLMo's natural language math reasoning, confirming that pretraining loss strongly predicts RL gains.

2026-07-20 ~ 2026-07-21 · 18 related posts