Population-Guided Parallel Policy Search for Reinforcement Learning
arXiv:2001.02907
Abstract
In this paper, a new population-guided parallel learning scheme is proposed to enhance the performance of off-policy reinforcement learning (RL). In the proposed scheme, multiple identical learners with their own value-functions and policies share a common experience replay buffer, and search a good policy in collaboration with the guidance of the best policy information. The key point is that the information of the best policy is fused in a soft manner by constructing an augmented loss function for policy update to enlarge the overall search region by the multiple learners. The guidance by the previous best policy and the enlarged range enable faster and better policy search. Monotone improvement of the expected cumulative return by the proposed scheme is proved theoretically. Working algorithms are constructed by applying the proposed scheme to the twin delayed deep deterministic (TD3) policy gradient algorithm. Numerical results show that the constructed algorithm outperforms most of the current state-of-the-art RL algorithms, and the gain is significant in the case of sparse reward environment.
Accepted to ICLR 2020
References in corpus (9)
- Continuous control with deep reinforcement learning
- Trust Region Policy Optimization
- Evolution Strategies as a Scalable Alternative to Reinforcement Learning
- Human-level performance in first-person multiplayer games with population-based deep reinforcement learning
- Reinforcement Learning with Deep Energy-Based Policies
- Massively Parallel Methods for Deep Reinforcement Learning
- Exploration by Random Network Distillation
- Efficient Parallel Methods for Deep Reinforcement Learning
- Evolution-Guided Policy Gradient in Reinforcement Learning