Article contents
On the convergence of moments in the almost sure central limit theorem for stochastic approximation algorithms
Published online by Cambridge University Press: 08 February 2013
Abstract
We study the almost sure asymptotic behaviour of stochastic approximation algorithms for the search of zero of a real function. The quadratic strong law of large numbers is extended to the powers greater than one. In other words, the convergence of moments in the almost sure central limit theorem (ASCLT) is established. As a by-product of this convergence, one gets another proof of ASCLT for stochastic approximation algorithms. The convergence result is applied to several examples as estimation of quantiles and recursive estimation of the mean.
Keywords
- Type
- Research Article
- Information
- Copyright
- © EDP Sciences, SMAI, 2013
References
- 3
- Cited by