Maximum Entropy Model-based Reinforcement Learning
Not on the map. Why?
Abstract (arXiv)
Recent advances in reinforcement learning have demonstrated its ability to solve hard agent-environment interaction tasks on a super-human level. However, the application of reinforcement learning methods to practical and real-world tasks is currently limited due to most RL state-of-art algorithms' sample inefficiency, i.e., the need for a vast number of training episodes. For example, OpenAI Five algorithm that has beaten human players in Dota 2 has trained for thousands of years of game time. Several approaches exist that tackle the issue of sample inefficiency, that either offers a more efficient usage of already gathered experience or aim to gain a more relevant and diverse experience via a better exploration of an environment. However, to our knowledge, no such approach exists for model-based algorithms, that showed their high sample efficiency in solving hard control tasks with high-dimensional state space. This work connects exploration techniques and model-based reinforcement learning. We have designed a novel exploration method that takes into account features of the model-based approach. We also demonstrate through experiments that our method significantly improves the performance of the model-based algorithm Dreamer.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 19 of its 22 references that are in the map. First posted on arXiv 2 Dec 2021.
Builds on
19 of 22 references.
References · 19
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2017Proximal Policy Optimization Algorithmscited by 15,215
- 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,885
- 2015Continuous control with deep reinforcement learningcited by 3,407
- 2019Dream to Control: Learning Behaviors by Latent Imaginationcited by 1,653
- 2018Learning Latent Dynamics for Planning from Pixelscited by 1,264
- 2017Curiosity-driven Exploration by Self-supervised Predictioncited by 1,194
- 2019Dota 2 with Large Scale Deep Reinforcement Learningcited by 1,103
- 2015Prioritized Experience Replaycited by 1,099
- 2020Mastering Atari with Discrete World Modelscited by 1,007
- 2018Exploration by Random Network Distillationcited by 993
- 2020CURL: Contrastive Unsupervised Representations for Reinforcement Learningcited by 760
7 more
- 2019Solving Rubik's Cube with a Robot Handcited by 734
- 2021Mastering Visual Continuous Control: Improved Data-Augmented Reinforcement Learningcited by 372
- 2018Provably Efficient Maximum Entropy Explorationcited by 242
- 2020Dreaming: Model-based Reinforcement Learning by Latent Imagination without Reconstructioncited by 66
- 2021Spectral Normalisation for Deep Reinforcement Learning: an Optimisation Perspectivecited by 65
- 2020Novelty Search in Representational Space for Sample Efficient Explorationcited by 26
- 2020Latent World Models For Intrinsically Motivated Explorationcited by 15
Built on by
Citing papers per year: 2022: 1; 2023: 1; 2024: 2; 2025: 1.
5 papers.
- 2022Learning General World Models in a Handful of Reward-Free Deploymentscited by 12
- 2024Exploring the limits of Hierarchical World Models in Reinforcement Learningcited by 11
- 2023Reinforcement Learning by Guided Safe Explorationcited by 7
- 2024Learning to Play Atari in a World of Tokenscited by 6
- 2025Enter the Void - Planning to Seek Entropy When Reward is Scarcecited by 0
- 2025Enter the Void - Planning to Seek Entropy When Reward is Scarce22 May 2025
- 2024Learning to Play Atari in a World of Tokens3 Jun 2024
- 2024Exploring the limits of Hierarchical World Models in Reinforcement Learning1 Jun 2024
- 2023Reinforcement Learning by Guided Safe Exploration26 Jul 2023
- 2022Learning General World Models in a Handful of Reward-Free Deployments23 Oct 2022