Order-Optimal Regret with Novel Policy Gradient Approaches in Infinite-Horizon Average Reward MDPs
Not on the map. Why?
Abstract (arXiv)
We present two Policy Gradient-based algorithms with general parametrization in the context of infinite-horizon average reward Markov Decision Process (MDP). The first one employs Implicit Gradient Transport for variance reduction, ensuring an expected regret of the order tildeO(T2/3). The second approach, rooted in Hessian-based techniques, ensures an expected regret of the order tildeO(√T). These results significantly improve the state-of-the-art tildeO(T3/4) regret and achieve the theoretical lower bound. We also show that the average-reward function is approximately L-smooth, a result that was previously assumed in earlier works.
Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). Builds on 19 of its 31 references that are in the map. First posted on arXiv 2 Apr 2024.
Builds on
19 of 31 references.
References · 19
- 2019Momentum-Based Variance Reduction in Non-Convex SGDcited by 302
- 2019On the Theory of Policy Gradient Methods: Optimality, Approximation, and Distribution Shiftcited by 174
- 2019Neural Policy Gradient Methods: Global Optimality and Rates of Convergencecited by 157
- 2020Momentum Improves Normalized SGDcited by 136
- 2019Model-free Reinforcement Learning in Infinite-horizon Average-reward Markov Decision Processescited by 81
- 2021On the Convergence and Sample Efficiency of Variance-Reduced Policy Gradient Methodcited by 67
- 2022An Improved Analysis of (Variance-Reduced) Policy Gradient and Natural Policy Gradient Methodscited by 63
- 2023Stochastic Policy Gradient Methods: Improved Sample Complexity for Fisher-non-degenerate Policiescited by 53
- 2022Adapting to Mixing Time in Stochastic Optimization with Markovian Datacited by 35
- 2023Sharper Model-free Reinforcement Learning for Average-reward Markov Decision Processescited by 28
- 2023Improved Sample Complexity Analysis of Natural Policy Gradient Algorithm with General Parameterization for Infinite Horizon Discounted Reward Markov Decision Processescited by 24
- 2023Regret Analysis of Policy Gradient Algorithm for Infinite Horizon Average Reward Markov Decision Processescited by 22
7 more
- 2022Achieving Zero Constraint Violation for Constrained Reinforcement Learning via Conservative Natural Policy Gradient Primal-Dual Algorithmcited by 19
- 2021Concave Utility Reinforcement Learning with Zero-Constraint Violationscited by 18
- 2021Better SGD using Second-order Momentumcited by 14
- 2022Momentum-Based Policy Gradient with Second-Order Informationcited by 11
- 2023Cooperating Graph Neural Networks with Deep Reinforcement Learning for Vaccine Prioritizationcited by 9
- 2023Performance Bounds for Policy-Based Average Reward Reinforcement Learning Algorithmscited by 6
- 2024Towards Global Optimality for Practical Average Reward Reinforcement Learning without Mixing Time Oraclescited by 6
Built on by
Citing papers per year: 2024: 1; 2025: 4; 2026: 6.
11 papers.
- 2024A Sharper Global Convergence Analysis for Average Reward Reinforcement Learning via an Actor-Critic Approachcited by 14
- 2025On The Sample Complexity Bounds In Bilevel Reinforcement Learningcited by 10
- 2025Global Convergence for Average Reward Constrained MDPs with Primal-Dual Actor Critic Algorithmcited by 8
- 2025Finite-Sample Analysis of Policy Evaluation for Robust Average Reward Reinforcement Learningcited by 6
- 2025Regret Analysis of Average-Reward Unichain MDPs via an Actor-Critic Approachcited by 6
- 2026Breaking the Bias Barrier in Concave Multi-Objective Reinforcement Learningcited by 2
- 2026Provably Efficient Algorithms for S- and Non-Rectangular Robust MDPs with General Parameterizationcited by 1
- 2026Learning Weakly Communicating Average-Reward CMDPs: Strong Duality and Improved Regretcited by 1
- 2026Learning Policy from a Single Trajectory in Average-Reward Markov Decision Processcited by 1
- 2026High-Probability PL-SGD with Markovian Noise: Optimal Mixing and Tail Dependencecited by 0
- 2026Hierarchical Multilevel Monte Carlo for Order-Optimal Neural Actor-Critic in Average-Reward CMDPscited by 0
- 2026Hierarchical Multilevel Monte Carlo for Order-Optimal Neural Actor-Critic in Average-Reward CMDPs30 Jul 2026
- 2026High-Probability PL-SGD with Markovian Noise: Optimal Mixing and Tail Dependence24 Jun 2026
- 2026Learning Policy from a Single Trajectory in Average-Reward Markov Decision Process15 Jun 2026
- 2026Learning Weakly Communicating Average-Reward CMDPs: Strong Duality and Improved Regret12 May 2026
- 2026Breaking the Bias Barrier in Concave Multi-Objective Reinforcement Learning9 Mar 2026
- 2026Provably Efficient Algorithms for S- and Non-Rectangular Robust MDPs with General Parameterization11 Feb 2026
- 2025Regret Analysis of Average-Reward Unichain MDPs via an Actor-Critic Approach26 May 2025
- 2025Global Convergence for Average Reward Constrained MDPs with Primal-Dual Actor Critic Algorithm21 May 2025
- 2025On The Sample Complexity Bounds In Bilevel Reinforcement Learning22 Mar 2025
- 2025Finite-Sample Analysis of Policy Evaluation for Robust Average Reward Reinforcement Learning24 Feb 2025
- 2024A Sharper Global Convergence Analysis for Average Reward Reinforcement Learning via an Actor-Critic Approach26 Jul 2024