ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2104.11186
  4. Cited By
Stochastic Shortest Path: Minimax, Parameter-Free and Towards
  Horizon-Free Regret

Stochastic Shortest Path: Minimax, Parameter-Free and Towards Horizon-Free Regret

22 April 2021
Jean Tarbouriech
Runlong Zhou
S. Du
Matteo Pirotta
M. Valko
A. Lazaric
ArXivPDFHTML

Papers citing "Stochastic Shortest Path: Minimax, Parameter-Free and Towards Horizon-Free Regret"

11 / 11 papers shown
Title
Settling the Sample Complexity of Online Reinforcement Learning
Settling the Sample Complexity of Online Reinforcement Learning
Zihan Zhang
Yuxin Chen
Jason D. Lee
S. Du
OffRL
95
21
0
25 Jul 2023
Layered State Discovery for Incremental Autonomous Exploration
Layered State Discovery for Incremental Autonomous Exploration
Liyu Chen
Andrea Tirinzoni
A. Lazaric
Matteo Pirotta
34
0
0
07 Feb 2023
Sharp Variance-Dependent Bounds in Reinforcement Learning: Best of Both
  Worlds in Stochastic and Deterministic Environments
Sharp Variance-Dependent Bounds in Reinforcement Learning: Best of Both Worlds in Stochastic and Deterministic Environments
Runlong Zhou
Zihan Zhang
S. Du
44
10
0
31 Jan 2023
Multi-Agent Congestion Cost Minimization With Linear Function
  Approximations
Multi-Agent Congestion Cost Minimization With Linear Function Approximations
Prashant Trivedi
N. Hemachandra
35
0
0
26 Jan 2023
Convex duality for stochastic shortest path problems in known and
  unknown environments
Convex duality for stochastic shortest path problems in known and unknown environments
Kelli Francis-Staite
19
0
0
31 Jul 2022
Offline Stochastic Shortest Path: Learning, Evaluation and Towards
  Optimality
Offline Stochastic Shortest Path: Learning, Evaluation and Towards Optimality
Ming Yin
Wenjing Chen
Mengdi Wang
Yu-Xiang Wang
OffRL
30
4
0
10 Jun 2022
Horizon-Free Reinforcement Learning in Polynomial Time: the Power of
  Stationary Policies
Horizon-Free Reinforcement Learning in Polynomial Time: the Power of Stationary Policies
Zihan Zhang
Xiangyang Ji
S. Du
28
21
0
24 Mar 2022
Policy Optimization for Stochastic Shortest Path
Policy Optimization for Stochastic Shortest Path
Liyu Chen
Haipeng Luo
Aviv A. Rosenberg
19
12
0
07 Feb 2022
Learning Stochastic Shortest Path with Linear Function Approximation
Learning Stochastic Shortest Path with Linear Function Approximation
Steffen Czolbe
Jiafan He
Adrian V. Dalca
Quanquan Gu
39
30
0
25 Oct 2021
UCB Momentum Q-learning: Correcting the bias without forgetting
UCB Momentum Q-learning: Correcting the bias without forgetting
Pierre Menard
O. D. Domingues
Xuedong Shang
Michal Valko
79
40
0
01 Mar 2021
Model-free Reinforcement Learning in Infinite-horizon Average-reward
  Markov Decision Processes
Model-free Reinforcement Learning in Infinite-horizon Average-reward Markov Decision Processes
Chen-Yu Wei
Mehdi Jafarnia-Jahromi
Haipeng Luo
Hiteshi Sharma
R. Jain
107
99
0
15 Oct 2019
1