用分步奖励让大模型智能体从新手变专家
From Novice to Expert: LLM Agent Policy Optimization via Step-wise Reinforcement Learning
- 通过对比专家与智能体动作,自动生成中间奖励
- 在多个数据集上超越现有基线方法,提升决策能力
- 适合想优化大模型智能体策略的研究者
大型语言模型(LLMs)在各类自主智能体系统中发挥关键作用。传统方法依赖模型自身知识而不进行微调,近期研究则转向强化学习以提升智能体解决复杂交互任务的能力。然而,以往方法受限于稀疏奖励问题:现有数据集仅提供多步推理链的最终标量奖励,导致策略学习低效。本文提出StepAgent,采用分步奖励优化强化学习过程。借鉴新手到专家理论,通过比较专家与智能体动作,自动生成细粒度中间奖励。同时引入隐式奖励与逆强化学习技术,促进智能体反思与策略调整。理论分析表明,经过多轮训练,智能体动作分布可收敛至专家分布。跨多个数据集的实验结果表明,StepAgent优于现有基线方法。
原文摘要 · Abstract (English)
The outstanding capabilities of large language models (LLMs) render them a crucial component in various autonomous agent systems. While traditional methods depend on the inherent knowledge of LLMs without fine-tuning, more recent approaches have shifted toward the reinforcement learning strategy to further enhance agents' ability to solve complex interactive tasks with environments and tools. However, previous approaches are constrained by the sparse reward issue, where existing datasets solely provide a final scalar reward for each multi-step reasoning chain, potentially leading to ineffectiveness and inefficiency in policy learning. In this paper, we introduce StepAgent, which utilizes step-wise reward to optimize the agent's reinforcement learning process. Inheriting the spirit of novice-to-expert theory, we first compare the actions of the expert and the agent to automatically generate intermediate rewards for fine-grained optimization. Additionally, we propose implicit-reward and inverse reinforcement learning techniques to facilitate agent reflection and policy adjustment. Further theoretical analysis demonstrates that the action distribution of the agent can converge toward the expert action distribution over multiple training cycles. Experimental results across various datasets indicate that StepAgent outperforms existing baseline methods.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。