mlsanityData to 14 Oct 2026

Imitate the Good and Avoid the Bad: An Incremental Approach to Safe Reinforcement Learning

arXiv 2312.10385 ↗First posted 16 Dec 2023cs.LG cs.AIcited by 7

Not on the map. Why?

Abstract (arXiv)

A popular framework for enforcing safe actions in Reinforcement Learning (RL) is Constrained RL, where trajectory based constraints on expected cost (or other cost measures) are employed to enforce safety and more importantly these constraints are enforced while maximizing expected reward. Most recent approaches for solving Constrained RL convert the trajectory based cost constraint into a surrogate problem that can be solved using minor modifications to RL methods. A key drawback with such approaches is an over or underestimation of the cost constraint at each state. Therefore, we provide an approach that does not modify the trajectory based cost constraint and instead imitates ``good'' trajectories and avoids ``bad'' trajectories generated from incrementally improving policies. We employ an oracle that utilizes a reward threshold (which is varied with learning) and the overall cost constraint to label trajectories as ``good'' or ``bad''. A key advantage of our approach is that we are able to work from any starting policy or set of trajectories and improve on it. In an exhaustive set of experiments, we demonstrate that our approach is able to outperform top benchmark approaches for solving Constrained RL problems, with respect to expected cost, CVaR cost, or even unknown cost constraints.

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

Builds on

22 of 35 references.

References · 22

  1. 2017Proximal Policy Optimization Algorithmscited by 15,215
  2. 2019Momentum Contrast for Unsupervised Visual Representation Learningcited by 7,513
  3. 2020Bootstrap your own latent: A new approach to self-supervised Learningcited by 4,750
  4. 2016Asynchronous Methods for Deep Reinforcement Learningcited by 2,258
  5. 2021SimCSE: Simple Contrastive Learning of Sentence Embeddingscited by 2,173
  6. 2016Generative Adversarial Imitation Learningcited by 1,597
  7. 2016Unsupervised Learning of Visual Representations by Solving Jigsaw Puzzlescited by 1,382
  8. 2017Constrained Policy Optimizationcited by 983
  9. 2020CURL: Contrastive Unsupervised Representations for Reinforcement Learningcited by 760
  10. 2021IQ-Learn: Inverse soft-Q Learning for Imitationcited by 193
  11. 2019Imitation Learning via Off-Policy Distribution Matchingcited by 183
  12. 2019Lyapunov-based Safe Policy Optimization for Continuous Controlcited by 145
10 more
  1. 2020Primal Wasserstein Imitation Learningcited by 121
  2. 2017Deep Reinforcement Learning for Sepsis Treatmentcited by 71
  3. 2022Constrained Update Projection Approach to Safe Policy Optimizationcited by 58
  4. 2020Contrastive Learning for Debiased Candidate Generation in Large-Scale Recommender Systemscited by 38
  5. 2020Constrained Markov Decision Processes via Backward Value Functionscited by 33
  6. 2020Towards Effective Context for Meta-Reinforcement Learning: an Approach based on Contrastive Learningcited by 29
  7. 2021Adversarial and Contrastive Variational Autoencoder for Sequential Recommendationcited by 28
  8. 2017Representation and Reinforcement Learning for Personalized Glycemic Control in Septic Patientscited by 13
  9. 2019Reinforcement Learning for Robotic Manipulation using Simulated Locomotion Demonstrationscited by 11
  10. 2023Learning from Pixels with Expert Observationscited by 3

Built on by

Cited by year

Citing papers per year: 2024: 6; 2025: 1.

7 papers.