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. 2102.06548
  4. Cited By
Is Q-Learning Minimax Optimal? A Tight Sample Complexity Analysis

Is Q-Learning Minimax Optimal? A Tight Sample Complexity Analysis

12 February 2021
Gen Li
Changxiao Cai
Ee
Yuting Wei
Yuejie Chi
    OffRL
ArXivPDFHTML

Papers citing "Is Q-Learning Minimax Optimal? A Tight Sample Complexity Analysis"

3 / 53 papers shown
Title
Finite-Sample Analysis of Off-Policy Natural Actor-Critic with Linear
  Function Approximation
Finite-Sample Analysis of Off-Policy Natural Actor-Critic with Linear Function Approximation
Zaiwei Chen
S. Khodadadian
S. T. Maguluri
OffRL
41
29
0
26 May 2021
Sample Complexity of Asynchronous Q-Learning: Sharper Analysis and
  Variance Reduction
Sample Complexity of Asynchronous Q-Learning: Sharper Analysis and Variance Reduction
Gen Li
Yuting Wei
Yuejie Chi
Yuantao Gu
Yuxin Chen
OffRL
13
114
0
04 Jun 2020
A Finite Time Analysis of Two Time-Scale Actor Critic Methods
A Finite Time Analysis of Two Time-Scale Actor Critic Methods
Yue Wu
Weitong Zhang
Pan Xu
Quanquan Gu
88
145
0
04 May 2020
Previous
12