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. 2402.08998
  4. Cited By
Nearly Minimax Optimal Regret for Learning Linear Mixture Stochastic
  Shortest Path

Nearly Minimax Optimal Regret for Learning Linear Mixture Stochastic Shortest Path

14 February 2024
Qiwei Di
Jiafan He
Dongruo Zhou
Quanquan Gu
ArXivPDFHTML

Papers citing "Nearly Minimax Optimal Regret for Learning Linear Mixture Stochastic Shortest Path"

3 / 3 papers shown
Title
Computationally Efficient Horizon-Free Reinforcement Learning for Linear
  Mixture MDPs
Computationally Efficient Horizon-Free Reinforcement Learning for Linear Mixture MDPs
Dongruo Zhou
Quanquan Gu
75
43
0
23 May 2022
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
32
15
0
04 May 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
65
36
0
29 Jan 2021
1