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. 2103.13056
  4. Cited By
Minimax Regret for Stochastic Shortest Path

Minimax Regret for Stochastic Shortest Path

24 March 2021
Alon Cohen
Yonathan Efroni
Yishay Mansour
Aviv A. Rosenberg
ArXivPDFHTML

Papers citing "Minimax Regret for Stochastic Shortest Path"

12 / 12 papers shown
Title
MetaCURL: Non-stationary Concave Utility Reinforcement Learning
MetaCURL: Non-stationary Concave Utility Reinforcement Learning
B. Moreno
Margaux Brégère
Pierre Gaillard
Nadia Oudjane
OffRL
39
0
0
30 May 2024
Online Reinforcement Learning with Uncertain Episode Lengths
Online Reinforcement Learning with Uncertain Episode Lengths
Debmalya Mandal
Goran Radanović
Jiarui Gan
Adish Singla
R. Majumdar
OffRL
36
5
0
07 Feb 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
A Unified Algorithm for Stochastic Path Problems
A Unified Algorithm for Stochastic Path Problems
Christoph Dann
Chen-Yu Wei
Julian Zimmert
35
0
0
17 Oct 2022
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
26
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
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 Infinite-Horizon Average-Reward Markov Decision Processes with
  Constraints
Learning Infinite-Horizon Average-Reward Markov Decision Processes with Constraints
Liyu Chen
R. Jain
Haipeng Luo
57
25
0
31 Jan 2022
Near-Optimal Regret for Adversarial MDP with Delayed Bandit Feedback
Near-Optimal Regret for Adversarial MDP with Delayed Bandit Feedback
Tiancheng Jin
Tal Lancewicki
Haipeng Luo
Yishay Mansour
Aviv A. Rosenberg
74
21
0
31 Jan 2022
Learning Stochastic Shortest Path with Linear Function Approximation
Learning Stochastic Shortest Path with Linear Function Approximation
Steffen Czolbe
Jiafan He
Adrian Dalca
Quanquan Gu
39
30
0
25 Oct 2021
Stochastic Shortest Path: Minimax, Parameter-Free and Towards
  Horizon-Free Regret
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
Provably Efficient Reinforcement Learning with Linear Function
  Approximation Under Adaptivity Constraints
Provably Efficient Reinforcement Learning with Linear Function Approximation Under Adaptivity Constraints
Chi Jin
Zhuoran Yang
Zhaoran Wang
OffRL
122
166
0
06 Jan 2021
1