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. 2205.11507
  4. Cited By
Computationally Efficient Horizon-Free Reinforcement Learning for Linear
  Mixture MDPs

Computationally Efficient Horizon-Free Reinforcement Learning for Linear Mixture MDPs

23 May 2022
Dongruo Zhou
Quanquan Gu
ArXivPDFHTML

Papers citing "Computationally Efficient Horizon-Free Reinforcement Learning for Linear Mixture MDPs"

4 / 4 papers shown
Title
Towards Optimal Differentially Private Regret Bounds in Linear MDPs
Towards Optimal Differentially Private Regret Bounds in Linear MDPs
Sharan Sahu
40
0
0
12 Apr 2025
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
56
37
0
13 May 2022
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
41
30
0
29 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
100
128
0
09 Dec 2019
1