mlsanityData to 7 Oct 2026

An operator view of policy gradient methods

arXiv 2006.11266 ↗First posted 19 Jun 2020cs.LG cs.AI stat.MLcited by 17

Not on the map. Why?

Abstract (arXiv)

We cast policy gradient methods as the repeated application of two operators: a policy improvement operator I, which maps any policy π to a better one Iπ, and a projection operator P, which finds the best approximation of Iπ 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 I and 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.

Key facts. Cited by 17 papers in the map (data through 7 Oct 2026). First posted on arXiv 19 Jun 2020.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 7; 2022: 1; 2023: 3; 2024: 1; 2025: 4; 2026: 1.

17 papers.

Sort:

By area: