Compute
The hardware, memory, communication, and wall-clock budget available to generate experience and update the policy.
A practical field guide
RL Scaling studies what happens when reinforcement learning systems grow across compute, data, model capacity, rollout volume, task diversity, and feedback quality. The central question is not simply whether more resources improve a policy, but which part of the learning loop becomes the next constraint. This topic tracks empirical scaling behavior, large training systems, and the operational lessons behind durable gains.
The dimensions
A larger model or a larger compute budget changes only part of the learning system. Durable gains depend on how six coupled dimensions grow together.
The hardware, memory, communication, and wall-clock budget available to generate experience and update the policy.
The prompts, tasks, trajectories, demonstrations, and feedback examples that define what the policy can learn.
The systems in which a policy acts—from math graders and code sandboxes to browsers, simulators, and production tools.
The quantity, diversity, length, and freshness of sampled trajectories used to estimate which behaviors should improve.
The human, learned, or programmatic signals that determine which outcomes the optimization process reinforces.
The models, tools, memory, and control loops that must remain reliable as tasks become longer and more interactive.
The learning loop
Defines the task, observations, available actions, transition rules, and outcomes.
Turns the current policy into trajectories that expose both capability and failure.
Scores outcomes or behavior and decides which trajectories create learning pressure.
Converts sampled feedback into policy updates while managing drift and instability.
Tests whether gains are real, generalize beyond training tasks, and survive deployment constraints.
The central scaling question: when the policy stops improving, which link in this loop prevents additional resources from becoming useful capability?
Where scaling breaks
A plateau is an observation, not a diagnosis. The same flat reward curve can come from insufficient compute, repetitive rollouts, a saturated verifier, unstable updates, or an evaluation that cannot see the gain.
Workers idle, rollout throughput stalls, or memory and communication dominate run time.
Which resource is saturated, and does adding it increase useful experience per hour?
Performance plateaus on familiar task families and fails to transfer to new distributions.
Is the training distribution broad enough to expose the behavior we want?
The policy exploits resets, tools, or task shortcuts that do not exist in production.
Does success in the environment require the same behavior as success in the real workflow?
Samples are repetitive, too short, stale, or dominated by failures with little learning value.
Are we generating enough diverse and current trajectories to distinguish better policies?
Reward rises while human judgment, downstream tests, or safety metrics get worse.
What can the policy exploit, and which desired behaviors remain invisible to the reward?
Headline benchmarks improve but regressions appear in cost, latency, reliability, or transfer.
Would the claimed gain survive a different judge, seed, task set, and production constraint?
A working framework
A practical framework for locating the binding constraint across environment coverage, rollout generation, reward validity, optimization, and evaluation—before spending the next unit of compute.
Read the full analysis →Recent evidence · Updated Sep 1, 2026
New August 2026 preprints sharpen the scaling question. More throughput can reduce wall-clock time only when optimization is retuned; stronger pass@1 can coincide with narrower solution coverage; and long-horizon agents need credit at the level of executable decisions.
The authors separate sample efficiency from systems throughput. With batch-aware learning-rate retuning, they report up to 2.29× higher generation throughput and up to 29% lower GRPO time-to-target; without retuning, the larger batch was slower.
Read the research note →Across two controlled training setups, the authors report that RLVR improved single-sample accuracy while solution coverage fell by as much as 67%. Most of the contraction appeared before the first reasoning operation, limiting later test-time scaling.
Read the research note →TASPO keeps verified outcomes as the source of update direction while using privileged supervision to redistribute credit across executable actions. The authors report a 10.6% improvement over GRPO across three agentic benchmarks.
Read the research note →All three items are new preprints, and the agentic-credit paper explicitly describes itself as work in progress. Treat the reported numbers as results from particular setups—not settled scaling laws—until they are reproduced across models, tasks, budgets, and implementations.
LessWrong discussion · 2026
These posts are community analysis, not peer-reviewed evidence. They are included because they make the live disagreements and failure hypotheses unusually explicit.
By CarolusRenniusVitellius
A compact map of the “elicitation versus capability creation” debate, including evidence on sparse updates, solution coverage, and important counterexamples.
→By Steven Byrnes
Argues that RLVR can be pragmatically decisive while still refining strategies and heuristics largely acquired through pretraining and supervised learning.
→By Fiora Starlight
Proposes rewarding verifiable reports of environment exploits, then using those reports to patch the training loop; the comments surface monitor and stability risks.
→By Steven Byrnes
Frames automatic-verifier failures as “literal genie” behavior: a useful synthesis of reward-specific failure modes, not a substitute for causal evidence.
→Questions for AI teams
Only after identifying the saturated resource and showing that additional throughput produces diverse, high-value experience rather than more of the same signal.
The useful number depends on task diversity, reward variance, policy freshness, and the decisions the samples must distinguish. Volume without coverage is not scale.
A verifier is useful when it measures the intended outcome, resists shortcuts, remains calibrated off-distribution, and is checked against independent evaluation.
Treat transfer as a separate hypothesis. Test new tasks, judges, seeds, environments, budgets, and failure costs before calling a result a capability gain.
Latest RL Scaling research
Jingxiao Yang
A work-in-progress study of long-horizon agent reinforcement learning that uses privileged process supervision to redistribute verified trajectory-level credit across executable actions.
RL Scaling
A practical framework for locating the binding constraint in an RL system across environments, rollout generation, reward quality, optimization, and evaluation.
Ziniu Li
An empirical decomposition of LLM reinforcement-learning batch scaling into sample-indexed learning behavior and systems throughput, with a decision rule for when a larger batch lowers wall-clock time-to-target.
Qiancheng Zhou
A controlled study of where reasoning diversity disappears during RLVR, distinguishing failure to initiate a solution family from failure to execute it after the first reasoning choice.
Xingyu Shen
A method for preserving reasoning diversity during RLVR by conditioning the target model on partial trajectories produced by a smaller, weaker model.
Maciej Besta
A compute-centric systematization of RL-style reasoning-model post-training, covering PPO and GRPO as well as intra-model, inter-model, synchronous, and asynchronous parallelism.
07 / Frequently asked questions
Definitions for the terms and distinctions used throughout this guide.
RL scaling is the study and engineering practice of increasing reinforcement learning capability across compute, models, data, environments, rollouts, rewards, and agents. It asks which resources produce durable gains and which component becomes the next constraint.
No. Model scaling changes the capacity or pretraining of the policy. RL scaling concerns the entire learning loop, including experience generation, feedback, optimization, evaluation, and the systems that connect them.
Common constraints include rollout throughput, narrow task distributions, low-fidelity environments, exploitable rewards, unstable updates, and evaluations that fail to measure transfer. The binding constraint changes as the system improves.
RL with verifiable rewards can make feedback cheaper and more repeatable for tasks such as math, code, and tool use. It shifts attention toward verifier coverage, reward hacking, environment design, and the breadth of tasks that can be checked reliably.
The environment determines which experiences are available and what behavior counts as success. If it is narrow or unrealistic, more rollouts and compute can reinforce behavior that does not transfer to real use.
Need a decision, not more training volume?
RL Scaling works with teams on frontier research, custom evaluation, and production-oriented agent systems.
Discuss a project ↗