Implicit Policy for Reinforcement Learning
arXiv:1806.06798
Abstract
We introduce Implicit Policy, a general class of expressive policies that can flexibly represent complex action distributions in reinforcement learning, with efficient algorithms to compute entropy regularized policy gradients. We empirically show that, despite its simplicity in implementation, entropy regularization combined with a rich policy class can attain desirable properties displayed under maximum entropy reinforcement learning framework, such as robustness and multi-modality.
References in corpus (17)
- Adam: A Method for Stochastic Optimization
- Continuous control with deep reinforcement learning
- Playing Atari with Deep Reinforcement Learning
- Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actor
- Trust Region Policy Optimization
- NICE: Non-linear Independent Components Estimation
- Density estimation using Real NVP
- Noisy Networks for Exploration
- Reinforcement Learning and Control as Probabilistic Inference: Tutorial and Review
- Bridging the Gap Between Value and Policy Based Reinforcement Learning
- A Connection between Generative Adversarial Networks, Inverse Reinforcement Learning, and Energy-Based Models
- Equivalence Between Policy Gradients and Soft Q-Learning
- Simple random search provides a competitive approach to reinforcement learning
- Hierarchical Implicit Models and Likelihood-Free Variational Inference
- Combining policy gradient and Q-learning
- Latent Space Policies for Hierarchical Reinforcement Learning
- Gradient Estimators for Implicit Models