Accelerated Stochastic Approximation
Bernard Delyon, Anatoli Juditsky · SIAM Journal on Optimization · 1993
Not cached yet. This record was fetched live for this request and is stored after the lookup. Reopening the page should serve the cached copy.
SIAM Journal on Optimization · Society for Industrial and Applied Mathematics · article · 1993
Abstract
A technique to accelerate convergence of stochastic approximation algorithms is studied. It is based on Kesten’s idea of equalization of the gain coefficient for the Robbins–Monro algorithm. Convergence with probability 1 is proved for the multidimensional analog of the Kesten accelerated stochastic approximation algorithm. Asymptotic normality of the delivered estimates is also shown. Results of numerical simulations are presented that demonstrate the efficiency of the acceleration procedure.
Open the resolved locator · 10.1137/0803045
Metadata licence: OpenAlex metadata (CC0)