Beyond The Policy Gradient Theorem For Efficient Policy Updates In Actor-critic Algorithms

Abstract

In Reinforcement Learning, the optimal action at a given state is dependent on policy decisions at subsequent states. As a consequence, the learning targets evolve with time and the policy optimization process must be efficient at unlearning what it previously learnt. In this paper, we discover that the policy gradient theorem prescribes policy updates that are slow to unlearn because of their structural symmetry with respect to the value target. To increase the unlearning speed, we study a novel policy update: the gradient of the cross-entropy loss with respect to the action maximizing \(q\), but find that such updates may lead to a decrease in value. Consequently, we introduce a modified policy update devoid of that flaw, and prove its guarantees of convergence to global optimality in \(\mathcal\{O\}(t^\{-1\})\) under classic assumptions. Further, we assess standard policy updates and our cross-entropy policy updates along six analytical dimensions. Finally, we empirically validate o

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keylaroche2022beyond

Related papers

• An Approximate Policy Iteration Viewpoint Of Actor-critic Algorithms (2022)2.26
• Greedy Actor-critic: A New Conditional Cross-entropy Method For Policy Improvement (2018)0.00
• Compatible Gradient Approximations For Actor-critic Algorithms (2024)0.00
• An Off-policy Policy Gradient Theorem Using Emphatic Weightings (2018)0.00
• Neural Policy Gradient Methods: Global Optimality And Rates Of Convergence (2019)0.00
• Single-timescale Actor-critic Provably Finds Globally Optimal Policy (2020)0.00
• Convergent Actor-critic Algorithms Under Off-policy Training And Function Approximation (2018)0.00
• Value Improved Actor Critic Algorithms (2024)0.00