mlsanityData to 7 Oct 2026

Rollout Pass-Rate Control: Steering Binary-Reward RL Toward Its Most Informative Regime

arXiv 2605.05112 ↗First posted 6 May 2026cs.LGcited by 0

On the map: LLM agents and tool use → Reinforcement learning for LLM agents

Abstract (arXiv)

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.01x and 1.55x end-to-end wall-clock speedups on Qwen3-14B and Qwen3-32B; the 14B peak improves from 0.274 to 0.295. AIME 2025 experiments on 4B and 8B show the same pass-rate-control pattern, and 4B ablations attribute gains to replay, bidirectional coverage, and adaptive control.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Placed in Reinforcement learning for LLM agents, one of 16 directions in LLM agents and tool use. Builds on 25 of its 38 references that are in the map. First posted on arXiv 6 May 2026.

Builds on

25 of 38 references.

Closest ancestors · 1

Same direction, newest first

  1. 2025Let It Flow: Agentic Crafting on Rock and Roll, Building the ROME Model within an Open Agentic Learning Ecosystem31 Dec

Other references · 24

  1. 2017Proximal Policy Optimization Algorithmscited by 14,441
  2. 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 8,851
  3. 2025Qwen3 Technical Reportcited by 8,195
  4. 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,203
  5. 2023SWE-bench: Can Language Models Resolve Real-World GitHub Issues?cited by 3,193
  6. 2025DAPO: An Open-Source LLM Reinforcement Learning System at Scalecited by 2,678
  7. 2025Learning to Reason under Off-Policy Guidancecited by 266
  8. 2025R2E-Gym: Procedural Environments and Hybrid Verifiers for Scaling Open-Weights SWE Agentscited by 140
  9. 2025Learning What Reinforcement Learning Can't: Interleaved Online Fine-Tuning for Hardest Questionscited by 95
  10. 2025AceReason-Nemotron: Advancing Math and Code Reasoning through Reinforcement Learningcited by 85
  11. 2025SRFT: A Single-Stage Method with Supervised and Reinforcement Fine-Tuning for Reasoningcited by 80
  12. 2025UFT: Unifying Supervised and Reinforcement Fine-Tuningcited by 58
12 more
  1. 2026Expanding the Capabilities of Reinforcement Learning via Text Feedbackcited by 49
  2. 2026POPE: Learning to Reason on Hard Problems via Privileged On-Policy Explorationcited by 39
  3. 2025StepHint: Multi-level Stepwise Hints Enhance Reinforcement Learning to Reasoncited by 37
  4. 2025Boosting MLLM Reasoning with Text-Debiased Hint-GRPOcited by 32
  5. 2026Experiential Reinforcement Learningcited by 21
  6. 2026Self-Hinting Language Models Enhance Reinforcement Learningcited by 19
  7. 2026Reuse your FLOPs: Scaling RL on Hard Problems by Conditioning on Very Off-Policy Prefixescited by 16
  8. 2025Staying in the Sweet Spot: Responsive Reasoning Evolution via Capability-Adaptive Hint Scaffoldingcited by 15
  9. 2026How to Allocate, How to Learn? Dynamic Rollout Allocation and Advantage Modulation for Policy Optimizationcited by 14
  10. 2025ADHint: Adaptive Hints with Difficulty Priors for Reinforcement Learningcited by 10
  11. 2026Composition-RL: Compose Your Verifiable Prompts for Reinforcement Learning of Large Language Modelscited by 5
  12. 2026iGRPO: Self-Feedback-Driven LLM Reasoningcited by 2

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2026Counterfactual Rollout Replay: Forkable Environments as Free Process Rewards for Software Engineering Agents
  2. 2026Early Verdicts, Better Budgets: Sequential Adaptive Rollout Allocation for Compute-Efficient RLVR
  3. 2026Process Reward Informed Tree Rollout for Effective Multi-Turn RL
  4. 2026TRACE: A Unified Rollout Budget Allocation Framework for Efficient Agentic Reinforcement Learning
  5. 2026Cross-Rollout Bellman Closure for Long-Horizon Agentic Reinforcement Learning
  6. 2026Heddle: A Distributed Orchestration System for Agentic RL Rollout
  7. 2026Maximizing Rollout Informativeness under a Fixed Budget: A Submodular View of Tree Search for Tool-Use Agentic Reinforcement Learning
  8. 2026Groupwise Agentic Grading and Advantage Redistribution for Code Agent RL