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

关于一维光滑函数驻点的求法复杂性

On the complexity of finding stationary points of smooth functions in one dimension

Sinho Chewi, Sébastien Bubeck, Adil Salim

摘要:

我们刻画了一维非凸但光滑函数的稳定点的查询复杂度。我们考虑四种设置,根据所考虑的算法是确定性的还是随机的,以及Oracle是否输出$1^{\rm st}$ -顺序或$0^{\rm th}$ -和$1^{\rm st}$ -顺序信息。我们的研究结果表明,该任务的算法可证明受益于将随机性或$0^{\rm th}$顺序信息。我们的研究结果还表明,对于每一个维度$d \geq 1$,梯度下降是最佳的确定性算法中使用$1^{\rm st}$顺序查询。

英文摘要:

We characterize the query complexity of finding stationary points of one-dimensional non-convex but smooth functions. We consider four settings, based on whether the algorithms under consideration are deterministic or randomized, and whether the oracle outputs $1^{\rm st}$-order or both $0^{\rm th}$- and $1^{\rm st}$-order information. Our results show that algorithms for this task provably benefit by incorporating either randomness or $0^{\rm th}$-order information. Our results also show that, for every dimension $d \geq 1$, gradient descent is optimal among deterministic algorithms using $1^{\rm st}$-order queries only.

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

↑