mlsanityData to 7 Oct 2026

Controlling Underestimation Bias in Constrained Reinforcement Learning for Safe Exploration

arXiv 2601.11953 ↗First posted 17 Jan 2026cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

Constrained Reinforcement Learning (CRL) aims to maximize cumulative rewards while satisfying constraints. However, existing CRL algorithms often encounter significant constraint violations during training, limiting their applicability in safety-critical scenarios. In this paper, we identify the underestimation of the cost value function as a key factor contributing to these violations. To address this issue, we propose the Memory-driven Intrinsic Cost Estimation (MICE) method, which introduces intrinsic costs to mitigate underestimation and control bias to promote safer exploration. Inspired by flashbulb memory, where humans vividly recall dangerous experiences to avoid risks, MICE constructs a memory module that stores previously explored unsafe states to identify high-cost regions. The intrinsic cost is formulated as the pseudo-count of the current state visiting these risk regions. Furthermore, we propose an extrinsic-intrinsic cost value function that incorporates intrinsic costs and adopts a bias correction strategy. Using this function, we formulate an optimization objective within the trust region, along with corresponding optimization methods. Theoretically, we provide convergence guarantees for the proposed cost value function and establish the worst-case constraint violation for the MICE update. Extensive experiments demonstrate that MICE significantly reduces constraint violations while preserving policy performance comparable to baselines.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 25 of its 38 references that are in the map. First posted on arXiv 17 Jan 2026.

Builds on

25 of 38 references.

References · 25

  1. 2018Addressing Function Approximation Error in Actor-Critic Methodscited by 2,302
  2. 2015High-Dimensional Continuous Control Using Generalized Advantage Estimationcited by 1,916
  3. 2015Deep Reinforcement Learning with Double Q-learningcited by 1,704
  4. 2016OpenAI Gymcited by 1,684
  5. 2017Constrained Policy Optimizationcited by 928
  6. 2019Dynamics-Aware Unsupervised Discovery of Skillscited by 308
  7. 2020Responsive Safety in Reinforcement Learning by PID Lagrangian Methodscited by 302
  8. 2020Never Give Up: Learning Directed Exploration Strategiescited by 210
  9. 2020Projection-Based Constrained Policy Optimizationcited by 195
  10. 2024Deep Reinforcement Learning for Robotics: A Survey of Real-World Successescited by 153
  11. 2023Safety-Gymnasium: A Unified Safe Reinforcement Learning Benchmarkcited by 135
  12. 2020Provably Efficient Safe Exploration via Primal-Dual Policy Optimizationcited by 131
13 more
  1. 2020CRPO: A New Approach for Safe Reinforcement Learning with Convergence Guaranteecited by 128
  2. 2020Maxmin Q-learning: Controlling the Estimation Bias of Q-learningcited by 117
  3. 2021State Entropy Maximization with Random Encoders for Efficient Explorationcited by 107
  4. 2022Saute RL: Almost Surely Safe Reinforcement Learning Using State Augmentationcited by 63
  5. 2022Penalized Proximal Policy Optimization for Safe Reinforcement Learningcited by 60
  6. 2022Constrained Update Projection Approach to Safe Policy Optimizationcited by 55
  7. 2021MADE: Exploration via Maximizing Deviation from Explored Regionscited by 40
  8. 2022Towards Safe Reinforcement Learning with a Safety Editor Policycited by 28
  9. 2023Scalable Primal-Dual Actor-Critic Method for Safe Multi-Agent RL with General Utilitiescited by 15
  10. 2023Adaptive Ensemble Q-learning: Minimizing Estimation Bias via Error Feedbackcited by 9
  11. 2022Effects of Safety State Augmentation on Safe Explorationcited by 5
  12. 2024Exterior Penalty Policy Optimization with Penalty Metric Network under Constraintscited by 5
  13. 2021Balanced Q-learning: Combining the Influence of Optimistic and Pessimistic Targetscited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.