The following publications are possibly variants of this publication:
- Provably Efficient Model-Free Constrained RL with Linear Function ApproximationArnob Ghosh, Xingyu Zhou 0001, Ness B. Shroff. nips 2022: [doi]
- Towards Achieving Sub-linear Regret and Hard Constraint Violation in Model-free RLArnob Ghosh, Xingyu Zhou 0001, Ness B. Shroff. aistats 2024: 1054-1062 [doi]
- Optimal Conservative Offline RL with General Function Approximation via Augmented LagrangianParia Rashidinejad, Hanlin Zhu, Kunhe Yang, Stuart Russell 0001, Jiantao Jiao. iclr 2023: [doi]
- Tackling Heavy-Tailed Rewards in Reinforcement Learning with Function Approximation: Minimax Optimal and Instance-Dependent Regret BoundsJiayi Huang, Han Zhong 0001, Liwei Wang 0001, Lin Yang 0011. nips 2023: [doi]