超越贝尔曼递归:基于庞特里亚金原理的非指数折扣框架 / Beyond the Bellman Recursion: A Pontryagin-Guided Framework for Non-Exponential Discounting
1️⃣ 一句话总结
本文提出了一种新的强化学习算法PG-DPO,它放弃了传统贝尔曼递归方法,转而利用庞特里亚金最大值原理和蒙特卡洛模拟,有效解决了人类偏好和生存过程中常见的非指数折扣问题,在精度和稳定性上优于现有方法。
Most value-based and actor--critic reinforcement learning methods rely on Bellman-style recursions, yet these recursions collapse under non-exponential discounting common in human preferences and survival processes. We show the breakdown is structural: exponential discounting sits at a fragile intersection of multiplicativity and time homogeneity, and violating either property breaks standard dynamic programming. To overcome this, we propose Pontryagin-Guided Direct Policy Optimization (PG-DPO), a variational framework that abandons recursion and couples the Pontryagin Maximum Principle with Monte Carlo rollouts via an Adjoint-MC projection enforcing pointwise Hamiltonian maximization. Across multi-dimensional hyperbolic and survival-discount benchmarks, PG-DPO improves accuracy and stability where equation-driven solvers and critic-based baselines diverge.
超越贝尔曼递归:基于庞特里亚金原理的非指数折扣框架 / Beyond the Bellman Recursion: A Pontryagin-Guided Framework for Non-Exponential Discounting
本文提出了一种新的强化学习算法PG-DPO,它放弃了传统贝尔曼递归方法,转而利用庞特里亚金最大值原理和蒙特卡洛模拟,有效解决了人类偏好和生存过程中常见的非指数折扣问题,在精度和稳定性上优于现有方法。
源自 arXiv: 2605.20996