Q-learning algorithms with random truncation bounds and applications to effective parallel computing
From MaRDI portal
Recommendations
- Asynchronous stochastic approximation and Q-learning
- A stochastic approximation method with max-norm projections and its applications to the Q-learning algorithm
- Boundedness of iterates in \(Q\)-learning
- Exploiting the structural properties of the underlying Markov decision problem in the Q-learning algorithm
- New algorithms of the Q-learning type
Cites work
- scientific article; zbMATH DE number 1972910 (Why is no real title available?)
- scientific article; zbMATH DE number 3992716 (Why is no real title available?)
- scientific article; zbMATH DE number 967422 (Why is no real title available?)
- Asymptotic Properties of Distributed and Communicating Stochastic Approximation Algorithms
- Asymptotic properties of sign algorithms for adaptive filtering
- Asynchronous stochastic approximation and Q-learning
- On W.P.1 Convergence of A Parallel Stochastic Approximation Algorithm
- Stochastic approximation algorithms for parallel and distributed processing
- Stochastic approximation and its applications
- Stochastic approximation: Theory and applications
- \({\mathcal Q}\)-learning
Cited in
(4)
This page was built for publication: Q-learning algorithms with random truncation bounds and applications to effective parallel computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q946195)