Improved No-Regret Algorithms for Stochastic Shortest Path with Linear MDP

18 December 2021

Papers citing "Improved No-Regret Algorithms for Stochastic Shortest Path with Linear MDP"

6 / 6 papers shown

Title
A Model Selection Approach for Corruption Robust Reinforcement Learning Chen-Yu Wei Christoph Dann Julian Zimmert 77 44 0 31 Dec 2024
Horizon-Free Reinforcement Learning in Polynomial Time: the Power of Stationary Policies Zihan Zhang Xiangyang Ji S. Du 13 21 0 24 Mar 2022
Learning Infinite-Horizon Average-Reward Markov Decision Processes with Constraints Liyu Chen R. Jain Haipeng Luo 36 25 0 31 Jan 2022
Learning Stochastic Shortest Path with Linear Function Approximation Steffen Czolbe Jiafan He Adrian V. Dalca Quanquan Gu 22 30 0 25 Oct 2021
Regret Bounds for Stochastic Shortest Path Problems with Linear Function Approximation Daniel Vial Advait Parulekar Sanjay Shakkottai R. Srikant 21 15 0 04 May 2021
Provably Efficient Reinforcement Learning with Linear Function Approximation Under Adaptivity Constraints Chi Jin Zhuoran Yang Zhaoran Wang OffRL 107 166 0 06 Jan 2021