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

preprint2020arXivOpen access

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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.