跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2506.03757 · v3

PPO in the Fisher-Rao geometry

首次提交 2025-06-04 17:23
版本更新 2026-11-06 00:08
雷达观测 2026-11-06 13:11
arXiv ↗PDF ↗

摘要

Proximal Policy Optimization (PPO) is widely used in reinforcement learning due to its strong empirical performance, yet it lacks formal guarantees for policy improvement and convergence. PPO's clipped surrogate objective is motivated by a lower bound on linearization of the value function in flat geometry setting. We derive a tighter surrogate objective and introduce Fisher-Rao PPO (FR-PPO) by leveraging the Fisher-Rao (FR) geometry. Our scheme provides strong theoretical guarantees, including monotonic policy improvement. In the direct parametrization setting, we show that FR-PPO achieves sub-linear convergence, and for parametrized policies we further obtain sub-linear convergence up to the compatible function approximation error. Finally, although our primary focus is theoretical, we also demonstrate empirically that FR-PPO can be implemented as a drop-in replacement for PPO and achieves performance comparable to PPO across a range of standard reinforcement learning tasks.

作者备注:Accepted at NeurIPS 2026

AI 论文解读

基于摘要 · 非全文审阅

作者在 Fisher-Rao 几何下推导更紧的策略代理目标并提出 FR-PPO,给出单调策略改进与次线性收敛的理论保证,并初步验证其可作为 PPO 的即插即用替代。

正在读取账号与研究记录…

版本差异

目前只观测到一个版本,无法比较变化。之后收录新版本时,会在这里对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v3 · 2026-11-06 00:08 · 最新观测版本

PPO in the Fisher-Rao geometry

Proximal Policy Optimization (PPO) is widely used in reinforcement learning due to its strong empirical performance, yet it lacks formal guarantees for policy improvement and convergence. PPO's clipped surrogate objective is motivated by a lower bound on linearization of the value function in flat geometry setting. We derive a tighter surrogate objective and introduce Fisher-Rao PPO (FR-PPO) by leveraging the Fisher-Rao (FR) geometry. Our scheme provides strong theoretical guarantees, including monotonic policy improvement. In the direct parametrization setting, we show that FR-PPO achieves sub-linear convergence, and for parametrized policies we further obtain sub-linear convergence up to the compatible function approximation error. Finally, although our primary focus is theoretical, we also demonstrate empirically that FR-PPO can be implemented as a drop-in replacement for PPO and achieves performance comparable to PPO across a range of standard reinforcement learning tasks.

查看此版本解读 →查看此版本原文 ↗