arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 2610.19783cs.LG
收藏

基于优势引导的强化学习

Reinforcement Learning via Advantage Guidance

UC Berkeley(加州大学伯克利分校)

Zhiyuan Zhou, Sergey Levine

AI总结:

本文提出Advantage Guidance方法,结合监督学习的稳定性与RL的高性能,通过条件训练和对比扩散引导,在26个长视野稀疏奖励任务上优于现有SOTA RL方法。

摘要:

强化学习(RL)有望学习到一种策略,其性能可超越数据中展示的策略。然而,在实际应用中,这类系统存在不稳定性和超参数敏感性问题。相比之下,监督学习提供了稳定且可扩展的训练目标,但从根本上受限于演示行为的质量。本文中,我们探讨是否能采用像监督学习那样简单稳定的方法来执行策略优化,同时达到与RL相当的性能。遗憾的是,直接使用监督学习训练策略并以未来奖励或优势为条件,通常性能不如专门的RL方法。我们提出一种新的策略提取方法——优势引导(Advantage Guidance),它保留了简单的监督学习结构并结合了优势条件,同时通过采样过程中的有效条件训练和对比扩散引导,性能优于现有RL方法。我们证明,优势引导可显著提升模型响应条件优势信号的能力,而采样过程中的对比引导可利用学习到的优势条件策略来逼近KL正则化的最优策略。实验表明,在26个跨不同最优程度数据集的长视野稀疏奖励任务中,优势引导显著优于现有最先进的RL方法。

英文摘要:

Reinforcement learning (RL) holds the promise of learning a policy that can outperform what is shown in the data. However, in practice, such systems suffer from instability and hyperparameter sensitivity. In contrast, supervised learning provides a stable and scalable training objective, but is fundamentally limited by the quality of the demonstrated behavior. In this paper, we ask whether we can perform policy optimization with something as simple and stable as supervised learning but as performant as RL. Unfortunately, naively training the policy with supervised learning and conditioning on future rewards or advantages typically underperform dedicated RL methods. We introduce a new policy extraction method, Advantage Guidance, that retains the simple supervised learning structure with advantage conditioning while outperforming prior RL methods through effective conditional training and contrastive diffusion guidance during sampling. We show that Advantage Guidance can significantly improve a model's ability to respond to conditional advantage signals, and the contrastive guidance during sampling can use the learned advantage-conditioned policy to target the KL-regularized optimal policy. Empirically, we find that Advantage Guidance significantly outperforms prior state-of-the-art RL methods on 26 long-horizon, sparse reward tasks across datasets with varying degrees of optimality.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑