Optimizing What Policies Learn From: Recoverability-aware Rollout Intervention Learning
Not on the map. Why?
Abstract (arXiv)
Critic-free group-based reinforcement learning has become a scalable approach for post-training large language models. However, most existing methods allocate the same number of rollouts to every task and trajectory state, even though some rollouts provide much more useful learning signals than others. Recent work has started to treat rollout generation as an adaptive decision, but two important limitations remain. First, intervention strategies are often based on fixed heuristics and therefore cannot adjust as the policy changes during training. Second, these methods usually decide only how many rollouts to generate, without explicitly controlling where and how to intervene. To address these limitations, we propose Recoverability-Aware Intervention Learning (RAIL), a training-time framework that learns how to generate rollouts based on the improvement produced by each intervention. RAIL models intervention selection as an online contextual-bandit problem and trains a recoverability controller using intervention traces collected through a shadow-to-live procedure. This allows the controller to keep learning while the underlying policy evolves. We evaluate RAIL in terms of effectiveness, adaptivity, expressiveness, and efficiency. Across multiple settings, RAIL consistently improves performance under limited rollout budgets. These results show that recoverability-aware intervention provides a principled way to generate more informative and less redundant rollouts, leading to stronger learning signals during post-training.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 35 of its 46 references that are in the map. First posted on arXiv 5 Aug 2026.
Builds on
35 of 46 references.
References · 35
- 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 8,851
- 2023Direct Preference Optimization: Your Language Model is Secretly a Reward Modelcited by 7,916
- 2025Understanding R1-Zero-Like Training: A Critical Perspectivecited by 1,276
- 2023AgentBench: Evaluating LLMs as Agentscited by 1,211
- 2022WebShop: Towards Scalable Real-World Web Interaction with Grounded Language Agentscited by 1,197
- 2024AgentBoard: An Analytical Evaluation Board of Multi-turn LLM Agentscited by 319
- 2023ToolQA: A Dataset for LLM Question Answering with External Toolscited by 273
- 2014Taming the Monster: A Fast and Simple Algorithm for Contextual Banditscited by 200
- 2013Non-stationary Stochastic Optimizationcited by 173
- 2025Agentic Reinforced Policy Optimizationcited by 166
- 2024DART-Math: Difficulty-Aware Rejection Tuning for Mathematical Problem-Solvingcited by 92
- 2025Tree Search for LLM Agent Reinforcement Learningcited by 73
23 more
- 2025First Return, Entropy-Eliciting Explorecited by 45
- 2025Depth-Breadth Synergy in RLVR: Unlocking LLM Reasoning Gains with Adaptive Explorationcited by 40
- 2025Agentic Entropy-Balanced Policy Optimizationcited by 39
- 2025UProp: Investigating the Uncertainty Propagation of LLMs in Multi-Step Agentic Decision-Makingcited by 36
- 2025AgentRouter: A Knowledge-Graph-Guided LLM Router for Collaborative Multi-Agent Question Answeringcited by 29
- 2025Reinforce-Ada: An Adaptive Sampling Framework under Non-linear RL Objectivescited by 23
- 2026RAGEN-2: Reasoning Collapse in Agentic RLcited by 16
- 2025MAPRO: Recasting Multi-Agent Prompt Optimization as Maximum a Posteriori Inferencecited by 15
- 2026Adaptive Rollout Allocation for Online Reinforcement Learning with Verifiable Rewardscited by 15
- 2026How to Allocate, How to Learn? Dynamic Rollout Allocation and Advantage Modulation for Policy Optimizationcited by 14
- 2026EvolveRouter: Co-Evolving Routing and Prompt for Multi-Agent Question Answeringcited by 13
- 2025LLMs4All: A Review of Large Language Models Across Academic Disciplinescited by 11
- 2026CoBA-RL: Capability-Oriented Budget Allocation for Reinforcement Learning in LLMscited by 11
- 2025Enhancing Long Chain-of-Thought Reasoning through Multi-Path Plan Aggregationcited by 10
- 2025NG-Router: Graph-Supervised Multi-Agent Collaboration for Nutrition Question Answeringcited by 9
- 2026Group Distributionally Robust Optimization-Driven Reinforcement Learning for LLM Reasoningcited by 9
- 2026TRACE: A Unified Rollout Budget Allocation Framework for Efficient Agentic Reinforcement Learningcited by 9
- 2026Drift-Bench: Diagnosing Cooperative Breakdowns in LLM Agents under Input Faults via Multi-Turn Interactioncited by 7
- 2026Temperature as a Meta-Policy: Adaptive Temperature in LLM Reinforcement Learningcited by 7
- 2026Why Semantic Entropy Fails: Geometry-Aware and Calibrated Uncertainty for Policy Optimizationcited by 5
- 2026Entropy-Tree: Tree-Based Decoding with Entropy-Guided Explorationcited by 3
- 20263SPO: State-Score-Supervised Policy Optimization for LLM Agentscited by 2
- 2026SAGE: Answer-Conditioned Uncertainty Targets for Verbal Uncertainty Alignmentcited by 2
Built on by
Citing papers per year: 2026: 2.
2 papers.