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"

8 / 8 papers shown

Title
A Model Selection Approach for Corruption Robust Reinforcement Learning Chen-Yu Wei Christoph Dann Julian Zimmert 80 44 0 31 Dec 2024
Layered State Discovery for Incremental Autonomous Exploration Liyu Chen Andrea Tirinzoni A. Lazaric Matteo Pirotta 28 0 0 07 Feb 2023
Offline Stochastic Shortest Path: Learning, Evaluation and Towards Optimality Ming Yin Wenjing Chen Mengdi Wang Yu-Xiang Wang OffRL 27 4 0 10 Jun 2022
Horizon-Free Reinforcement Learning in Polynomial Time: the Power of Stationary Policies Zihan Zhang Xiangyang Ji S. Du 28 21 0 24 Mar 2022
Learning Infinite-Horizon Average-Reward Markov Decision Processes with Constraints Liyu Chen R. Jain Haipeng Luo 49 25 0 31 Jan 2022
Learning Stochastic Shortest Path with Linear Function Approximation Steffen Czolbe Jiafan He Adrian V. Dalca Quanquan Gu 39 30 0 25 Oct 2021
Regret Bounds for Stochastic Shortest Path Problems with Linear Function Approximation Daniel Vial Advait Parulekar Sanjay Shakkottai R. Srikant 32 15 0 04 May 2021
Provably Efficient Reinforcement Learning with Linear Function Approximation Under Adaptivity Constraints Chi Jin Zhuoran Yang Zhaoran Wang OffRL 122 166 0 06 Jan 2021