arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1707.01647stat.MLcs.AIcs.LGmath.OC
收藏

优化算法的收敛性分析

Convergence Analysis of Optimization Algorithms

HyoungSeok Kim, JiHoon Kang, WooMyoung Park, SukHyun Ko, YoonHo Cho, DaeSung Yu, YoungSook Song, JungWon Choi

摘要:

优化算法的后悔界是评价算法性能的基本准则之一。通过考察传统算法和自适应算法的遗憾界之间的差异,我们提供了一个指导选择优化器相对于给定的数据集和损失函数。为了分析,我们假设损失函数是凸的,并且其梯度是Lipschitz连续的。

英文摘要:

The regret bound of an optimization algorithms is one of the basic criteria for evaluating the performance of the given algorithm. By inspecting the differences between the regret bounds of traditional algorithms and adaptive one, we provide a guide for choosing an optimizer with respect to the given data set and the loss function. For analysis, we assume that the loss function is convex and its gradient is Lipschitz continuous.

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

↑