For a class of distributed recursive algorithms, it is shown that a stochastic approximation-like tapering stepsize routine suppresses the effects of interprocessor delays.
We describe stochastic recursive algorithms that find many applications in optimization under uncertainty, computational statistics, soft computing and machine learning, signal processing, communications, adaptive control, etc. The basic paradigm is that of the 'stochastic approximation' scheme introduced by Robbins and Monro in 1951. We describe the basic scheme and various theoretical and computational aspects related to its convergence and convergence rates. Several specific instances are also described, followed by more sophisticated versions such as distributed schemes and simulated annealing.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.