arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2107.09003cs.LGcs.AI
收藏

安全离线强化学习的约束惩罚Q学习

Constraints Penalized Q-learning for Safe Offline Reinforcement Learning

Xidian University(西安电子科技大学);JD Technology(京东科技);JD Intelligent Cities Research(京东智能城市研究院);Tsinghua University(清华大学)

Haoran Xu, Xianyuan Zhan, Xiangyu Zhu

摘要:

研究了安全的离线强化学习(RL)问题,目标是学习一种策略,在满足安全约束的同时,只给离线数据,而不与环境进一步交互。这个问题对于现实世界的RL应用程序更有吸引力,其中数据汇集是昂贵的或危险的。强制执行约束满足是不平凡的,特别是在离线设置中,因为在策略分布和数据分布之间存在潜在的大的差异,从而导致在估计安全约束的值时的错误。我们表明,结合安全RL和离线RL技术的天真方法只能学习次优解决方案。因此,我们开发了一个简单而有效的算法,约束惩罚Q学习(CPQ),来解决这个问题。我们的方法允许使用由混合行为策略生成的数据。我们提出了一个理论分析和经验证明,我们的方法可以学习强大的各种基准控制任务,优于几个基线。

英文摘要:

We study the problem of safe offline reinforcement learning (RL), the goal is to learn a policy that maximizes long-term reward while satisfying safety constraints given only offline data, without further interaction with the environment. This problem is more appealing for real world RL applications, in which data collection is costly or dangerous. Enforcing constraint satisfaction is non-trivial, especially in offline settings, as there is a potential large discrepancy between the policy distribution and the data distribution, causing errors in estimating the value of safety constraints. We show that naïve approaches that combine techniques from safe RL and offline RL can only learn sub-optimal solutions. We thus develop a simple yet effective algorithm, Constraints Penalized Q-Learning (CPQ), to solve the problem. Our method admits the use of data generated by mixed behavior policies. We present a theoretical analysis and demonstrate empirically that our approach can learn robustly across a variety of benchmark control tasks, outperforming several baselines.

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

↑