Communities
Connect sessions
AI calendar
Organizations
Join Slack
Contact Sales
Search
Open menu
Home
Papers
2012.04053
Cited By
v1
v2
v3 (latest)
Minimax Regret for Stochastic Shortest Path with Adversarial Costs and Known Transition
7 December 2020
Liyu Chen
Haipeng Luo
Chen-Yu Wei
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"Minimax Regret for Stochastic Shortest Path with Adversarial Costs and Known Transition"
26 / 26 papers shown
Stochastic Shortest Path with Sparse Adversarial Costs
Emmeran Johnson
Alberto Rumi
Ciara Pike-Burke
Patrick Rebeschini
AAML
140
0
0
01 Nov 2025
Adapting to Stochastic and Adversarial Losses in Episodic MDPs with Aggregate Bandit Feedback
Shinji Ito
Kevin Jamieson
Haipeng Luo
Arnab Maiti
Taira Tsuchiya
OffRL
232
2
0
20 Oct 2025
Online Resource Allocation in Episodic Markov Decision Processes
Duksang Lee
William Overman
Dabeen Lee
340
1
0
18 May 2023
Improved Regret Bounds for Linear Adversarial MDPs via Linear Optimization
Fang-yuan Kong
Xiangcheng Zhang
Baoxiang Wang
Shuai Li
270
14
0
14 Feb 2023
Multi-Agent Congestion Cost Minimization With Linear Function Approximations
International Conference on Artificial Intelligence and Statistics (AISTATS), 2023
Prashant Trivedi
N. Hemachandra
280
1
0
26 Jan 2023
A Unified Algorithm for Stochastic Path Problems
International Conference on Algorithmic Learning Theory (ALT), 2022
Christoph Dann
Chen-Yu Wei
Julian Zimmert
195
1
0
17 Oct 2022
Reaching Goals is Hard: Settling the Sample Complexity of the Stochastic Shortest Path
International Conference on Algorithmic Learning Theory (ALT), 2022
Liyu Chen
Andrea Tirinzoni
Matteo Pirotta
A. Lazaric
192
3
0
10 Oct 2022
Online Policy Optimization for Robust MDP
Jing Dong
Jingwei Li
Baoxiang Wang
J.N. Zhang
OffRL
368
19
0
28 Sep 2022
Dynamic Regret of Online Markov Decision Processes
International Conference on Machine Learning (ICML), 2022
Peng Zhao
Longfei Li
Zhi Zhou
OffRL
253
20
0
26 Aug 2022
Convex duality for stochastic shortest path problems in known and unknown environments
Kelli Francis-Staite
243
0
0
31 Jul 2022
Offline Stochastic Shortest Path: Learning, Evaluation and Towards Optimality
Conference on Uncertainty in Artificial Intelligence (UAI), 2022
Ming Yin
Wenjing Chen
Mengdi Wang
Yu Wang
OffRL
209
6
0
10 Jun 2022
Near-Optimal Goal-Oriented Reinforcement Learning in Non-Stationary Environments
Neural Information Processing Systems (NeurIPS), 2022
Liyu Chen
Haipeng Luo
305
9
0
25 May 2022
Let's Collaborate: Regret-based Reactive Synthesis for Robotic Manipulation
IEEE International Conference on Robotics and Automation (ICRA), 2022
Karan Muvvala
Peter Amorese
Morteza Lahijanian
191
14
0
14 Mar 2022
Policy Optimization for Stochastic Shortest Path
Annual Conference Computational Learning Theory (COLT), 2022
Liyu Chen
Haipeng Luo
Aviv A. Rosenberg
216
14
0
07 Feb 2022
Improved No-Regret Algorithms for Stochastic Shortest Path with Linear MDP
International Conference on Machine Learning (ICML), 2021
Liyu Chen
Rahul Jain
Haipeng Luo
202
16
0
18 Dec 2021
Learning Stochastic Shortest Path with Linear Function Approximation
International Conference on Machine Learning (ICML), 2021
Steffen Czolbe
Jiafan He
Adrian Dalca
Quanquan Gu
384
34
0
25 Oct 2021
Policy Optimization in Adversarial MDPs: Improved Exploration via Dilated Bonuses
Neural Information Processing Systems (NeurIPS), 2021
Haipeng Luo
Chen-Yu Wei
Chung-Wei Lee
275
52
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
280
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
246
18
0
09 Jun 2021
Stochastic Shortest Path: Minimax, Parameter-Free and Towards Horizon-Free Regret
Neural Information Processing Systems (NeurIPS), 2021
Jean Tarbouriech
Runlong Zhou
S. Du
Matteo Pirotta
M. Valko
A. Lazaric
260
38
0
22 Apr 2021
Minimax Regret for Stochastic Shortest Path
Neural Information Processing Systems (NeurIPS), 2021
Alon Cohen
Yonathan Efroni
Yishay Mansour
Aviv A. Rosenberg
391
31
0
24 Mar 2021
Non-stationary Reinforcement Learning without Prior Knowledge: An Optimal Black-box Approach
Annual Conference Computational Learning Theory (COLT), 2021
Chen-Yu Wei
Haipeng Luo
OffRL
499
125
0
10 Feb 2021
Finding the Stochastic Shortest Path with Low Regret: The Adversarial Cost and Unknown Transition Case
International Conference on Machine Learning (ICML), 2021
Liyu Chen
Haipeng Luo
381
32
0
10 Feb 2021
Impossible Tuning Made Possible: A New Expert Algorithm and Its Applications
Annual Conference Computational Learning Theory (COLT), 2021
Liyu Chen
Haipeng Luo
Chen-Yu Wei
400
57
0
01 Feb 2021
Learning Adversarial Markov Decision Processes with Delayed Feedback
AAAI Conference on Artificial Intelligence (AAAI), 2020
Tal Lancewicki
Aviv A. Rosenberg
Yishay Mansour
397
40
0
29 Dec 2020
Stochastic Shortest Path with Adversarially Changing Costs
Aviv A. Rosenberg
Yishay Mansour
AAML
427
34
0
20 Jun 2020
1
Page 1 of 1