Optimal Transport Perturbations for Safe Reinforcement Learning with Robustness Guarantees

James Queeney, Erhan Can Ozcan, Ioannis Ch. Paschalidis, Christos G. Cassandras
1/31/2023
cs.LGcs.AIstat.ML

No official code found. Best implementation: jqueeney/robust-safe-rl (17 stars, GPL-3.0, last commit 2024-03-27).

Abstract

Robustness and safety are critical for the trustworthy deployment of deep reinforcement learning. Real-world decision making applications require algorithms that can guarantee robust performance and safety in the presence of general environment disturbances, while making limited assumptions on the data collection process during training. In order to accomplish this goal, we introduce a safe reinforcement learning framework that incorporates robustness through the use of an optimal transport cost uncertainty set. We provide an efficient implementation based on applying Optimal Transport Perturbations to construct worst-case virtual state transitions, which does not impact data collection during training and does not require detailed simulator access. In experiments on continuous control tasks with safety constraints, our approach demonstrates robust performance while significantly improving safety at deployment time compared to standard safe reinforcement learning.

View on arXivView PDF

Code Implementations(1)

GPL-3.0

Robust and safe deep reinforcement learning algorithms

172Python2 years agoGPL-3.0

Similar Papers

Cite this paper

@article{queeney2023optimal,
  title  = {Optimal Transport Perturbations for Safe Reinforcement Learning with Robustness Guarantees},
  author = {James Queeney and Erhan Can Ozcan and Ioannis Ch. Paschalidis and Christos G. Cassandras},
  year   = {2023},
  eprint = {2301.13375},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2301.13375v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2301.13375.svg)](https://codeofpaper.com/paper/2301.13375)

Discussion