Diversity-inducing Policy Gradient: Using Maximum Mean Discrepancy To Find A Set Of Diverse Policies

Abstract

Standard reinforcement learning methods aim to master one way of solving a task whereas there may exist multiple near-optimal policies. Being able to identify this collection of near-optimal policies can allow a domain expert to efficiently explore the space of reasonable solutions. Unfortunately, existing approaches that quantify uncertainty over policies are not ultimately relevant to finding policies with qualitatively distinct behaviors. In this work, we formalize the difference between policies as a difference between the distribution of trajectories induced by each policy, which encourages diversity with respect to both state visitation and action choices. We derive a gradient-based optimization technique that can be combined with existing policy gradient methods to now identify diverse collections of well-performing policies. We demonstrate our approach on benchmarks and a healthcare task.

Stats

• citations12
• S2 citations—
• github stars0
• HF likes0
• heat score8.35
• arxiv keymasood2019diversity

Related papers

• DGPO: Discovering Multiple Strategies With Diversity-guided Policy Optimization (2022)2.26
• Diversity Policy Gradient For Sample Efficient Quality-diversity Optimization (2020)11.58
• Increasing Entropy To Boost Policy Gradient Performance On Personalization Tasks (2023)0.00
• Improving Policy Gradient By Exploring Under-appreciated Rewards (2016)0.00
• Diverse Policies Converge In Reward-free Markov Decision Processe (2023)0.00
• Open-ended Diverse Solution Discovery With Regulated Behavior Patterns For Cross-domain Adaptation (2022)0.00
• Policy Gradient From Demonstration And Curiosity (2020)0.00
• Identifying Policy Gradient Subspaces (2024)0.00