提出新方法解决多任务大模型强化学习中的探索不均衡问题。
Entropy Pacing Policy Optimization for Multi-Task Agentic Reinforcement Learning

- 用动态裁剪机制按任务熵调整更新幅度
- 在多任务基准上性能优于现有方法
- 适合需要同时处理多个复杂任务的智能体
近期强化学习突破展现了其在复杂大语言模型代理任务中的潜力。然而,现有研究多集中于单任务场景,而真实应用需具备同时解决多个任务的通用智能体。本文发现多任务代理强化学习中存在探索-利用节奏不匹配现象:简单任务可能过早收敛至低熵策略,阻碍困难任务学习;而困难任务又会将简单任务拉回高熵探索。这种相互干扰导致任务间熵交叉与频繁熵突增。为此,我们提出熵速控策略优化(EPPO),通过任务级动态裁剪机制替代GRPO中的固定裁剪阈值,实现对过度自信任务收紧更新、对未充分探索任务放宽更新,从而协调各任务熵水平,稳定多任务优化。在多任务代理基准上的实验表明,所提EPPO显著优于现有方法。
原文摘要 · Abstract (English)
Recent breakthroughs of Reinforcement Learning (RL) have highlighted its potential for complex agentic Large Language Model (LLM) tasks. However, existing efforts largely focus on single-task settings, whereas real-world deployment necessitates a generalist agent capable of solving multiple tasks simultaneously. In this work, we identify a critical yet underexplored phenomenon in multi-task agentic RL: different tasks can exhibit exploration-exploitation pace mismatch. Specifically, easier tasks may converge early to low-entropy policies that hinder learning on harder tasks, while harder tasks can, in turn, push easier tasks back toward high-entropy exploration. This back-and-forth interaction creates inter-task entropy crossovers and frequent entropy spikes. Inspired by this observation, we introduce Entropy Pacing Policy Optimization (EPPO) for multi-task agentic LLMs, which coordinates entropy across tasks to stabilize multi-task optimization. At the core of EPPO is a task-wise dynamic clipping mechanism that replaces the fixed clipping threshold in Group Relative Policy Optimization (GRPO) with a task entropy-aware adaptive bound, tightening updates for over-confident tasks while relaxing them for under-explored ones. Experiments on the multi-task agentic benchmarks demonstrate that the proposed EPPO yields results superior to its counterparts.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。