Near-optimal Regret Bounds for Stochastic Shortest Path

23 February 2020

Papers citing "Near-optimal Regret Bounds for Stochastic Shortest Path"

20 / 20 papers shown

Title
Layered State Discovery for Incremental Autonomous Exploration Liyu Chen Andrea Tirinzoni A. Lazaric Matteo Pirotta 34 0 0 07 Feb 2023
Online Reinforcement Learning with Uncertain Episode Lengths Debmalya Mandal Goran Radanović Jiarui Gan Adish Singla R. Majumdar OffRL 36 5 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
Multi-Agent Congestion Cost Minimization With Linear Function Approximations Prashant Trivedi N. Hemachandra 37 0 0 26 Jan 2023
Eluder-based Regret for Stochastic Contextual MDPs Orin Levy Asaf B. Cassel Alon Cohen Yishay Mansour 33 5 0 27 Nov 2022
A Unified Algorithm for Stochastic Path Problems Christoph Dann Chen-Yu Wei Julian Zimmert 35 0 0 17 Oct 2022
Multi-armed Bandit Learning on a Graph Tianpeng Zhang Kasper Johansson Na Li 33 6 0 20 Sep 2022
Convex duality for stochastic shortest path problems in known and unknown environments Kelli Francis-Staite 29 0 0 31 Jul 2022
Offline Stochastic Shortest Path: Learning, Evaluation and Towards Optimality Ming Yin Wenjing Chen Mengdi Wang Yu Wang OffRL 30 4 0 10 Jun 2022
Rate-Optimal Online Convex Optimization in Adaptive Linear Control Asaf B. Cassel Alon Cohen Google Research 34 9 0 03 Jun 2022
Reductive MDPs: A Perspective Beyond Temporal Horizons Thomas Spooner Rui Silva J. Lockhart Jason Long Vacslav Glukhov 26 0 0 15 May 2022
Policy Optimization for Stochastic Shortest Path Liyu Chen Haipeng Luo Aviv A. Rosenberg 19 12 0 07 Feb 2022
Learning Infinite-Horizon Average-Reward Markov Decision Processes with Constraints Liyu Chen R. Jain Haipeng Luo 57 25 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
Geometric Entropic Exploration Z. Guo M. G. Azar Alaa Saade S. Thakoor Bilal Piot Bernardo Avila-Pires Michal Valko Thomas Mesnard Tor Lattimore Rémi Munos 38 30 0 06 Jan 2021
Learning Adversarial Markov Decision Processes with Delayed Feedback Tal Lancewicki Aviv A. Rosenberg Yishay Mansour 38 32 0 29 Dec 2020
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
A Provably Efficient Sample Collection Strategy for Reinforcement Learning Jean Tarbouriech Matteo Pirotta Michal Valko A. Lazaric OffRL 25 16 0 13 Jul 2020
Adaptive Reward-Free Exploration E. Kaufmann Pierre Ménard O. D. Domingues Anders Jonsson Edouard Leurent Michal Valko 30 80 0 11 Jun 2020