arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1506.09211math.OC
收藏

Finite Difference随机逼近算法的收敛速度

Convergence Rates of Finite Difference Stochastic Approximation Algorithms

Liyi Dai

摘要:

最近,随机最优化的无导数方法又引起了人们的兴趣。在本文中,我们研究的Kiefer-Wolfowitz算法和镜像下降算法的收敛速度,在各种更新计划使用有限差分梯度近似。结果表明,这些算法的收敛速度可以通过控制有限差分的实现。特别是,它示出的速率可以增加到$n^{-2/5}$一般和$n^{-1/2}$在Monte Carlo优化的广泛的一类问题,在迭代次数n。

英文摘要:

Recently there has been renewed interests in derivative free approaches to stochastic optimization. In this paper, we examine the rates of convergence for the Kiefer-Wolfowitz algorithm and the mirror descent algorithm, under various updating schemes using finite differences as gradient approximations. It is shown that the convergence of these algorithms can be accelerated by controlling the implementation of the finite differences. Particularly, it is shown that the rate can be increased to $n^{-2/5}$ in general and to $n^{-1/2}$ in Monte Carlo optimization for a broad class of problems, in the iteration number n.

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

↑