Implicit Policy for Reinforcement Learning
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). First posted on arXiv 10 Jun 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1; 2023: 1; 2024: 2; 2025: 0; 2026: 2.
6 papers.
- 2022Learning Sampling Distributions for Model Predictive Controlcited by 10
- 2024Discretizing Continuous Action Space with Unimodal Probability Distributions for On-Policy Reinforcement Learningcited by 4
- 2026Wasserstein Proximal Policy Gradientcited by 4
- 2024How to Choose a Reinforcement-Learning Algorithmcited by 3
- 2026Revisiting Mixture Policies in Entropy-Regularized Actor-Criticcited by 1
- 2023Diversity for Contingency: Learning Diverse Behaviors for Efficient Adaptation and Transfercited by 0
- 2026Revisiting Mixture Policies in Entropy-Regularized Actor-Critic9 May 2026
- 2026Wasserstein Proximal Policy Gradient3 Mar 2026
- 2024Discretizing Continuous Action Space with Unimodal Probability Distributions for On-Policy Reinforcement Learning1 Aug 2024
- 2024How to Choose a Reinforcement-Learning Algorithm30 Jul 2024
- 2023Diversity for Contingency: Learning Diverse Behaviors for Efficient Adaptation and Transfer11 Oct 2023
- 2022Learning Sampling Distributions for Model Predictive Control5 Dec 2022