Maximum Entropy Reinforcement Learning with Mixture Policies
Not on the map. Why?
Abstract (arXiv)
Mixture models are an expressive hypothesis class that can approximate a rich set of policies. However, using mixture policies in the Maximum Entropy (MaxEnt) framework is not straightforward. The entropy of a mixture model is not equal to the sum of its components, nor does it have a closed-form expression in most cases. Using such policies in MaxEnt algorithms, therefore, requires constructing a tractable approximation of the mixture entropy. In this paper, we derive a simple, low-variance mixture-entropy estimator. We show that it is closely related to the sum of marginal entropies. Equipped with our entropy estimator, we derive an algorithmic variant of Soft Actor-Critic (SAC) to the mixture policy case and evaluate it on a series of continuous control tasks.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 15 of its 45 references that are in the map. First posted on arXiv 18 Mar 2021.
Builds on
15 of 45 references.
References · 15
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,635
- 2015Continuous control with deep reinforcement learningcited by 3,279
- 2018Addressing Function Approximation Error in Actor-Critic Methodscited by 2,302
- 2018Soft Actor-Critic Algorithms and Applicationscited by 1,179
- 2016Deep Exploration via Bootstrapped DQNcited by 518
- 2017Learning Robust Rewards with Adversarial Inverse Reinforcement Learningcited by 485
- 2020SUNRISE: A Simple Unified Framework for Ensemble Learning in Deep Reinforcement Learningcited by 150
- 2016Averaged-DQN: Variance Reduction and Stabilization for Deep Reinforcement Learningcited by 106
- 2017OptionGAN: Learning Joint Reward-Policy Options using Generative Adversarial Inverse Reinforcement Learningcited by 40
- 2019An Optimistic Perspective on Offline Reinforcement Learningcited by 37
- 2017Estimating Mixture Entropy with Pairwise Distancescited by 34
3 more
Built on by
Citing papers per year: 2023: 1; 2024: 2; 2025: 0; 2026: 1.
4 papers.
- 2023Near-optimal Conservative Exploration in Reinforcement Learning under Episode-wise Constraintscited by 4
- 2024How to Choose a Reinforcement-Learning Algorithmcited by 3
- 2024Design of Restricted Normalizing Flow towards Arbitrary Stochastic Policy with Computational Efficiencycited by 1
- 2026Revisiting Mixture Policies in Entropy-Regularized Actor-Criticcited by 1
- 2026Revisiting Mixture Policies in Entropy-Regularized Actor-Critic9 May 2026
- 2024Design of Restricted Normalizing Flow towards Arbitrary Stochastic Policy with Computational Efficiency17 Dec 2024
- 2024How to Choose a Reinforcement-Learning Algorithm30 Jul 2024
- 2023Near-optimal Conservative Exploration in Reinforcement Learning under Episode-wise Constraints9 Jun 2023