为长序列智能体设计密集奖励机制,提升工具使用能力
TRACE: Turn-level Reward Assignment via Credit Estimation for Long-Horizon Agents

- 将工具调用边界建模为状态转移,通过参考模型生成对数似然比
- 在闭网基准上使模型性能从7.2提升至35.6,30B模型达42.6
- 无需预训练或实时数据,适合强化学习优化长周期任务
多轮智能体通过大量工具调用完成复杂任务,但事后训练中的信用分配成为核心挑战。结果奖励在短时推理中有效,但在数十甚至上百次工具调用的长轨迹中变得稀疏且方差大,且可能误导:一次失败的轨迹中可能包含大量接近目标的有效动作,却被统一赋予负面优势。我们提出TRACE(基于信用估计的回合级奖励分配),一种用于智能体强化学习的密集信用分配方法。TRACE将回溯轨迹建模为工具调用边界的状态转移,利用冻结的参考模型获取答案对数概率,转换为对数比率状态值,并以这些值的时序差分变化作为每一步动作的奖励。该方法无需额外的评判器或过程标签训练,其单步对数比率TD项可跨冗余工具调用展开。在长周期复杂搜索任务中,仅使用纯强化学习即显著提升基础模型的工具使用能力,无需冷启动监督微调、智能体中期训练阶段或实时网络数据训练。在闭网基准BrowseComp-Plus上,Qwen3-4B得分从7.2提升至35.6,Qwen3-30B-A3B从8.4提升至42.6。学习到的搜索行为还能迁移至开网基准,且训练曲线显示强化学习阶段更早出现改进并加速收敛。
原文摘要 · Abstract (English)
Multi-turn agents solve complex tasks through extended sequences of tool interactions before producing a final answer, making credit assignment a fundamental challenge during post-training. Outcome rewards provide reliable supervision for short-horizon reasoning, but become sparse and high-variance as trajectories grow to tens or hundreds of tool calls. They can also be misleading: a failed rollout may contain many useful actions that move the agent closer to the goal, yet outcome-only training assigns them the same negative advantage as the eventual mistake. We propose TRACE (Turn-level Reward Assignment via Credit Estimation), a dense credit-assignment method for agentic reinforcement learning. TRACE represents rollouts as state transitions at tool-call boundaries, obtains gold-answer log-probabilities from a frozen reference model, transforms them into log-ratio state values, and derives per-action rewards as Temporal-Difference changes in those values. This requires no additional critic or process-label training, and its one-step log-ratio TD component telescopes across redundant tool calls. On long-horizon complex search, TRACE substantially improves base-model tool-use ability using pure RL, without a cold-start supervised fine-tuning stage, an agentic mid-training stage, or training on live-web data. On the closed-web BrowseComp-Plus benchmark, it raises Qwen3-4B from $7.2$ to $35.6$ and Qwen3-30B-A3B from $8.4$ to $42.6$. The learned search behavior also transfers to open-web benchmarks, and the learning curves show earlier improvement and faster convergence during RL training.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。