Asymptotic Properties of Distributed and Communicating Stochastic Approximation Algorithms
From MaRDI portal
Recommendations
- Asymptotic behavior of asynchronous stochastic approximation
- scientific article; zbMATH DE number 440437
- Distributed asynchronous deterministic and stochastic gradient optimization algorithms
- Stochastic approximation algorithms for parallel and distributed processing
- Asymptotic properties of stochastic approximation procedures in the case of correlated noise
Cited in
(32)- On robustness of the Robbins-Monro method for parallel processing
- About Gaussian schemes in stochastic approximation
- Using stochastic optimization to determine threshold values for the control of unreliable manufacturing systems
- Distributed time synchronization for networks with random delays and measurement noise
- Asymptotic properties of consensus-type algorithms for networked systems with regime-switching topologies
- Random asynchronous iterations in distributed coordination algorithms
- Block trading: building up a stock position under a regime switching model
- Asynchronous stochastic approximation algorithms for networked systems: regime-switching topologies and multiscale structure
- scientific article; zbMATH DE number 440437 (Why is no real title available?)
- On W.P.1 Convergence of A Parallel Stochastic Approximation Algorithm
- Stochastic fictitious play with continuous action sets
- Iterative learning control for large scale nonlinear systems with observation noise
- Parallelizing stochastic gradient descent for least squares regression: mini-batching, averaging, and model misspecification
- Distributed stochastic approximation with local projections
- Stability of numerical methods for jump diffusions and Markovian switching jump diffusions
- Parallel and bootstrapped stochastic approximation
- The Communication Complexity of Distributed epsilon-Approximations
- Stochastic analysis of average-based distributed algorithms
- Dense limit of the Dawid–Skene model for crowdsourcing and regions of sub-optimality of message passing algorithms
- Asynchronous stochastic approximation with differential inclusions
- Probabilistic bisection converges almost as quickly as stochastic approximation
- Stochastic approximation algorithms: overview and recent trends.
- Multi-agent off-policy actor-critic algorithm for distributed multi-task reinforcement learning
- Distributed consensus-based multi-agent temporal-difference learning
- Finite-time error bounds for distributed linear stochastic approximation
- Building up an illiquid stock position subject to expected fund availability: optimal controls and numerical methods
- Stochastic approximation and reinforcement learning: the interface and a little beyond
- Some aspects of parallel and distributed iterative algorithms - a survey
- Large deviations analysis for distributed algorithms in an ergodic Markovian environment
- Asymptotic behavior of asynchronous stochastic approximation
- Consensus-based decentralized real-time identification of large-scale systems
- Q-learning algorithms with random truncation bounds and applications to effective parallel computing
This page was built for publication: Asymptotic Properties of Distributed and Communicating Stochastic Approximation Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3777270)
