Published February 1, 2020
| Accepted Version
Discussion Paper
Open
Finite-Time Analysis of Asynchronous Stochastic Approximation and Q-Learning
- Creators
- Qu, Guannan
- Wierman, Adam
Chicago
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
Additional Information
© 2020 G. Qu & A. Wierman. to appear in Proceedings of Machine Learning Research.Attached Files
Accepted Version - 2002.00260.pdf
Files
2002.00260.pdf
Files
(309.1 kB)
Name | Size | Download all |
---|---|---|
md5:83e202a15637f0b3214bd4a1ba45c3e1
|
309.1 kB | Preview Download |
Additional details
- Eprint ID
- 101300
- Resolver ID
- CaltechAUTHORS:20200214-105555380
- Created
-
2020-02-14Created from EPrint's datestamp field
- Updated
-
2023-06-02Created from EPrint's last_modified field