Safety through feedback in Constrained RL
Not on the map. Why?
Abstract (arXiv)
In safety-critical RL settings, the inclusion of an additional cost function is often favoured over the arduous task of modifying the reward function to ensure the agent's safe behaviour. However, designing or evaluating such a cost function can be prohibitively expensive. For instance, in the domain of self-driving, designing a cost function that encompasses all unsafe behaviours (e.g. aggressive lane changes) is inherently complex. In such scenarios, the cost function can be learned from feedback collected offline in between training rounds. This feedback can be system generated or elicited from a human observing the training process. Previous approaches have not been able to scale to complex environments and are constrained to receiving feedback at the state level which can be expensive to collect. To this end, we introduce an approach that scales to more complex domains and extends to beyond state-level feedback, thus, reducing the burden on the evaluator. Inferring the cost function in such settings poses challenges, particularly in assigning credit to individual states based on trajectory-level feedback. To address this, we propose a surrogate objective that transforms the problem into a state-level supervised classification task with noisy labels, which can be solved efficiently. Additionally, it is often infeasible to collect feedback on every trajectory generated by the agent, hence, two fundamental questions arise: (1) Which trajectories should be presented to the human? and (2) How many trajectories are necessary for effective learning? To address these questions, we introduce textitnovelty-based sampling that selectively involves the evaluator only when the the agent encounters a textitnovel trajectory. We showcase the efficiency of our method through experimentation on several benchmark Safety Gymnasium environments and realistic self-driving scenarios.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 23 of its 39 references that are in the map. First posted on arXiv 28 Jun 2024.
Builds on
23 of 39 references.
References · 23
- 2017Proximal Policy Optimization Algorithmscited by 14,441
- 2017Deep reinforcement learning from human preferencescited by 3,846
- 2016Generative Adversarial Imitation Learningcited by 1,576
- 2017Constrained Policy Optimizationcited by 928
- 2016Unifying Count-Based Exploration and Intrinsic Motivationcited by 632
- 2016#Exploration: A Study of Count-Based Exploration for Deep Reinforcement Learningcited by 307
- 2021PEBBLE: Feedback-Efficient Interactive Reinforcement Learning via Relabeling Experience and Unsupervised Pre-trainingcited by 298
- 2018Large-Scale Study of Curiosity-Driven Learningcited by 277
- 2019End-to-End Safe Reinforcement Learning through Barrier Functions for Safety-Critical Continuous Control Taskscited by 256
- 2021IQ-Learn: Inverse soft-Q Learning for Imitationcited by 191
- 2023Safety-Gymnasium: A Unified Safe Reinforcement Learning Benchmarkcited by 135
- 2020Safe Reinforcement Learning in Constrained Markov Decision Processescited by 109
11 more
- 2017Trial without Error: Towards Safe Reinforcement Learning via Human Interventioncited by 102
- 2022Reward Uncertainty for Exploration in Preference-based Reinforcement Learningcited by 60
- 2022Constrained Update Projection Approach to Safe Policy Optimizationcited by 55
- 2020Inverse Constrained Reinforcement Learningcited by 45
- 2017EX2: Exploration with Exemplar Models for Deep Reinforcement Learningcited by 42
- 2021Safe Reinforcement Learning with Linear Function Approximationcited by 33
- 2022Benchmarking Constraint Inference in Inverse Reinforcement Learningcited by 18
- 2022Interactively Learning Preference Constraints in Linear Banditscited by 11
- 2022Provable Safe Reinforcement Learning with Binary Feedbackcited by 7
- 2023Imitate the Good and Avoid the Bad: An Incremental Approach to Safe Reinforcement Learningcited by 7
- 2024Long-term Safe Reinforcement Learning with Binary Feedbackcited by 4
Built on by
Citing papers per year: 2025: 2; 2026: 3.
5 papers.
- 2025A Survey of Safe Reinforcement Learning and Constrained MDPs: A Technical Survey on Single-Agent and Multi-Agent Safetycited by 12
- 2026MoralityGym: A Benchmark for Evaluating Hierarchical Moral Alignment in Sequential Decision-Making Agentscited by 2
- 2025TraCeS: Learning Per-Timestep Constraint-Violation Credit from Sparse Trajectory-Level Labelscited by 0
- 2026Safe Reinforcement Learning with Preference-based Constraint Inferencecited by 0
- 2026Redistribution-based Cost Inference Improves Sparse Safe Offline RLcited by 0
- 2026Redistribution-based Cost Inference Improves Sparse Safe Offline RL12 Aug 2026
- 2026Safe Reinforcement Learning with Preference-based Constraint Inference24 Mar 2026
- 2026MoralityGym: A Benchmark for Evaluating Hierarchical Moral Alignment in Sequential Decision-Making Agents13 Feb 2026
- 2025A Survey of Safe Reinforcement Learning and Constrained MDPs: A Technical Survey on Single-Agent and Multi-Agent Safety22 May 2025
- 2025TraCeS: Learning Per-Timestep Constraint-Violation Credit from Sparse Trajectory-Level Labels17 Apr 2025