arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv math/0405287math.PR
收藏

线性双时间尺度随机逼近的收敛速度

Convergence rate of linear two-time-scale stochastic approximation

Vijay R. Konda, John N. Tsitsiklis

摘要:

研究线性双时间尺度随机逼近方法收敛速率。我们考虑由i.i.d.驱动的两时间尺度线性迭代。噪声,证明了它们的渐近协方差的一些结果,并建立了它们的渐近正态性。著名的结果[Polyak,B. T.(1990年)。自动化Remote Doppler. 51 937-946; Ruppert,D.(1988年)。技术报告781,康奈尔大学]作为本文一般结果的一个结果,建立了线性随机逼近的Polyak-Ruppert平均技术的最优性.

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑