Umbrella Reinforcement Learning -- computationally efficient tool for hard non-linear problems
On the map: Deep reinforcement learning methods → RL theory and sample complexity
Abstract (arXiv)
We report a novel, computationally efficient approach for solving hard nonlinear problems of reinforcement learning (RL). Here we combine umbrella sampling, from computational physics/chemistry, with optimal control methods. The approach is realized on the basis of neural networks, with the use of policy gradient. It outperforms, by computational efficiency and implementation universality, all available state-of-the-art algorithms, in application to hard RL problems with sparse reward, state traps and lack of terminal states. The proposed approach uses an ensemble of simultaneously acting agents, with a modified reward which includes the ensemble entropy, yielding an optimal exploration-exploitation balance.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Placed in RL theory and sample complexity, one of 15 directions in Deep reinforcement learning methods. Builds on 14 of its 35 references that are in the map. First posted on arXiv 21 Nov 2024.
Builds on
14 of 35 references.
References · 14
- 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,885
- 2016Simple and Scalable Predictive Uncertainty Estimation using Deep Ensemblescited by 3,926
- 2016Asynchronous Methods for Deep Reinforcement Learningcited by 2,258
- 2017Curiosity-driven Exploration by Self-supervised Predictioncited by 1,194
- 2017Hindsight Experience Replaycited by 1,136
- 2016Unifying Count-Based Exploration and Intrinsic Motivationcited by 639
- 2018Data-Efficient Hierarchical Reinforcement Learningcited by 455
- 2018A Survey of Inverse Reinforcement Learning: Challenges, Methods and Progresscited by 298
- 2017Neural Network Dynamics for Model-Based Deep Reinforcement Learning with Model-Free Fine-Tuningcited by 297
- 2020First return, then explorecited by 266
- 2018Provably Efficient Maximum Entropy Explorationcited by 242
- 2018Understanding the impact of entropy on policy optimizationcited by 176
2 more
- 2020A Finite Time Analysis of Two Time-Scale Actor Critic Methodscited by 122
- 2018Coordinated Exploration in Concurrent Reinforcement Learningcited by 17
Built on by
Citing papers per year: 2025: 1.
1 paper.
Similar, not cited
Close in wording, no citation either way
- 2022On Practical Reinforcement Learning: Provable Robustness, Scalability, and Statistical Efficiency
- 2023Reinforcement Learning with General Utilities: Simpler Variance Reduction and Large State-Action Space
- 2020Exploration by Maximizing R'enyi Entropy for Reward-Free RL Framework
- 2026Physics-enhanced reinforcement learning for real-time optimal control of dynamical systems
- 2025Sample-efficient and Scalable Exploration in Continuous-Time RL
- 2024A General Control-Theoretic Approach for Reinforcement Learning: Theory and Algorithms
- 2024Sampling-based Safe Reinforcement Learning for Nonlinear Dynamical Systems
- 2025Pass@K Policy Optimization: Solving Harder Reinforcement Learning Problems