arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2209.07089cs.LGcs.AI
收藏

安全策略优化的约束更新投影方法

Constrained Update Projection Approach to Safe Policy Optimization

Zhejiang University(浙江大学);Peking University(北京大学);Tsinghua University(清华大学);BIGAI(北京通用人工智能研究院);Zhejiang University City College(浙大城市学院)

Long Yang, Jiaming Ji, Juntao Dai, Linrui Zhang, Binbin Zhou, Pengfei Li, Yaodong Yang, Gang Pan

摘要:

安全强化学习(RL)研究智能代理不仅要最大化奖励,还要避免探索不安全区域的问题。在这项研究中,我们提出了CUP,一种新的策略优化方法的基础上约束更新投影框架,享有严格的安全保证。我们的CUP开发的核心是新提出的代理函数以及性能约束。与以前的安全RL方法相比,CUP具有以下优点:1)CUP将代理函数推广到广义优势估计(GAE),从而获得强大的经验性能。2)CUP统一了性能界限,为一些现有算法提供了更好的理解和可解释性; 3)CUP仅通过一阶优化器提供了非凸实现,这不需要对目标的凸性进行任何强近似。为了验证我们的CUP方法,我们将CUP与广泛任务的安全RL基线的全面列表进行了比较。实验结果表明,CUP的有效性,无论是在奖励和安全约束满足。我们已经在这个链接https://github.com/zmsn-2077/ CUP-safe-rl上打开了CUP的源代码。

英文摘要:

Safe reinforcement learning (RL) studies problems where an intelligent agent has to not only maximize reward but also avoid exploring unsafe areas. In this study, we propose CUP, a novel policy optimization method based on Constrained Update Projection framework that enjoys rigorous safety guarantee. Central to our CUP development is the newly proposed surrogate functions along with the performance bound. Compared to previous safe RL methods, CUP enjoys the benefits of 1) CUP generalizes the surrogate functions to generalized advantage estimator (GAE), leading to strong empirical performance. 2) CUP unifies performance bounds, providing a better understanding and interpretability for some existing algorithms; 3) CUP provides a non-convex implementation via only first-order optimizers, which does not require any strong approximation on the convexity of the objectives. To validate our CUP method, we compared CUP against a comprehensive list of safe RL baselines on a wide range of tasks. Experiments show the effectiveness of CUP both in terms of reward and safety constraint satisfaction. We have opened the source code of CUP at this link https://github.com/zmsn-2077/ CUP-safe-rl.

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

↑