English

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

Optimization and Control 2020-02-06 v1 Machine Learning

Abstract

We consider a general asynchronous Stochastic Approximation (SA) scheme featuring a weighted infinity-norm contractive operator, and prove a bound on its finite-time convergence rate on a single trajectory. Additionally, we specialize the result to asynchronous QQ-learning. The resulting bound matches the sharpest available bound for synchronous QQ-learning, and improves over previous known bounds for asynchronous QQ-learning.

Keywords

Cite

@article{arxiv.2002.00260,
  title  = {Finite-Time Analysis of Asynchronous Stochastic Approximation and $Q$-Learning},
  author = {Guannan Qu and Adam Wierman},
  journal= {arXiv preprint arXiv:2002.00260},
  year   = {2020}
}
R2 v1 2026-06-23T13:27:48.436Z