arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1609.05479math.STstat.TH
收藏

平均随机梯度算法的Lp和几乎必然收敛速度:局部强凸目标

Lp and almost sure rates of convergence of averaged stochastic gradient algorithms: locally strongly convex objective

Antoine Godichon-Baggioni

摘要:

统计学中的一个常见问题是估计一个凸函数的最小值。当我们必须处理高维空间中的大样本取值时,随机梯度算法及其平均版本是有效的候选者。事实上,(1)它们不需要太多的计算工作,(2)它们不需要存储所有数据,这在我们处理大数据时至关重要,(3)它们允许简单地更新估计,这在数据顺序到达时很重要。这项工作的目的是给渐近和非渐近的随机梯度估计的收敛速度,以及他们的平均版本时,我们想最小化的功能,只是局部强凸的。

英文摘要:

An usual problem in statistics consists in estimating the minimizer of a convex function. When we have to deal with large samples taking values in high dimensional spaces, stochastic gradient algorithms and their averaged versions are efficient candidates. Indeed, (1) they do not need too much computational efforts, (2) they do not need to store all the data, which is crucial when we deal with big data, (3) they allow to simply update the estimates, which is important when data arrive sequentially. The aim of this work is to give asymptotic and non asymptotic rates of convergence of stochastic gradient estimates as well as of their averaged versions when the function we would like to minimize is only locally strongly convex.

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

↑