只优化关键决策点,让大模型代理更高效地学会复杂任务。
Verified Critical Step Optimization for LLM Agents
- 聚焦失败轨迹中的关键决策点,仅对可验证的替代路径进行训练。
- 在GAIA-Text和XBench数据集上提升37%和26%,仅需16%的步骤标注。
- 避免冗余标注与噪声,适合需要高可靠性的智能体后训练场景。
随着大语言模型代理处理越来越复杂的长周期任务,有效的后训练变得至关重要。以往方法存在根本性挑战:仅基于结果的奖励无法精准分配中间步骤的信用,估计的步骤级奖励引入系统性噪声,而蒙特卡洛采样进行步骤奖励估计则计算成本过高。受‘仅有少量高熵标记驱动有效强化学习’启发,我们提出关键步骤优化(CSO),聚焦于经验证的关键步骤——即不同选择能将任务从失败转为成功的决策点。关键在于,该方法从失败策略轨迹出发而非专家示范,直接针对模型弱点。我们使用过程奖励模型(PRM)识别候选关键步骤,借助专家模型提出高质量替代方案,再由策略模型自身继续执行直至任务完成。仅当策略成功执行并达成正确结果的替代路径才被验证并用于直接偏好优化(DPO)训练,确保数据质量与策略可达性。这实现了精细、可验证的监督,同时避免了轨迹级粗粒度和步骤级噪声。在GAIA-Text-103和XBench-DeepSearch上的实验表明,CSO相较SFT基线分别实现37%和26%的相对提升,显著优于其他后训练方法,且仅需对16%的轨迹步骤进行监督,证明了基于选择性验证的学习在代理后训练中的有效性。
原文摘要 · Abstract (English)
As large language model agents tackle increasingly complex long-horizon tasks, effective post-training becomes critical. Prior work faces fundamental challenges: outcome-only rewards fail to precisely attribute credit to intermediate steps, estimated step-level rewards introduce systematic noise, and Monte Carlo sampling approaches for step reward estimation incur prohibitive computational cost. Inspired by findings that only a small fraction of high-entropy tokens drive effective RL for reasoning, we propose Critical Step Optimization (CSO), which focuses preference learning on verified critical steps, decision points where alternate actions demonstrably flip task outcomes from failure to success. Crucially, our method starts from failed policy trajectories rather than expert demonstrations, directly targeting the policy model's weaknesses. We use a process reward model (PRM) to identify candidate critical steps, leverage expert models to propose high-quality alternatives, then continue execution from these alternatives using the policy model itself until task completion. Only alternatives that the policy successfully executes to correct outcomes are verified and used as DPO training data, ensuring both quality and policy reachability. This yields fine-grained, verifiable supervision at critical decisions while avoiding trajectory-level coarseness and step-level noise. Experiments on GAIA-Text-103 and XBench-DeepSearch show that CSO achieves 37% and 26% relative improvement over the SFT baseline and substantially outperforms other post-training methods, while requiring supervision at only 16% of trajectory steps. This demonstrates the effectiveness of selective verification-based learning for agent post-training.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。