mlsanityData to 7 Oct 2026

AutoCost: Evolving Intrinsic Cost for Zero-violation Reinforcement Learning

arXiv 2301.10339 ↗First posted 24 Jan 2023cs.LG cs.AI cs.ROcited by 16

Not on the map. Why?

Abstract (arXiv)

Safety is a critical hurdle that limits the application of deep reinforcement learning (RL) to real-world control tasks. To this end, constrained reinforcement learning leverages cost functions to improve safety in constrained Markov decision processes. However, such constrained RL methods fail to achieve zero violation even when the cost limit is zero. This paper analyzes the reason for such failure, which suggests that a proper cost function plays an important role in constrained RL. Inspired by the analysis, we propose AutoCost, a simple yet effective framework that automatically searches for cost functions that help constrained RL to achieve zero-violation performance. We validate the proposed method and the searched cost function on the safe RL benchmark Safety Gym. We compare the performance of augmented agents that use our cost function to provide additive intrinsic costs with baseline agents that use the same policy learners but with only extrinsic costs. Results show that the converged policies with intrinsic costs in all environments achieve zero constraint violation and comparable performance with baselines.

Key facts. Cited by 16 papers in the map (data through 7 Oct 2026). Builds on 32 of its 53 references that are in the map. First posted on arXiv 24 Jan 2023.

Builds on

32 of 53 references.

References · 32

  1. 2017Proximal Policy Optimization Algorithmscited by 14,441
  2. 2015Trust Region Policy Optimizationcited by 2,503
  3. 2021Convex optimizationcited by 2,479
  4. 2017Hindsight Experience Replaycited by 1,096
  5. 2017Constrained Policy Optimizationcited by 928
  6. 2018Reward Constrained Policy Optimizationcited by 397
  7. 2017Safe Model-based Reinforcement Learning with Stability Guaranteescited by 347
  8. 2015Risk-Constrained Reinforcement Learning with Percentile Risk Criteriacited by 320
  9. 2020Responsive Safety in Reinforcement Learning by PID Lagrangian Methodscited by 302
  10. 2018A Lyapunov-based Approach to Safe Reinforcement Learningcited by 278
  11. 2018Safe Exploration in Continuous Action Spacescited by 237
  12. 2022Safe Control with Learned Certificates: A Survey of Neural Lyapunov, Barrier, and Contraction methodscited by 148
20 more
  1. 2020Neural Lyapunov Controlcited by 142
  2. 2020Learning to be Safe: Deep RL with a Safety Criticcited by 109
  3. 2020Conservative Safety Critics for Explorationcited by 107
  4. 2018On Learning Intrinsic Rewards for Policy Gradient Methodscited by 100
  5. 2021Safe Nonlinear Control Using Robust Neural Lyapunov-Barrier Functionscited by 91
  6. 2018Evolved Policy Gradientscited by 86
  7. 2021Learning Safe Multi-Agent Control with Decentralized Neural Barrier Certificatescited by 71
  8. 2018Diversity-Driven Exploration Strategy for Deep Reinforcement Learningcited by 65
  9. 2018Accelerated Primal-Dual Policy Optimization for Safe Reinforcement Learningcited by 61
  10. 2020Meta-Gradient Reinforcement Learning with an Objective Discovered Onlinecited by 52
  11. 2021Evolving Reinforcement Learning Algorithmscited by 48
  12. 2019Discovery of Useful Questions as Auxiliary Taskscited by 45
  13. 2021A Primal-Dual Approach to Constrained Markov Decision Processescited by 42
  14. 2020Sample-Efficient Automated Deep Reinforcement Learningcited by 31
  15. 2019Evolving Rewards to Automate Reinforcement Learningcited by 28
  16. 2018Learning to Design RNAcited by 27
  17. 2019Safe Control Algorithms Using Energy Functions: A Unified Framework, Benchmark, and New Directionscited by 17
  18. 2020ShieldNN: A Provably Safe NN Filter for Unsafe NN Controllerscited by 17
  19. 2015Some Applications of Polynomial Optimization in Operations Research and Real-Time Decision Makingcited by 11
  20. 2021Learn Zero-Constraint-Violation Policy in Model-Free Constrained Reinforcement Learningcited by 4

Built on by

Cited by year (2026 to 7 Oct)

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

16 papers.

Sort:

By area: