Adaptive algorithms and stochastic approximations
Adaptive algorithms and stochastic approximations
The O.D. E. Method for Convergence of Stochastic Approximation and Reinforcement Learning
SIAM Journal on Control and Optimization
Stochastic Approximation for Nonexpansive Maps: Application to Q-Learning Algorithms
SIAM Journal on Control and Optimization
Some examples of stochastic approximation in communications
NET-COOP'07 Proceedings of the 1st EuroFGI international conference on Network control and optimization
The Impact of Stochastic Noisy Feedback on Distributed Network Utility Maximization
IEEE Transactions on Information Theory
Hi-index | 0.00 |
Stability and convergence properties of stochastic approximation algorithms are analyzed when the noise includes a long range dependent component (modeled by a fractional Brownian motion) and a heavy tailed component (modeled by a symmetric stable process), in addition to the usual `martingale noise'. This is motivated by the emergent applications in communications. The proofs are based on comparing suitably interpolated iterates with a limiting ordinary differential equation. Related issues such as asynchronous implementations, Markov noise, etc. are briefly discussed.