Policy Augmentation: An Exploration Strategy for Faster Convergence of Deep Reinforcement Learning Algorithms
Not on the map. Why?
Abstract (arXiv)
Despite advancements in deep reinforcement learning algorithms, developing an effective exploration strategy is still an open problem. Most existing exploration strategies either are based on simple heuristics, or require the model of the environment, or train additional deep neural networks to generate imagination-augmented paths. In this paper, a revolutionary algorithm, called Policy Augmentation, is introduced. Policy Augmentation is based on a newly developed inductive matrix completion method. The proposed algorithm augments the values of unexplored state-action pairs, helping the agent take actions that will result in high-value returns while the agent is in the early episodes. Training deep reinforcement learning algorithms with high-value rollouts leads to the faster convergence of deep reinforcement learning algorithms. Our experiments show the superior performance of Policy Augmentation. The code can be found at: https://github.com/arashmahyari/PolicyAugmentation.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 13 of its 21 references that are in the map. First posted on arXiv 10 Feb 2021.
Builds on
13 of 21 references.
References · 13
- 2017Proximal Policy Optimization Algorithmscited by 15,215
- 2013Playing Atari with Deep Reinforcement Learningcited by 3,274
- 2015Trust Region Policy Optimizationcited by 2,580
- 2016Asynchronous Methods for Deep Reinforcement Learningcited by 2,258
- 2016OpenAI Gymcited by 1,736
- 2018Off-Policy Deep Reinforcement Learning without Explorationcited by 1,241
- 2016#Exploration: A Study of Count-Based Exploration for Deep Reinforcement Learningcited by 309
- 2017Imagination-Augmented Agents for Deep Reinforcement Learningcited by 140
- 2013Provable Inductive Matrix Completioncited by 32
- 2018Curiosity-driven Exploration for Mapless Navigation with Deep Reinforcement Learningcited by 14
- 2013Clustering on Multi-Layer Graphs via Subspace Analysis on Grassmann Manifoldscited by 13
- 2019Attention-based Curiosity-driven Exploration in Deep Reinforcement Learningcited by 5
1 more
Built on by
Citing papers per year: 2024: 1.
1 paper.