ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2002.10301
  4. Cited By
Q-learning with Uniformly Bounded Variance: Large Discounting is Not a
  Barrier to Fast Learning
v1v2 (latest)

Q-learning with Uniformly Bounded Variance: Large Discounting is Not a Barrier to Fast Learning

IEEE Transactions on Automatic Control (TAC), 2020
24 February 2020
Adithya M. Devraj
Sean P. Meyn
ArXiv (abs)PDFHTML

Papers citing "Q-learning with Uniformly Bounded Variance: Large Discounting is Not a Barrier to Fast Learning"

11 / 11 papers shown
Deflated Dynamics Value Iteration
Deflated Dynamics Value Iteration
Jongmin Lee
Amin Rakhsha
Ernest K. Ryu
Amir-massoud Farahmand
322
3
0
15 Jul 2024
Regularized Q-Learning with Linear Function Approximation
Regularized Q-Learning with Linear Function ApproximationIEEE Transactions on Automatic Control (TAC), 2024
Jiachen Xi
Alfredo Garcia
P. Momcilovic
548
3
0
26 Jan 2024
Convex Q Learning in a Stochastic Environment: Extended Version
Convex Q Learning in a Stochastic Environment: Extended VersionIEEE Conference on Decision and Control (CDC), 2023
F. Lu
Sean P. Meyn
262
7
0
10 Sep 2023
Stability of Q-Learning Through Design and Optimism
Stability of Q-Learning Through Design and Optimism
Sean P. Meyn
305
11
0
05 Jul 2023
Efficiency Ordering of Stochastic Gradient Descent
Efficiency Ordering of Stochastic Gradient DescentNeural Information Processing Systems (NeurIPS), 2022
Jie Hu
Vishwaraj Doshi
Do Young Eun
248
8
0
15 Sep 2022
Examining average and discounted reward optimality criteria in
  reinforcement learning
Examining average and discounted reward optimality criteria in reinforcement learning
Vektor Dewanto
M. Gallagher
OffRL
284
24
0
03 Jul 2021
Is Q-Learning Minimax Optimal? A Tight Sample Complexity Analysis
Is Q-Learning Minimax Optimal? A Tight Sample Complexity AnalysisOperational Research (OR), 2021
Gen Li
Changxiao Cai
Ee
Yuting Wei
Yuejie Chi
OffRL
431
94
0
12 Feb 2021
The Mean-Squared Error of Double Q-Learning
The Mean-Squared Error of Double Q-LearningNeural Information Processing Systems (NeurIPS), 2020
Wentao Weng
Harsh Gupta
Niao He
Lei Ying
R. Srikant
296
19
0
09 Jul 2020
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
568
133
0
04 Jun 2020
Zap Q-Learning With Nonlinear Function Approximation
Zap Q-Learning With Nonlinear Function ApproximationNeural Information Processing Systems (NeurIPS), 2019
Shuhang Chen
Adithya M. Devraj
Fan Lu
Ana Bušić
Sean P. Meyn
252
24
0
11 Oct 2019
Differential Temporal Difference Learning
Differential Temporal Difference Learning
Adithya M. Devraj
Ioannis Kontoyiannis
Sean P. Meyn
156
8
0
28 Dec 2018
1
Page 1 of 1