Command Palette
Search for a command to run...
Qu’améliore réellement l’apprentissage par renforcement multi-tours chez les agents LLM ?
Qu’améliore réellement l’apprentissage par renforcement multi-tours chez les agents LLM ?
Kejian Zhu Zhuoran Jin Shangqing Tu Tianyi Men Yupu Hao Jiachun Li Kang Liu Jun Zhao
Résumé
Bien que l’apprentissage par renforcement agentique multi-tours (RL) excelle dans les tâches à long horizon, ses gains de performance restent très sensibles aux contraintes d’interaction. En évaluant selon la largeur d’échantillonnage K et la profondeur d’interaction T au moyen de Pass@(K,T), nous montrons que les avantages du RL au niveau des trajectoires dépendent de budgets de tours suffisants et diminuent nettement lorsque ces budgets se resserrent. De plus, le RL agentique n’améliore pas uniformément la qualité des décisions individuelles ; sa force se concentre plutôt dans la récupération d’erreurs et la résilience sur le long horizon. Pour atténuer les risques de déploiement causés par cette dépendance au budget, nous présentons une discussion préliminaire sur les avantages et les limites des signaux de supervision de processus et introduisons BudgetMix RL, une alternative qui fait varier les budgets d’interaction pendant l’entraînement. Les expériences montrent que BudgetMix RL atteint des performances robustes dans divers contextes d’exécution.
One-sentence Summary
Researchers from the Institute of Automation, Chinese Academy of Sciences, the University of Chinese Academy of Sciences, and Tsinghua University use Pass@(K,T) to show that multi-turn agentic RL gains depend on sufficient interaction budgets and mainly strengthen error recovery and long-horizon resilience rather than single-step decision quality, and they introduce BudgetMix RL, which varies interaction budgets during training to achieve robust performance across diverse execution settings.
Key Contributions
- The paper uses Pass@(K,T) evaluation across sampling breadth K and interaction depth T to show that trajectory-level multi-turn RL gains depend on sufficient turn budgets and diminish significantly when budgets tighten.
- The analysis identifies that these gains arise mainly from long-horizon execution and error recovery rather than consistently stronger single-step decisions, and finds that step-level action quality can decline under multi-turn RL.
- The paper proposes BudgetMix RL, a training strategy that varies interaction budgets during training, and experiments show it improves robustness across execution settings while mitigating declines in step-level action quality.
Introduction
Multi-turn agentic reinforcement learning has become an important approach for improving long-horizon LLM agents in tasks such as coding and tool use, but it remains unclear exactly which capabilities are improved and whether the resulting agents stay reliable under realistic deployment budgets. Prior evaluation primarily focuses on trajectory-level task success or single-turn Pass@K sampling breadth, missing the interaction-depth dimension and step-level action quality that are central to agentic settings. The authors introduce a two-dimensional Pass@(K,T) evaluation and step-level analyses, showing that agentic RL gains depend on sufficient interaction budgets and mainly come from stronger long-horizon execution and error recovery rather than consistently better single-step actions. They further identify this budget dependence as a hidden deployment risk and propose BudgetMix RL to improve performance across budgets while mitigating declines in step-level action quality.
Method
Multi-Turn Agentic Reinforcement Learning
The authors formulate agent learning as a multi-turn interaction between a policy and an environment. For a task x∼D, the agent maintains an interaction history
ht=(x,o1,a1,…,ot−1,at−1,ot).At each turn t, the agent samples an action from its policy,
at∼π(⋅∣ht),and the environment returns the next observation according to
ot+1∼P(⋅∣ht,at).Actions can represent tool calls, terminal operations, or code execution. Given an interaction budget of at most T turns, an episode produces a trajectory
τ≤T=(x,o1,a1,…,oT,aT),which is scored by a terminal verifier through a reward R(τ≤T). This formulation supports both outcome-only reinforcement learning, such as GRPO, and process-level credit assignment methods, such as GiGPO.
Pass@(K, T): Sampling Breadth and Interaction Depth
To evaluate agent performance across both sampling breadth and interaction depth, the authors introduce the metric Pass@(K,T). Conventional agent evaluations typically report trajectory success. In contrast, single-turn reinforcement learning often uses Pass@K, which measures the probability that at least one of K independent samples succeeds. This corresponds to sampling breadth.
Interactive agents introduce an orthogonal axis: the maximum interaction budget T available per trajectory, which controls interaction depth. The metric Pass@(K,T) captures both dimensions simultaneously:
Pass@(K,T)=τ(1),…,τ(K)∼π(⋅∣x)Pr[∃i∈{1,…,K}:R(τ≤T(i))=1].Under this definition, K controls breadth while T controls depth. Fixing the total sampling budget to a constant C and sweeping over T yields the trajectory-level metric Pass@T=Pass@(K=C,T), which isolates the interaction-depth axis.
BudgetMix RL: Optimizing Across Interaction Budgets
The main training method proposed by the authors is BudgetMix RL. It is designed to preserve long-horizon execution capabilities and trajectory-level gains while encouraging more careful single-step decisions and reducing reliance on extra interaction budget for downstream error recovery.
BudgetMix RL keeps the same reward mechanism as traditional multi-turn agentic reinforcement learning but varies the interaction budget across training trajectories. It can be combined with existing agentic RL algorithms, including GRPO, PPO, and GiGPO.
Standard multi-turn agentic RL samples trajectories under a fixed maximum budget Tmax and optimizes either outcome rewards or per-step rewards. However, this objective does not explicitly distinguish solutions that require different amounts of interaction as long as they finish within the allowed budget. BudgetMix makes a single modification to this procedure. For a task instance x with full budget Tmax(x), the authors construct candidate budgets at 10% intervals and uniformly sample one budget per task group:
T(x)=Unique({⌈10kTmax(x)⌉:k=1,…,10}), T(x)∼Uniform(T(x)).During training, the total budget and the remaining budget are provided within the prompt. Any trajectory that exceeds its assigned budget without completing the task receives a reward of zero. The reward signal design remains consistent with traditional multi-turn RL.
The central idea of BudgetMix is to turn the interaction budget T from an evaluation dimension in Pass@(K,T) into a training dimension. The interaction budget changes the conditions under which the same reward can be obtained. A tighter budget limits opportunities for retries and therefore places greater demands on earlier decisions, while an ample budget preserves opportunities for long-range execution. By sampling different budgets during training, the policy is exposed to both regimes and is encouraged to produce trajectories that remain effective under varying interaction constraints.
Experiment
The authors evaluate multi-turn agentic reinforcement learning with a two-dimensional Pass@(K,T) measure across sampling breadth and interaction depth, using GRPO on DeepCoder-MT, BFCL, InterCode-SQL, and FrozenLake. They find that agentic RL can push trajectory-level success beyond the base model's capability boundary, but gains depend on sufficient interaction budgets and are not driven by uniformly better single-step actions; instead, RL improves error recovery and later-stage execution while individual action quality can decline. Likelihood and training analyses attribute this to accumulating trajectory-level policy shifts rather than stronger local decisions, and process supervision or budget mixing can partly stabilize these tradeoffs.
BudgetMix improves Pass@8 over the base model and standard full-budget RL under constrained interaction budgets across FrozenLake, DeepCoder-MT, BFCL-v3, and InterCode-SQL. The average advantage over full-budget RL is largest at the tightest budget and narrows as the budget increases, while full-budget performance remains comparable. This suggests BudgetMix strengthens performance stability across budgets without compromising long-horizon execution. Under 25%, 50%, and 75% of maximum interaction budget, BudgetMix outperforms both the base model and full-budget RL on all four tasks, with the strongest average gains at the tightest budget. At 100% interaction budget, BudgetMix maintains parity with full-budget RL, preserving long-horizon task performance.
BudgetMix is evaluated on FrozenLake, DeepCoder-MT, BFCL-v3, and InterCode-SQL under constrained interaction budgets, measuring Pass@8 relative to a base model and standard full-budget reinforcement learning. It improves performance over both baselines at 25%, 50%, and 75% of the maximum interaction budget, with the largest average gains at the tightest budget and a narrowing advantage as the budget increases. At 100% budget, BudgetMix remains comparable to full-budget RL, indicating that it stabilizes performance under limited budgets without sacrificing long-horizon task execution.