arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2306.05723math.PRmath.STstat.TH

双时间尺度随机逼近的泛函中心极限定理

Functional Central Limit Theorem for Two Timescale Stochastic Approximation

Fathima Zarin Faizal, Vivek Borkar

AI总结:

该研究针对双时间尺度随机逼近算法,证明其经适当缩放后的波动依分布收敛于Gauss-Markov过程,且快迭代对应线性扩散、慢迭代对应常微分方程,建立了该类算法的泛函中心极限定理。

摘要:

双时间尺度随机逼近算法在某种极限意义下可模拟奇异摄动确定性微分方程,即当在由对应步长(视为时间步)定义的“算法时间尺度”上观测时,各时间尺度上的插值迭代在大时间极限下会趋近于特定的微分方程。经过适当缩放后,它们围绕这些确定性极限的波动,可证明在每个时间尺度上依分布收敛于一个Gauss-Markov过程。结果显示,较快迭代的波动表现为线性扩散,较慢迭代的波动则表现为常微分方程。

英文摘要:

Two time scale stochastic approximation algorithms emulate singularly perturbed deterministic differential equations in a certain limiting sense, i.e., the interpolated iterates on each time scale approach certain differential equations in the large time limit when viewed on the `algorithmic time scale' defined by the corresponding step sizes viewed as time steps. Their fluctuations around these deterministic limits, after suitable scaling, can be shown to converge to a Gauss-Markov process in law for each time scale. This turns out to be a linear diffusion for the faster iterates and an ordinary differential equation for the slower iterates.

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

↑