Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-18T02:42:20.089Z Has data issue: false hasContentIssue false

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

Peggy Cénac*
Affiliation:
Institut de Mathématiques de Bourgogne, IMB UMR 5584 CNRS, 9 rue Alain Savary, BP 47870, 21078 Dijon Cedex, France. peggy.cenac@u-bourgogne.fr

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Research Article
Copyright
© EDP Sciences, SMAI, 2013