Offline Stochastic Shortest Path: Learning, Evaluation and Towards Optimality

10 June 2022

Ming Yin

Papers citing "Offline Stochastic Shortest Path: Learning, Evaluation and Towards Optimality"

28 / 28 papers shown

Title
Settling the Sample Complexity of Model-Based Offline Reinforcement Learning Gen Li Laixi Shi Yuxin Chen Yuejie Chi Yuting Wei OffRL 144 87 0 11 Apr 2022
Near-optimal Offline Reinforcement Learning with Linear Representation: Leveraging Variance Information with Pessimism Ming Yin Yaqi Duan Mengdi Wang Yu Wang OffRL 111 67 0 11 Mar 2022
Off-Policy Fitted Q-Evaluation with Differentiable Function Approximators: Z-Estimation and Inference Theory Ruiqi Zhang Xuezhou Zhang Chengzhuo Ni Mengdi Wang OffRL 80 16 0 10 Feb 2022
Improved No-Regret Algorithms for Stochastic Shortest Path with Linear MDP Liyu Chen Rahul Jain Haipeng Luo 76 14 0 18 Dec 2021
First-Order Regret in Reinforcement Learning with Linear Function Approximation: A Robust Estimation Approach Andrew Wagenmaker Yifang Chen Max Simchowitz S. Du Kevin Jamieson 127 39 0 07 Dec 2021
Learning Stochastic Shortest Path with Linear Function Approximation Steffen Czolbe Jiafan He Adrian Dalca Quanquan Gu 80 30 0 25 Oct 2021
Towards Instance-Optimal Offline Reinforcement Learning with Pessimism Ming Yin Yu Wang OffRL 146 82 0 17 Oct 2021
Provable Benefits of Actor-Critic Methods for Offline Reinforcement Learning Andrea Zanette Martin J. Wainwright Emma Brunskill OffRL 95 119 0 19 Aug 2021
Pessimistic Model-based Offline Reinforcement Learning under Partial Coverage Masatoshi Uehara Wen Sun OffRL 153 150 0 13 Jul 2021
Online Learning for Stochastic Shortest Path Model via Posterior Sampling Mehdi Jafarnia-Jahromi Liyu Chen Rahul Jain Haipeng Luo OffRL 105 18 0 09 Jun 2021
Policy Finetuning: Bridging Sample-Efficient Offline and Online Reinforcement Learning Tengyang Xie Nan Jiang Huan Wang Caiming Xiong Yu Bai OffRL OnRL 90 164 0 09 Jun 2021
Regret Bounds for Stochastic Shortest Path Problems with Linear Function Approximation Daniel Vial Advait Parulekar Sanjay Shakkottai R. Srikant 92 15 0 04 May 2021
Stochastic Shortest Path: Minimax, Parameter-Free and Towards Horizon-Free Regret Jean Tarbouriech Runlong Zhou S. Du Matteo Pirotta M. Valko A. Lazaric 98 36 0 22 Apr 2021
Nearly Horizon-Free Offline Reinforcement Learning Zhaolin Ren Jialian Li Bo Dai S. Du Sujay Sanghavi OffRL 69 49 0 25 Mar 2021
Minimax Regret for Stochastic Shortest Path Alon Cohen Yonathan Efroni Yishay Mansour Aviv A. Rosenberg 68 28 0 24 Mar 2021
Bridging Offline Reinforcement Learning and Imitation Learning: A Tale of Pessimism Paria Rashidinejad Banghua Zhu Cong Ma Jiantao Jiao Stuart J. Russell OffRL 227 290 0 22 Mar 2021
Finding the Stochastic Shortest Path with Low Regret: The Adversarial Cost and Unknown Transition Case Liyu Chen Haipeng Luo 74 31 0 10 Feb 2021
Is Pessimism Provably Efficient for Offline RL? Ying Jin Zhuoran Yang Zhaoran Wang OffRL 176 359 0 30 Dec 2020
Near-Optimal Provable Uniform Convergence in Offline Policy Evaluation for Reinforcement Learning Ming Yin Yu Bai Yu Wang OffRL 82 31 0 07 Jul 2020
Near-optimal Regret Bounds for Stochastic Shortest Path Alon Cohen Haim Kaplan Yishay Mansour Aviv A. Rosenberg 64 55 0 23 Feb 2020
No-Regret Exploration in Goal-Oriented Reinforcement Learning Jean Tarbouriech Evrard Garcelon Michal Valko Matteo Pirotta A. Lazaric 77 46 0 07 Dec 2019
Solving Rubik's Cube with a Robot Hand OpenAI Ilge Akkaya Marcin Andrychowicz Maciek Chociej Ma-teusz Litwin ... Peter Welinder Lilian Weng Qiming Yuan Wojciech Zaremba Lei Zhang ODL 121 1,232 0 16 Oct 2019
Double Reinforcement Learning for Efficient Off-Policy Evaluation in Markov Decision Processes Nathan Kallus Masatoshi Uehara OffRL 98 187 0 22 Aug 2019
Off-Policy Policy Gradient with State Distribution Correction Yao Liu Adith Swaminathan Alekh Agarwal Emma Brunskill OffRL 157 67 0 17 Apr 2019
Tighter Problem-Dependent Regret Bounds in Reinforcement Learning without Domain Knowledge using Value Function Bounds Andrea Zanette Emma Brunskill OffRL 115 276 0 01 Jan 2019
Data-Efficient Off-Policy Policy Evaluation for Reinforcement Learning Philip S. Thomas Emma Brunskill OffRL 432 577 0 04 Apr 2016
Empirical Bernstein Bounds and Sample Variance Penalization Andreas Maurer Massimiliano Pontil 410 545 0 21 Jul 2009
The on-line shortest path problem under partial monitoring Pál Benkö T. Várady L. Andor Ralph Robert Martin 593 356 0 08 Apr 2007