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. 2002.00260
  4. Cited By
Finite-Time Analysis of Asynchronous Stochastic Approximation and
  $Q$-Learning

Finite-Time Analysis of Asynchronous Stochastic Approximation and QQQ-Learning

1 February 2020
Guannan Qu
Adam Wierman
ArXivPDFHTML

Papers citing "Finite-Time Analysis of Asynchronous Stochastic Approximation and $Q$-Learning"

14 / 14 papers shown
Title
A Concentration Bound for TD(0) with Function Approximation
A Concentration Bound for TD(0) with Function Approximation
Siddharth Chandak
Vivek Borkar
61
1
0
16 Dec 2023
Settling the Sample Complexity of Online Reinforcement Learning
Settling the Sample Complexity of Online Reinforcement Learning
Zihan Zhang
Yuxin Chen
Jason D. Lee
S. Du
OffRL
123
22
0
25 Jul 2023
Finite-Time Analysis and Restarting Scheme for Linear Two-Time-Scale
  Stochastic Approximation
Finite-Time Analysis and Restarting Scheme for Linear Two-Time-Scale Stochastic Approximation
Thinh T. Doan
36
36
0
23 Dec 2019
A Unified Switching System Perspective and O.D.E. Analysis of Q-Learning
  Algorithms
A Unified Switching System Perspective and O.D.E. Analysis of Q-Learning Algorithms
Dong-hwan Lee
Niao He
44
28
0
04 Dec 2019
Model-free Reinforcement Learning in Infinite-horizon Average-reward
  Markov Decision Processes
Model-free Reinforcement Learning in Infinite-horizon Average-reward Markov Decision Processes
Chen-Yu Wei
Mehdi Jafarnia-Jahromi
Haipeng Luo
Hiteshi Sharma
R. Jain
117
104
0
15 Oct 2019
Two Time-scale Off-Policy TD Learning: Non-asymptotic Analysis over
  Markovian Samples
Two Time-scale Off-Policy TD Learning: Non-asymptotic Analysis over Markovian Samples
Tengyu Xu
Shaofeng Zou
Yingbin Liang
44
73
0
26 Sep 2019
Finite-Time Performance Bounds and Adaptive Learning Rate Selection for
  Two Time-Scale Reinforcement Learning
Finite-Time Performance Bounds and Adaptive Learning Rate Selection for Two Time-Scale Reinforcement Learning
Harsh Gupta
R. Srikant
Lei Ying
41
85
0
14 Jul 2019
Variance-reduced $Q$-learning is minimax optimal
Variance-reduced QQQ-learning is minimax optimal
Martin J. Wainwright
OffRL
40
90
0
11 Jun 2019
Stochastic approximation with cone-contractive operators: Sharp
  $\ell_\infty$-bounds for $Q$-learning
Stochastic approximation with cone-contractive operators: Sharp ℓ∞\ell_\inftyℓ∞​-bounds for QQQ-learning
Martin J. Wainwright
31
105
0
15 May 2019
Finite-Time Error Bounds For Linear Stochastic Approximation and TD
  Learning
Finite-Time Error Bounds For Linear Stochastic Approximation and TD Learning
R. Srikant
Lei Ying
52
249
0
03 Feb 2019
Q-learning with UCB Exploration is Sample Efficient for Infinite-Horizon
  MDP
Q-learning with UCB Exploration is Sample Efficient for Infinite-Horizon MDP
Kefan Dong
Yuanhao Wang
Xiaoyu Chen
Liwei Wang
OffRL
34
95
0
27 Jan 2019
Is Q-learning Provably Efficient?
Is Q-learning Provably Efficient?
Chi Jin
Zeyuan Allen-Zhu
Sébastien Bubeck
Michael I. Jordan
OffRL
44
801
0
10 Jul 2018
Q-learning with Nearest Neighbors
Q-learning with Nearest Neighbors
Devavrat Shah
Qiaomin Xie
OffRL
45
78
0
12 Feb 2018
Variance Reduced Value Iteration and Faster Algorithms for Solving
  Markov Decision Processes
Variance Reduced Value Iteration and Faster Algorithms for Solving Markov Decision Processes
Aaron Sidford
Mengdi Wang
X. Wu
Yinyu Ye
31
125
0
27 Oct 2017
1