On robustness of the Robbins-Monro method for parallel processing
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4157849
- Joint robustness on noise and Lyapunov functions for parallel stochastic approximation algorithms
- scientific article; zbMATH DE number 440437
- Improved results on the robustness of stochastic approximation algorithms
- Robustness analysis for stochastic approximation algorithms
Cites work
- Asymptotic Properties of Distributed and Communicating Stochastic Approximation Algorithms
- Convergence and robustness of the Robbins-Monro algorithm truncated at randomly varying bounds
- Distributed asynchronous deterministic and stochastic gradient optimization algorithms
- scientific article; zbMATH DE number 3992716 (Why is no real title available?)
- Necessary and sufficient conditions for the Robbins-Monro method
- On W.P.1 Convergence of A Parallel Stochastic Approximation Algorithm
- Stochastic approximation algorithms for parallel and distributed processing
Cited in
(3)
This page was built for publication: On robustness of the Robbins-Monro method for parallel processing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1123520)