Stochastic Shortest Path with Adversarially Changing Costs

20 June 2020

Papers citing "Stochastic Shortest Path with Adversarially Changing Costs"

11 / 11 papers shown

Title
MetaCURL: Non-stationary Concave Utility Reinforcement Learning B. Moreno Margaux Brégère Pierre Gaillard Nadia Oudjane OffRL 41 0 0 30 May 2024
Layered State Discovery for Incremental Autonomous Exploration Liyu Chen Andrea Tirinzoni A. Lazaric Matteo Pirotta 34 0 0 07 Feb 2023
Improved Regret for Efficient Online Reinforcement Learning with Linear Function Approximation Uri Sherman Tomer Koren Yishay Mansour 32 12 0 30 Jan 2023
Corruption-Robust Algorithms with Uncertainty Weighting for Nonlinear Contextual Bandits and Markov Decision Processes Chen Ye Wei Xiong Quanquan Gu Tong Zhang 31 29 0 12 Dec 2022
Dynamic Regret of Online Markov Decision Processes Peng Zhao Longfei Li Zhi-Hua Zhou OffRL 39 17 0 26 Aug 2022
Convex duality for stochastic shortest path problems in known and unknown environments Kelli Francis-Staite 29 0 0 31 Jul 2022
Policy Optimization for Stochastic Shortest Path Liyu Chen Haipeng Luo Aviv A. Rosenberg 19 12 0 07 Feb 2022
Near-Optimal Regret for Adversarial MDP with Delayed Bandit Feedback Tiancheng Jin Tal Lancewicki Haipeng Luo Yishay Mansour Aviv A. Rosenberg 74 21 0 31 Jan 2022
Learning Stochastic Shortest Path with Linear Function Approximation Steffen Czolbe Jiafan He Adrian Dalca Quanquan Gu 41 30 0 25 Oct 2021
Stochastic Shortest Path: Minimax, Parameter-Free and Towards Horizon-Free Regret Jean Tarbouriech Runlong Zhou S. Du Matteo Pirotta M. Valko A. Lazaric 59 35 0 22 Apr 2021
Minimax Regret for Stochastic Shortest Path with Adversarial Costs and Known Transition Liyu Chen Haipeng Luo Chen-Yu Wei 29 32 0 07 Dec 2020