On W.P.1 Convergence of A Parallel Stochastic Approximation Algorithm
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 440437
- scientific article; zbMATH DE number 4036974
- Stochastic approximation algorithms for parallel and distributed processing
- Parallel and bootstrapped stochastic approximation
- Optimal quasi-convex combinations for stochastic approximation algorithms with parallel observers
Cites work
- Asymptotic Properties of Distributed and Communicating Stochastic Approximation Algorithms
- Distributed asynchronous deterministic and stochastic gradient optimization algorithms
- Stochastic approximation algorithms for parallel and distributed processing
- Stochastic approximation methods for constrained and unconstrained systems
Cited in
(10)- On robustness of the Robbins-Monro method for parallel processing
- A stopping rule for the Robbins-Monro method
- Joint robustness on noise and Lyapunov functions for parallel stochastic approximation algorithms
- scientific article; zbMATH DE number 440437 (Why is no real title available?)
- Stochastic approximation algorithms for parallel and distributed processing
- Parallel and bootstrapped stochastic approximation
- Optimal quasi-convex combinations for stochastic approximation algorithms with parallel observers
- A class of parallel doubly stochastic algorithms for large-scale learning
- On the rates of convergence of parallelized averaged stochastic gradient algorithms
- Q-learning algorithms with random truncation bounds and applications to effective parallel computing
This page was built for publication: On W.P.1 Convergence of A Parallel Stochastic Approximation Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3415913)
