mlsanityData to 14 Oct 2026

Efficient Exploration in Resource-Restricted Reinforcement Learning

arXiv 2212.06988 ↗First posted 14 Dec 2022cs.LG cs.AIcited by 10

Not on the map. Why?

Abstract (arXiv)

In many real-world applications of reinforcement learning (RL), performing actions requires consuming certain types of resources that are non-replenishable in each episode. Typical applications include robotic control with limited energy and video games with consumable items. In tasks with non-replenishable resources, we observe that popular RL methods such as soft actor critic suffer from poor sample efficiency. The major reason is that, they tend to exhaust resources fast and thus the subsequent exploration is severely restricted due to the absence of resources. To address this challenge, we first formalize the aforementioned problem as a resource-restricted reinforcement learning, and then propose a novel resource-aware exploration bonus (RAEB) to make reasonable usage of resources. An appealing feature of RAEB is that, it can significantly reduce unnecessary resource-consuming trials while effectively encouraging the agent to explore unvisited states. Experiments demonstrate that the proposed RAEB significantly outperforms state-of-the-art exploration strategies in resource-restricted reinforcement learning environments, improving the sample efficiency by up to an order of magnitude.

Key facts. Cited by 10 papers in the map (data through 14 Oct 2026). Builds on 16 of its 36 references that are in the map. First posted on arXiv 14 Dec 2022.

Builds on

16 of 36 references.

References · 16

  1. 2017Proximal Policy Optimization Algorithmscited by 15,215
  2. 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,885
  3. 2015Trust Region Policy Optimizationcited by 2,580
  4. 2016OpenAI Gymcited by 1,736
  5. 2017Curiosity-driven Exploration by Self-supervised Predictioncited by 1,194
  6. 2017Constrained Policy Optimizationcited by 983
  7. 2016Unifying Count-Based Exploration and Intrinsic Motivationcited by 639
  8. 2018Is Q-learning Provably Efficient?cited by 487
  9. 2016#Exploration: A Study of Count-Based Exploration for Deep Reinforcement Learningcited by 309
  10. 2018Large-Scale Study of Curiosity-Driven Learningcited by 280
  11. 2016ViZDoom: A Doom-based AI Research Platform for Visual Reinforcement Learningcited by 179
  12. 2015Variational Information Maximisation for Intrinsically Motivated Reinforcement Learningcited by 144
4 more
  1. 2018Model-Based Active Explorationcited by 105
  2. 2017Surprise-Based Intrinsic Motivation for Deep Reinforcement Learningcited by 83
  3. 2018Pommerman: A Multi-Agent Playgroundcited by 30
  4. 2018Resource Constrained Deep Reinforcement Learningcited by 24

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 2; 2024: 4; 2025: 2; 2026: 2.

10 papers.