Vijay R. Konda, John N. Tsitsiklis
Published 2004-05-14Version 1
We study the rate of convergence of linear two-time-scale stochastic approximation methods. We consider two-time-scale linear iterations driven by i.i.d. noise, prove some results on their asymptotic covariance and establish asymptotic normality. The well-known result [Polyak, B. T. (1990). Automat. Remote Contr. 51 937-946; Ruppert, D. (1988). Technical Report 781, Cornell Univ.] on the optimality of Polyak-Ruppert averaging techniques specialized to linear stochastic approximation is established as a consequence of the general results in this paper.
Journal: Annals of Applied Probability 2004, Vol. 14, No. 2, 796-819
Convergence rates for rank-based models with applications to portfolio theory
Convergence rate of numerical scheme for SDEs with a distributional drift in Besov space
On the concentration and the convergence rate with a moment condition in first passage percolation
![QR code for arXiv:math/0405287 [math.PR]](http://oss.arxitics.com/images/favicon.svg)