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. 2110.12727
  4. Cited By
Learning Stochastic Shortest Path with Linear Function Approximation

Learning Stochastic Shortest Path with Linear Function Approximation

25 October 2021
Steffen Czolbe
Jiafan He
Adrian V. Dalca
Quanquan Gu
ArXivPDFHTML

Papers citing "Learning Stochastic Shortest Path with Linear Function Approximation"

27 / 27 papers shown
Title
Bayesian Graph Traversal
William N. Caballero
Phillip R. Jenkins
David Banks
Matthew Robbins
41
0
0
07 Mar 2025
Nearly Minimax Optimal Regret for Learning Linear Mixture Stochastic
  Shortest Path
Nearly Minimax Optimal Regret for Learning Linear Mixture Stochastic Shortest Path
Qiwei Di
Jiafan He
Dongruo Zhou
Quanquan Gu
25
2
0
14 Feb 2024
Learning Adversarial Low-rank Markov Decision Processes with Unknown
  Transition and Full-information Feedback
Learning Adversarial Low-rank Markov Decision Processes with Unknown Transition and Full-information Feedback
Canzhe Zhao
Ruofeng Yang
Baoxiang Wang
Xuezhou Zhang
Shuai Li
17
2
0
14 Nov 2023
Pure Exploration in Asynchronous Federated Bandits
Pure Exploration in Asynchronous Federated Bandits
Zichen Wang
Chuanhao Li
Chenyu Song
Lianghui Wang
Quanquan Gu
Huazheng Wang
FedML
19
0
0
17 Oct 2023
Delay-Adapted Policy Optimization and Improved Regret for Adversarial
  MDP with Delayed Bandit Feedback
Delay-Adapted Policy Optimization and Improved Regret for Adversarial MDP with Delayed Bandit Feedback
Tal Lancewicki
Aviv A. Rosenberg
Dmitry Sotnikov
13
3
0
13 May 2023
Cooperative Multi-Agent Reinforcement Learning: Asynchronous
  Communication and Linear Function Approximation
Cooperative Multi-Agent Reinforcement Learning: Asynchronous Communication and Linear Function Approximation
Yifei Min
Jiafan He
Tianhao Wang
Quanquan Gu
27
7
0
10 May 2023
Finding Regularized Competitive Equilibria of Heterogeneous Agent
  Macroeconomic Models with Reinforcement Learning
Finding Regularized Competitive Equilibria of Heterogeneous Agent Macroeconomic Models with Reinforcement Learning
Ruitu Xu
Yifei Min
Tianhao Wang
Zhaoran Wang
Michael I. Jordan
Zhuoran Yang
17
6
0
24 Feb 2023
Multi-Agent Congestion Cost Minimization With Linear Function
  Approximations
Multi-Agent Congestion Cost Minimization With Linear Function Approximations
Prashant Trivedi
N. Hemachandra
16
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
25
0
0
17 Oct 2022
Reaching Goals is Hard: Settling the Sample Complexity of the Stochastic
  Shortest Path
Reaching Goals is Hard: Settling the Sample Complexity of the Stochastic Shortest Path
Liyu Chen
Andrea Tirinzoni
Matteo Pirotta
A. Lazaric
24
3
0
10 Oct 2022
Age of Semantics in Cooperative Communications: To Expedite Simulation
  Towards Real via Offline Reinforcement Learning
Age of Semantics in Cooperative Communications: To Expedite Simulation Towards Real via Offline Reinforcement Learning
Xianfu Chen
Zhifeng Zhao
S. Mao
Celimuge Wu
Honggang Zhang
M. Bennis
OffRL
10
3
0
19 Sep 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
19
4
0
10 Jun 2022
Pessimism in the Face of Confounders: Provably Efficient Offline
  Reinforcement Learning in Partially Observable Markov Decision Processes
Pessimism in the Face of Confounders: Provably Efficient Offline Reinforcement Learning in Partially Observable Markov Decision Processes
Miao Lu
Yifei Min
Zhaoran Wang
Zhuoran Yang
OffRL
38
22
0
26 May 2022
Near-Optimal Goal-Oriented Reinforcement Learning in Non-Stationary
  Environments
Near-Optimal Goal-Oriented Reinforcement Learning in Non-Stationary Environments
Liyu Chen
Haipeng Luo
25
8
0
25 May 2022
Nearly Optimal Algorithms for Linear Contextual Bandits with Adversarial
  Corruptions
Nearly Optimal Algorithms for Linear Contextual Bandits with Adversarial Corruptions
Jiafan He
Dongruo Zhou
Tong Zhang
Quanquan Gu
61
46
0
13 May 2022
Learn to Match with No Regret: Reinforcement Learning in Markov Matching
  Markets
Learn to Match with No Regret: Reinforcement Learning in Markov Matching Markets
Yifei Min
Tianhao Wang
Ruitu Xu
Zhaoran Wang
Michael I. Jordan
Zhuoran Yang
16
21
0
07 Mar 2022
Cascaded Gaps: Towards Gap-Dependent Regret for Risk-Sensitive
  Reinforcement Learning
Cascaded Gaps: Towards Gap-Dependent Regret for Risk-Sensitive Reinforcement Learning
Yingjie Fei
Ruitu Xu
19
5
0
07 Mar 2022
Policy Optimization for Stochastic Shortest Path
Policy Optimization for Stochastic Shortest Path
Liyu Chen
Haipeng Luo
Aviv A. Rosenberg
13
12
0
07 Feb 2022
Improved No-Regret Algorithms for Stochastic Shortest Path with Linear
  MDP
Improved No-Regret Algorithms for Stochastic Shortest Path with Linear MDP
Liyu Chen
Rahul Jain
Haipeng Luo
20
14
0
18 Dec 2021
Adaptive Multi-Goal Exploration
Adaptive Multi-Goal Exploration
Jean Tarbouriech
O. D. Domingues
Pierre Ménard
Matteo Pirotta
Michal Valko
A. Lazaric
8
2
0
23 Nov 2021
Exponential Bellman Equation and Improved Regret Bounds for
  Risk-Sensitive Reinforcement Learning
Exponential Bellman Equation and Improved Regret Bounds for Risk-Sensitive Reinforcement Learning
Yingjie Fei
Zhuoran Yang
Yudong Chen
Zhaoran Wang
21
46
0
06 Nov 2021
Variance-Aware Off-Policy Evaluation with Linear Function Approximation
Variance-Aware Off-Policy Evaluation with Linear Function Approximation
Yifei Min
Tianhao Wang
Dongruo Zhou
Quanquan Gu
OffRL
19
38
0
22 Jun 2021
Regret Bounds for Stochastic Shortest Path Problems with Linear Function
  Approximation
Regret Bounds for Stochastic Shortest Path Problems with Linear Function Approximation
Daniel Vial
Advait Parulekar
Sanjay Shakkottai
R. Srikant
21
15
0
04 May 2021
Near-optimal Policy Optimization Algorithms for Learning Adversarial
  Linear Mixture MDPs
Near-optimal Policy Optimization Algorithms for Learning Adversarial Linear Mixture MDPs
Jiafan He
Dongruo Zhou
Quanquan Gu
88
23
0
17 Feb 2021
Improved Variance-Aware Confidence Sets for Linear Bandits and Linear
  Mixture MDP
Improved Variance-Aware Confidence Sets for Linear Bandits and Linear Mixture MDP
Zihan Zhang
Jiaqi Yang
Xiangyang Ji
S. Du
54
36
0
29 Jan 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
107
166
0
06 Jan 2021
Optimism in Reinforcement Learning with Generalized Linear Function
  Approximation
Optimism in Reinforcement Learning with Generalized Linear Function Approximation
Yining Wang
Ruosong Wang
S. Du
A. Krishnamurthy
127
135
0
09 Dec 2019
1