Convergence rate of linear two-time-scale stochastic approximation

95Citations
Citations of this article
44Readers
Mendeley users who have this article in their library.

Abstract

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. © Institute of Mathematical Statistics, 2004.

Cite

CITATION STYLE

APA

Konda, V. R., & Tsitsiklis, J. N. (2004). Convergence rate of linear two-time-scale stochastic approximation. Annals of Applied Probability, 14(2), 796–819. https://doi.org/10.1214/105051604000000116

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free