PC-PG: Policy Cover Directed Exploration for Provable Policy Gradient Learning
Alekh Agarwal, Mikael Henaff, Sham Kakade, Wen Sun

TL;DR
This paper introduces PC-PG, a policy gradient algorithm that balances exploration and exploitation using a policy cover, with provable guarantees and empirical validation in various reinforcement learning settings.
Contribution
The paper proposes PC-PG, a novel policy gradient method with ensemble-based exploration, offering theoretical guarantees under model misspecification and empirical validation.
Findings
Polynomial sample complexity for tabular and linear MDPs
Strong guarantees under model misspecification
Effective exploration in reward-free and reward-driven tasks
Abstract
Direct policy gradient methods for reinforcement learning are a successful approach for a variety of reasons: they are model free, they directly optimize the performance metric of interest, and they allow for richly parameterized policies. Their primary drawback is that, by being local in nature, they fail to adequately explore the environment. In contrast, while model-based approaches and Q-learning directly handle exploration through the use of optimism, their ability to handle model misspecification and function approximation is far less evident. This work introduces the the Policy Cover-Policy Gradient (PC-PG) algorithm, which provably balances the exploration vs. exploitation tradeoff using an ensemble of learned policies (the policy cover). PC-PG enjoys polynomial sample complexity and run time for both tabular MDPs and, more generally, linear MDPs in an infinite dimensional RKHS.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
Taxonomy
TopicsReinforcement Learning in Robotics · Advanced Bandit Algorithms Research · Adversarial Robustness in Machine Learning
MethodsQ-Learning
