A Near-Optimal Algorithm for Safe Reinforcement Learning Under
Instantaneous Hard Constraints

A Near-Optimal Algorithm for Safe Reinforcement Learning Under Instantaneous Hard Constraints

International Conference on Machine Learning (ICML), 2023

8 February 2023

ArXiv (abs)PDF HTML

Papers citing "A Near-Optimal Algorithm for Safe Reinforcement Learning Under Instantaneous Hard Constraints"

6 / 6 papers shown

Title
Provably Efficient RL for Linear MDPs under Instantaneous Safety Constraints in Non-Convex Feature Spaces Amirhossein Roknilamouki A. Ghosh Ming Shi Fatemeh Nourzad Eylem Ekici Ness B. Shroff 261 3 0 25 Feb 2025
Flipping-based Policy for Chance-Constrained Markov Decision ProcessesNeural Information Processing Systems (NeurIPS), 2024 Xun Shen Shuo Jiang Akifumi Wachi Kaumune Hashimoto Sebastien Gros 67 1 0 09 Oct 2024
Absolute State-wise Constrained Policy Optimization: High-Probability State-wise Constraints Satisfaction Weiye Zhao Feihan Li Yifan Sun Yujie Wang Rui Chen Tianhao Wei Changliu Liu 171 2 0 02 Oct 2024
Learning Adversarial MDPs with Stochastic Hard Constraints Francesco Emanuele Stradi Matteo Castiglioni A. Marchesi Nicola Gatti 381 11 0 06 Mar 2024
A Survey of Constraint Formulations in Safe Reinforcement Learning Akifumi Wachi Xun Shen Yanan Sui 294 30 0 03 Feb 2024
Provably Safe Reinforcement Learning with Step-wise Violation ConstraintsNeural Information Processing Systems (NeurIPS), 2023 Nuoya Xiong Yihan Du Longbo Huang 290 12 0 13 Feb 2023