用推理生成式奖励模型,让网页代理更懂任务逻辑。
WebArbiter: A Principle-Guided Reasoning Process Reward Model for Web Agents
- 将奖励建模转为文本生成,输出带理由的决策判断。
- 在多个网页环境上比最强基线高9.1分,提升任务成功率。
- 适合需要可靠决策解释的自动化网页应用开发者。
网页代理在自动化复杂计算机任务方面潜力巨大,但其交互涉及长时序、序列化决策且动作不可逆。在此类场景中,基于结果的监督信号稀疏且延迟,常错误奖励无效轨迹,无法支持推理时扩展。现有过程奖励模型(WebPRM)存在局限:标量型模型将进展压缩为粗粒度弱关联信号;检查表型模型依赖脆弱的模板匹配,在页面布局或语义变化时易误判表面正确动作。为此,我们提出WebArbiter,一种以推理为核心的原理引导型WebPRM,将奖励建模转化为文本生成,生成结构化理由,最终给出偏好判断,并识别当前情境下最有利于任务完成的动作。训练采用两阶段流程:推理蒸馏使模型具备连贯的原则驱动推理能力;强化学习通过直接对齐判断与正确性,纠正教师偏差,实现更强泛化。为系统评估,我们发布WebPRMBench,涵盖四个多样化网页环境的丰富任务及高质量偏好标注。在WebPRMBench上,WebArbiter-7B相比最强基线GPT-5提升9.1分;在WebArena-Lite上的奖励引导轨迹搜索中,超越最佳先前模型达6.4分,彰显其在复杂网页任务中的鲁棒性与实用价值。
原文摘要 · Abstract (English)
Web agents hold great potential for automating complex computer tasks, yet their interactions involve long-horizon, sequential decision-making with irreversible actions. In such settings, outcome-based supervision is sparse and delayed, often rewarding incorrect trajectories and failing to support inference-time scaling. This motivates the use of Process Reward Models (WebPRMs) for web navigation, but existing approaches remain limited: scalar WebPRMs collapse progress into coarse, weakly grounded signals, while checklist-based WebPRMs rely on brittle template matching that fails under layout or semantic changes and often mislabels superficially correct actions as successful, providing little insight or interpretability. To address these challenges, we introduce WebArbiter, a reasoning-first, principle-inducing WebPRM that formulates reward modeling as text generation, producing structured justifications that conclude with a preference verdict and identify the action most conducive to task completion under the current context. Training follows a two-stage pipeline: reasoning distillation equips the model with coherent principle-guided reasoning, and reinforcement learning corrects teacher biases by directly aligning verdicts with correctness, enabling stronger generalization. To support systematic evaluation, we release WebPRMBench, a comprehensive benchmark spanning four diverse web environments with rich tasks and high-quality preference annotations. On WebPRMBench, WebArbiter-7B outperforms the strongest baseline, GPT-5, by 9.1 points. In reward-guided trajectory search on WebArena-Lite, it surpasses the best prior WebPRM by up to 6.4 points, underscoring its robustness and practical value in complex web tasks.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。