Convergence rate and averaging of nonlinear two-time-scale stochastic approximation algorithms

Simple item page
dc.creatorMokkadem, Abdelkader
dc.creatorPelletier, Mariane
dc.date2006-10-10
dc.date.accessioned2026-07-07T07:28:54Z
dc.date.available2026-07-07T07:28:54Z
dc.descriptionThe first aim of this paper is to establish the weak convergence rate of nonlinear two-time-scale stochastic approximation algorithms. Its second aim is to introduce the averaging principle in the context of two-time-scale stochastic approximation algorithms. We first define the notion of asymptotic efficiency in this framework, then introduce the averaged two-time-scale stochastic approximation algorithm, and finally establish its weak convergence rate. We show, in particular, that both components of the averaged two-time-scale stochastic approximation algorithm simultaneously converge at the optimal rate $\sqrt{n}$.
dc.descriptionPublished at http://dx.doi.org/10.1214/105051606000000448 in the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org)
dc.identifierhttps://arxiv.org/abs/math/0610329
dc.identifierhttp://arxiv.org/abs/math/0610329
dc.identifierAnnals of Applied Probability 2006, Vol. 16, No. 3, 1671-1702
dc.identifierdoi:10.1214/105051606000000448
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/117906
dc.subjectProbability
dc.subject62L20 (Primary)
dc.titleConvergence rate and averaging of nonlinear two-time-scale stochastic approximation algorithms
dc.typetext

Files

Collections

arXiv