Minimax Regret for Stochastic Shortest Path with Adversarial Costs and Known Transition

7 December 2020

Papers citing "Minimax Regret for Stochastic Shortest Path with Adversarial Costs and Known Transition"

27 / 27 papers shown

Title
Nearly Minimax Optimal Regret for Learning Linear Mixture Stochastic Shortest Path Qiwei Di Jiafan He Dongruo Zhou Quanquan Gu 25 2 0 14 Feb 2024
Learning Adversarial Low-rank Markov Decision Processes with Unknown Transition and Full-information Feedback Canzhe Zhao Ruofeng Yang Baoxiang Wang Xuezhou Zhang Shuai Li 22 2 0 14 Nov 2023
Online Resource Allocation in Episodic Markov Decision Processes Duksang Lee William Overman Dabeen Lee 35 1 0 18 May 2023
Delay-Adapted Policy Optimization and Improved Regret for Adversarial MDP with Delayed Bandit Feedback Tal Lancewicki Aviv A. Rosenberg Dmitry Sotnikov 24 3 0 13 May 2023
Improved Regret Bounds for Linear Adversarial MDPs via Linear Optimization Fang-yuan Kong Xiangcheng Zhang Baoxiang Wang Shuai Li 13 12 0 14 Feb 2023
Multi-Agent Congestion Cost Minimization With Linear Function Approximations Prashant Trivedi N. Hemachandra 27 0 0 26 Jan 2023
A Unified Algorithm for Stochastic Path Problems Christoph Dann Chen-Yu Wei Julian Zimmert 33 0 0 17 Oct 2022
Reaching Goals is Hard: Settling the Sample Complexity of the Stochastic Shortest Path Liyu Chen Andrea Tirinzoni Matteo Pirotta A. Lazaric 29 3 0 10 Oct 2022
Online Policy Optimization for Robust MDP Jing Dong Jingwei Li Baoxiang Wang J. Zhang OffRL 26 12 0 28 Sep 2022
Dynamic Regret of Online Markov Decision Processes Peng Zhao Longfei Li Zhi-Hua Zhou OffRL 22 17 0 26 Aug 2022
Convex duality for stochastic shortest path problems in known and unknown environments Kelli Francis-Staite 19 0 0 31 Jul 2022
Offline Stochastic Shortest Path: Learning, Evaluation and Towards Optimality Ming Yin Wenjing Chen Mengdi Wang Yu-Xiang Wang OffRL 25 4 0 10 Jun 2022
Near-Optimal Goal-Oriented Reinforcement Learning in Non-Stationary Environments Liyu Chen Haipeng Luo 33 8 0 25 May 2022
Let's Collaborate: Regret-based Reactive Synthesis for Robotic Manipulation Karan Muvvala Peter Amorese Morteza Lahijanian 16 12 0 14 Mar 2022
Policy Optimization for Stochastic Shortest Path Liyu Chen Haipeng Luo Aviv A. Rosenberg 19 12 0 07 Feb 2022
Improved No-Regret Algorithms for Stochastic Shortest Path with Linear MDP Liyu Chen Rahul Jain Haipeng Luo 33 14 0 18 Dec 2021
Learning Stochastic Shortest Path with Linear Function Approximation Steffen Czolbe Jiafan He Adrian V. Dalca Quanquan Gu 31 30 0 25 Oct 2021
Policy Optimization in Adversarial MDPs: Improved Exploration via Dilated Bonuses Haipeng Luo Chen-Yu Wei Chung-Wei Lee 32 44 0 18 Jul 2021
Implicit Finite-Horizon Approximation and Efficient Optimal Algorithms for Stochastic Shortest Path Liyu Chen Mehdi Jafarnia-Jahromi R. Jain Haipeng Luo 11 25 0 15 Jun 2021
Online Learning for Stochastic Shortest Path Model via Posterior Sampling Mehdi Jafarnia-Jahromi Liyu Chen Rahul Jain Haipeng Luo OffRL 66 18 0 09 Jun 2021
Stochastic Shortest Path: Minimax, Parameter-Free and Towards Horizon-Free Regret Jean Tarbouriech Runlong Zhou S. Du Matteo Pirotta M. Valko A. Lazaric 49 35 0 22 Apr 2021
Minimax Regret for Stochastic Shortest Path Alon Cohen Yonathan Efroni Yishay Mansour Aviv A. Rosenberg 18 28 0 24 Mar 2021
Non-stationary Reinforcement Learning without Prior Knowledge: An Optimal Black-box Approach Chen-Yu Wei Haipeng Luo OffRL 16 101 0 10 Feb 2021
Finding the Stochastic Shortest Path with Low Regret: The Adversarial Cost and Unknown Transition Case Liyu Chen Haipeng Luo 14 30 0 10 Feb 2021
Impossible Tuning Made Possible: A New Expert Algorithm and Its Applications Liyu Chen Haipeng Luo Chen-Yu Wei 22 41 0 01 Feb 2021
Learning Adversarial Markov Decision Processes with Delayed Feedback Tal Lancewicki Aviv A. Rosenberg Yishay Mansour 22 32 0 29 Dec 2020
Stochastic Shortest Path with Adversarially Changing Costs Aviv A. Rosenberg Yishay Mansour AAML 16 33 0 20 Jun 2020