Q-learning algorithms with random truncation bounds and applications to effective parallel computing
From MaRDI portal
Publication:946195
DOI10.1007/s10957-007-9331-9zbMath1328.68178OpenAlexW2138267312MaRDI QIDQ946195
L. Y. Wang, G. George Yin, Cheng-Zhong Xu
Publication date: 22 September 2008
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-007-9331-9
Nonnumerical algorithms (68W05) Learning and adaptive systems in artificial intelligence (68T05) Parallel algorithms in computer science (68W10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Asynchronous stochastic approximation and Q-learning
- \({\mathcal Q}\)-learning
- Stochastic approximation and its applications
- On W.P.1 Convergence of A Parallel Stochastic Approximation Algorithm
- Asymptotic Properties of Distributed and Communicating Stochastic Approximation Algorithms
- Stochastic approximation algorithms for parallel and distributed processing
- Asymptotic properties of sign algorithms for adaptive filtering