Learning Transferable Domain Priors for Safe Exploration in Reinforcement Learning
Not on the map. Why?
Abstract (arXiv)
Prior access to domain knowledge could significantly improve the performance of a reinforcement learning agent. In particular, it could help agents avoid potentially catastrophic exploratory actions, which would otherwise have to be experienced during learning. In this work, we identify consistently undesirable actions in a set of previously learned tasks, and use pseudo-rewards associated with them to learn a prior policy. In addition to enabling safer exploratory behaviors in subsequent tasks in the domain, we show that these priors are transferable to similar environments, and can be learned off-policy and in parallel with the learning of other tasks in the domain. We compare our approach to established, state-of-the-art algorithms in both discrete as well as continuous environments, and demonstrate that it exhibits a safer exploratory behavior while learning to perform arbitrary tasks in the domain. We also present a theoretical analysis to support these results, and briefly discuss the implications and some alternative formulations of this approach, which could also be useful in certain scenarios.
Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). First posted on arXiv 10 Sep 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 1; 2023: 1; 2024: 2; 2025: 2.
7 papers.
- 2022Exploration in Deep Reinforcement Learning: A Surveycited by 158
- 2021Exploration in Deep Reinforcement Learning: From Single-Agent to Multiagent Domaincited by 57
- 2024Reinforcement Learning with Adaptive Regularization for Safe Control of Critical Systemscited by 6
- 2023Reinforcement Learning by Guided Safe Explorationcited by 5
- 2024Safety through Permissibility: Shield Construction for Fast and Safe Reinforcement Learningcited by 0
- 2025Enhance Exploration in Safe Reinforcement Learning with Contrastive Representation Learningcited by 0
- 2025Learning to Compress Graphs via Dual Agents for Consistent Topological Robustness Evaluationcited by 0
- 2025Learning to Compress Graphs via Dual Agents for Consistent Topological Robustness Evaluation24 Nov 2025
- 2025Enhance Exploration in Safe Reinforcement Learning with Contrastive Representation Learning13 Mar 2025
- 2024Safety through Permissibility: Shield Construction for Fast and Safe Reinforcement Learning29 May 2024
- 2024Reinforcement Learning with Adaptive Regularization for Safe Control of Critical Systems23 Apr 2024
- 2023Reinforcement Learning by Guided Safe Exploration26 Jul 2023
- 2022Exploration in Deep Reinforcement Learning: A Survey2 May 2022
- 2021Exploration in Deep Reinforcement Learning: From Single-Agent to Multiagent Domain14 Sep 2021