v1v2 (latest)

Finding the Stochastic Shortest Path with Low Regret: The Adversarial Cost and Unknown Transition Case

International Conference on Machine Learning (ICML), 2021

10 February 2021

Liyu Chen

Haipeng Luo

ArXiv (abs)PDF HTML

Papers citing "Finding the Stochastic Shortest Path with Low Regret: The Adversarial Cost and Unknown Transition Case"

31 / 31 papers shown

Title
Stochastic Shortest Path with Sparse Adversarial Costs Emmeran Johnson Alberto Rumi Ciara Pike-Burke Patrick Rebeschini AAML 53 0 0 01 Nov 2025
An Optimistic Algorithm for online CMDPS with Anytime Adversarial Constraints Jiahui Zhu Kihyun Yu Dabeen Lee Xin Liu Honghao Wei 128 0 0 28 May 2025
Decision Making in Hybrid Environments: A Model Aggregation ApproachAnnual Conference Computational Learning Theory (COLT), 2025 Haolin Liu Chen-Yu Wei Julian Zimmert 391 0 0 09 Feb 2025
A Model Selection Approach for Corruption Robust Reinforcement LearningInternational Conference on Algorithmic Learning Theory (ALT), 2021 Chen-Yu Wei Christoph Dann Julian Zimmert 265 48 0 31 Dec 2024
Nearly Minimax Optimal Regret for Learning Linear Mixture Stochastic Shortest Path Qiwei Di Jiafan He Dongruo Zhou Quanquan Gu 126 2 0 14 Feb 2024
Corruption-Robust Offline Reinforcement Learning with General Function ApproximationNeural Information Processing Systems (NeurIPS), 2023 Chen Ye Rui Yang Quanquan Gu Tong Zhang OffRL 340 29 0 23 Oct 2023
Towards Optimal Regret in Adversarial Linear MDPs with Bandit FeedbackInternational Conference on Learning Representations (ICLR), 2023 Haolin Liu Chen-Yu Wei Julian Zimmert 217 8 0 17 Oct 2023
Online Resource Allocation in Episodic Markov Decision Processes Duksang Lee William Overman Dabeen Lee 218 1 0 18 May 2023
Delay-Adapted Policy Optimization and Improved Regret for Adversarial MDP with Delayed Bandit FeedbackInternational Conference on Machine Learning (ICML), 2023 Tal Lancewicki Aviv A. Rosenberg Dmitry Sotnikov 164 3 0 13 May 2023
Layered State Discovery for Incremental Autonomous ExplorationInternational Conference on Machine Learning (ICML), 2023 Liyu Chen Andrea Tirinzoni A. Lazaric Matteo Pirotta 140 0 0 07 Feb 2023
Multi-Agent Congestion Cost Minimization With Linear Function ApproximationsInternational Conference on Artificial Intelligence and Statistics (AISTATS), 2023 Prashant Trivedi N. Hemachandra 200 1 0 26 Jan 2023
Corruption-Robust Algorithms with Uncertainty Weighting for Nonlinear Contextual Bandits and Markov Decision ProcessesInternational Conference on Machine Learning (ICML), 2022 Chen Ye Wei Xiong Quanquan Gu Tong Zhang 420 37 0 12 Dec 2022
A Unified Algorithm for Stochastic Path ProblemsInternational Conference on Algorithmic Learning Theory (ALT), 2022 Christoph Dann Chen-Yu Wei Julian Zimmert 127 1 0 17 Oct 2022
Reaching Goals is Hard: Settling the Sample Complexity of the Stochastic Shortest PathInternational Conference on Algorithmic Learning Theory (ALT), 2022 Liyu Chen Andrea Tirinzoni Matteo Pirotta A. Lazaric 135 3 0 10 Oct 2022
Offline Stochastic Shortest Path: Learning, Evaluation and Towards OptimalityConference on Uncertainty in Artificial Intelligence (UAI), 2022 Ming Yin Wenjing Chen Mengdi Wang Yu Wang OffRL 129 6 0 10 Jun 2022
GraphWalks: Efficient Shape Agnostic Geodesic Shortest Path Estimation Rolandos Alexandros Potamias Alexandros Neofytou Kyriaki-Margarita Bintsi Stefanos Zafeiriou 165 14 0 30 May 2022
Near-Optimal Goal-Oriented Reinforcement Learning in Non-Stationary EnvironmentsNeural Information Processing Systems (NeurIPS), 2022 Liyu Chen Haipeng Luo 221 8 0 25 May 2022
Reductive MDPs: A Perspective Beyond Temporal Horizons Thomas Spooner Rui Silva J. Lockhart Jason Long Vacslav Glukhov 111 0 0 15 May 2022
Let's Collaborate: Regret-based Reactive Synthesis for Robotic ManipulationIEEE International Conference on Robotics and Automation (ICRA), 2022 Karan Muvvala Peter Amorese Morteza Lahijanian 135 13 0 14 Mar 2022
Policy Optimization for Stochastic Shortest PathAnnual Conference Computational Learning Theory (COLT), 2022 Liyu Chen Haipeng Luo Aviv A. Rosenberg 176 14 0 07 Feb 2022
Learning Infinite-Horizon Average-Reward Markov Decision Processes with ConstraintsInternational Conference on Machine Learning (ICML), 2022 Liyu Chen R. Jain Haipeng Luo 242 30 0 31 Jan 2022
Improved No-Regret Algorithms for Stochastic Shortest Path with Linear MDPInternational Conference on Machine Learning (ICML), 2021 Liyu Chen Rahul Jain Haipeng Luo 150 15 0 18 Dec 2021
Adaptive Multi-Goal Exploration Jean Tarbouriech O. D. Domingues Pierre Ménard Matteo Pirotta Michal Valko A. Lazaric 275 4 0 23 Nov 2021
Learning Stochastic Shortest Path with Linear Function ApproximationInternational Conference on Machine Learning (ICML), 2021 Steffen Czolbe Jiafan He Adrian Dalca Quanquan Gu 278 33 0 25 Oct 2021
Policy Optimization in Adversarial MDPs: Improved Exploration via Dilated BonusesNeural Information Processing Systems (NeurIPS), 2021 Haipeng Luo Chen-Yu Wei Chung-Wei Lee 214 48 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 211 26 0 15 Jun 2021
Online Learning for Stochastic Shortest Path Model via Posterior Sampling Mehdi Jafarnia-Jahromi Liyu Chen Rahul Jain Haipeng Luo OffRL 186 18 0 09 Jun 2021
Stochastic Shortest Path: Minimax, Parameter-Free and Towards Horizon-Free RegretNeural Information Processing Systems (NeurIPS), 2021 Jean Tarbouriech Runlong Zhou S. Du Matteo Pirotta M. Valko A. Lazaric 187 38 0 22 Apr 2021
Minimax Regret for Stochastic Shortest PathNeural Information Processing Systems (NeurIPS), 2021 Alon Cohen Yonathan Efroni Yishay Mansour Aviv A. Rosenberg 261 32 0 24 Mar 2021
Learning Adversarial Markov Decision Processes with Delayed FeedbackAAAI Conference on Artificial Intelligence (AAAI), 2020 Tal Lancewicki Aviv A. Rosenberg Yishay Mansour 300 36 0 29 Dec 2020
Minimax Regret for Stochastic Shortest Path with Adversarial Costs and Known Transition Liyu Chen Haipeng Luo Chen-Yu Wei 397 35 0 07 Dec 2020