用过程奖励模型提升大模型在多步任务中的决策能力。
AgentPRM: Process Reward Models for LLM Agents via Step-Wise Promise and Progress
- 设计新奖励模型AgentPRM,按步骤评估行动对目标的推进程度。
- 实验显示比基线节省超8倍计算资源,且随算力增加效果更优。
- 适合需要长序列决策的智能体任务,如网页购物与导航。
尽管大语言模型发展迅速,但在多轮决策任务(如网络购物和浏览器导航)中仍面临挑战,这类任务需基于环境反馈做出一系列智能决策。以往方法通常依赖复杂的提示工程或专家轨迹微调。本文提出一种新的过程奖励模型(AgentPRM),通过评估每一步行动对目标的推进程度来指导决策,而非简单判断对错。该模型捕捉了序列决策间的依赖关系及其对最终目标的贡献,实现更好的进展追踪与探索-利用平衡。为高效获取训练数据,采用基于时序差分(TD-based)和广义优势估计(GAE)的方法,相比先前方法更具样本效率。跨多种代理任务的实验表明,AgentPRM在计算效率上优于基线超过8倍,并在测试时扩展算力下表现稳健提升。详细分析揭示了其工作机制,并展示了在大模型强化学习中的应用潜力。
原文摘要 · Abstract (English)
Despite rapid development, large language models (LLMs) still encounter challenges in multi-turn decision-making tasks (i.e., agent tasks) like web shopping and browser navigation, which require making a sequence of intelligent decisions based on environmental feedback. Previous work for LLM agents typically relies on elaborate prompt engineering or fine-tuning with expert trajectories to improve performance. In this work, we take a different perspective: we explore constructing process reward models (PRMs) to evaluate each decision and guide the agent's decision-making process. Unlike LLM reasoning, where each step is scored based on correctness, actions in agent tasks do not have a clear-cut correctness. Instead, they should be evaluated based on their proximity to the goal and the progress they have made. Building on this insight, we propose a re-defined PRM for agent tasks, named AgentPRM, to capture both the interdependence between sequential decisions and their contribution to the final goal. This enables better progress tracking and exploration-exploitation balance. To scalably obtain labeled data for training AgentPRM, we employ a Temporal Difference-based (TD-based) estimation method combined with Generalized Advantage Estimation (GAE), which proves more sample-efficient than prior methods. Extensive experiments across different agentic tasks show that AgentPRM is over $8\times$ more compute-efficient than baselines, and it demonstrates robust improvement when scaling up test-time compute. Moreover, we perform detailed analyses to show how our method works and offer more insights, e.g., applying AgentPRM to the reinforcement learning of LLM agents.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。