arXivDaily arXiv每日学术速递 周一至周五更新

高校专区

California Institute of Technology(加州理工学院)

2026-05-01 至 2026-05-01 共收录 1
2604.28144 2026-05-01 cs.LG math.OC

Global Optimality for Constrained Exploration via Penalty Regularization

通过惩罚正则化实现约束探索的全局最优性

Florian Wolf, Ilyas Fatkhullin, Niao He

机构 * Florian Wolf: , Ilyas Fatkhullin: , Niao He: 1The Computing \& Mathematical Sciences Department, California Institute of Technology, Pasadena, CA. 2Department of Computer Science, ETH Zurich, Switzerland. 3ETH AI Center, ETH Zurich, Switzerland.

AI总结 本文提出Policy Gradient Penalty方法,通过二次惩罚正则化解决约束下的探索问题,实现全局收敛性和近优策略。

详情

展开后加载摘要…

URL PDF HTML 收藏