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

8 February 2023

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

9 / 9 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 66 0 0 25 Feb 2025
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 30 0 0 02 Oct 2024
Learning Adversarial MDPs with Stochastic Hard Constraints Francesco Emanuele Stradi Matteo Castiglioni A. Marchesi Nicola Gatti 26 4 0 06 Mar 2024
A Survey of Constraint Formulations in Safe Reinforcement Learning Akifumi Wachi Xun Shen Yanan Sui 33 10 0 03 Feb 2024
Provably Safe Reinforcement Learning with Step-wise Violation Constraints Nuoya Xiong Yihan Du Longbo Huang 15 9 0 13 Feb 2023
Provably Efficient Model-Free Constrained RL with Linear Function Approximation A. Ghosh Xingyu Zhou Ness B. Shroff 64 23 0 23 Jun 2022
Computationally Efficient Horizon-Free Reinforcement Learning for Linear Mixture MDPs Dongruo Zhou Quanquan Gu 78 43 0 23 May 2022
Achieving Zero Constraint Violation for Constrained Reinforcement Learning via Primal-Dual Approach Qinbo Bai Amrit Singh Bedi Mridul Agarwal Alec Koppel Vaneet Aggarwal 107 56 0 13 Sep 2021
Near-optimal Policy Optimization Algorithms for Learning Adversarial Linear Mixture MDPs Jiafan He Dongruo Zhou Quanquan Gu 95 23 0 17 Feb 2021