An operator view of policy gradient methods
원문 초록
We cast policy gradient methods as the repeated application of two operators: a policy improvement operator $\mathcal{I}$, which maps any policy $\pi$ to a better one $\mathcal{I}\pi$, and a projection operator $\mathcal{P}$, which finds the best approximation of $\mathcal{I}\pi$ in the set of realizable policies. We use this framework to introduce operator-based versions of traditional policy gradient methods such as REINFORCE and PPO, which leads to a better understanding of their original counterparts. We also use the understanding we develop of the role of $\mathcal{I}$ and $\mathcal{P}$ to propose a new global lower bound of the expected return. This new perspective allows us to further bridge the gap between policy-based and value-based methods, showing how REINFORCE and the Bellman optimality operator, for example, can be seen as two sides of the same coin.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Direct Retrieval-augmented Optimization: Synergizing Knowledge Selection and Language Models
Hierarchical Policy-Gradient Reinforcement Learning for Multi-Agent Shepherding Control of Non-Cohesive Targets
Convergence Guarantees of Model-free Policy Gradient Methods for LQR with Stochastic Data
Reevaluating Policy Gradient Methods for Imperfect-Information Games
Fine-Tuning Discrete Diffusion Models with Policy Gradient Methods
Divergence-Augmented Policy Optimization
토론
이 논문과 연결된 포럼 글이 아직 없습니다.