Rollout Pass-Rate Control: Steering Binary-Reward RL Toward Its Most Informative Regime
Tianshu Zhu ⋅ Wenyu Zhang ⋅ Xiaoying Zuo ⋅ Tianlun ⋅ Haotian Zhao ⋅ yucheng-zeng ⋅ Jingnan gu ⋅ Daxiang Dong ⋅ Jianmin Wu
Abstract
Agentic reinforcement learning (RL) for software engineering spends much of its compute on stateful trajectories whose grouped binary rewards are highly skewed and weakly contrastive. We frame this as pass-rate control and show that the binary reward-side signal is strongest near a 50% rollout pass rate under four criteria: reward entropy, group-filtering survival, leave-one-out (RLOO) advantage energy under Group Relative Policy Optimization (GRPO), and success-failure pair count. We propose *Prefix Sampling* (PS), which replays self-generated trajectory prefixes to steer skewed groups toward this regime: successful prefixes give mostly failing groups a head start, while failing prefixes handicap mostly passing groups. Replayed states are reconstructed through the existing rollout path, and replayed tokens are masked from the loss so optimization applies only to current-policy continuations. On SWE-bench Verified, PS reaches the baseline high-score regime within evaluation variability while delivering $2.01\times$/$1.55\times$ end-to-end wall-clock speedups on Qwen3-14B/32B; the 14B peak improves from $0.274$ to $0.295$. AIME 2025 experiments on 4B/8B show the same pass-rate-control pattern, and 4B ablations attribute gains to replay, bidirectional coverage, and adaptive control.
Chat is not available.
Successful Page Load