Communities
Connect sessions
AI calendar
Organizations
Join Slack
Contact Sales
Search
Open menu
Home
Papers
2112.09859
Cited By
Improved No-Regret Algorithms for Stochastic Shortest Path with Linear MDP
International Conference on Machine Learning (ICML), 2021
18 December 2021
Liyu Chen
Rahul Jain
Haipeng Luo
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"Improved No-Regret Algorithms for Stochastic Shortest Path with Linear MDP"
17 / 17 papers shown
Stochastic Shortest Path with Sparse Adversarial Costs
Emmeran Johnson
Alberto Rumi
Ciara Pike-Burke
Patrick Rebeschini
AAML
97
0
0
01 Nov 2025
A Model Selection Approach for Corruption Robust Reinforcement Learning
International Conference on Algorithmic Learning Theory (ALT), 2021
Chen-Yu Wei
Christoph Dann
Julian Zimmert
289
48
0
31 Dec 2024
Sample Efficient Myopic Exploration Through Multitask Reinforcement Learning with Diverse Tasks
Ziping Xu
Zifan Xu
Runxuan Jiang
Peter Stone
Ambuj Tewari
336
2
0
03 Mar 2024
Nearly Minimax Optimal Regret for Learning Linear Mixture Stochastic Shortest Path
Qiwei Di
Jiafan He
Dongruo Zhou
Quanquan Gu
180
2
0
14 Feb 2024
Convergence of SARSA with linear function approximation: The random horizon case
Lina Palmborg
210
0
0
07 Jun 2023
Horizon-free Reinforcement Learning in Adversarial Linear Mixture MDPs
International Conference on Learning Representations (ICLR), 2023
Kaixuan Ji
Qingyue Zhao
Jiafan He
Weitong Zhang
Q. Gu
243
4
0
15 May 2023
Delay-Adapted Policy Optimization and Improved Regret for Adversarial MDP with Delayed Bandit Feedback
International Conference on Machine Learning (ICML), 2023
Tal Lancewicki
Aviv A. Rosenberg
Dmitry Sotnikov
181
3
0
13 May 2023
Layered State Discovery for Incremental Autonomous Exploration
International Conference on Machine Learning (ICML), 2023
Liyu Chen
Andrea Tirinzoni
A. Lazaric
Matteo Pirotta
160
0
0
07 Feb 2023
A Unified Algorithm for Stochastic Path Problems
International Conference on Algorithmic Learning Theory (ALT), 2022
Christoph Dann
Chen-Yu Wei
Julian Zimmert
159
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
155
3
0
10 Oct 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
161
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
269
8
0
25 May 2022
Horizon-Free Reinforcement Learning in Polynomial Time: the Power of Stationary Policies
Annual Conference Computational Learning Theory (COLT), 2022
Zihan Zhang
Xiangyang Ji
S. Du
261
28
0
24 Mar 2022
Policy Optimization for Stochastic Shortest Path
Annual Conference Computational Learning Theory (COLT), 2022
Liyu Chen
Haipeng Luo
Aviv A. Rosenberg
188
14
0
07 Feb 2022
Learning Infinite-Horizon Average-Reward Markov Decision Processes with Constraints
International Conference on Machine Learning (ICML), 2022
Liyu Chen
R. Jain
Haipeng Luo
258
30
0
31 Jan 2022
Learning Stochastic Shortest Path with Linear Function Approximation
International Conference on Machine Learning (ICML), 2021
Steffen Czolbe
Jiafan He
Adrian Dalca
Quanquan Gu
350
34
0
25 Oct 2021
Regret Bounds for Stochastic Shortest Path Problems with Linear Function Approximation
International Conference on Machine Learning (ICML), 2021
Daniel Vial
Advait Parulekar
Sanjay Shakkottai
R. Srikant
315
17
0
04 May 2021
1
