arXiv:2610. 13590v1 Announce Type: cross Abstract: Recent results [arXiv:2602.
By Sebastian Pokutta
The article reviews models of inexact computational oracles in smooth continuous optimization, focusing on zeroth-, first-, and second-order oracles characterized by quantitative error bounds and controllable parameters. It introduces deterministic and stochastic oracle models, illustrating them with examples such as finite-difference approximations, stochastic gradients, and randomized derivative estimators, and discusses distinctions between absolute/relative errors, bias/variance, and independent/coupled randomness. The review emphasizes analytical tools that recover and compare convergence and complexity guarantees across different oracle models, providing bounds on expected stopping times and computational complexity for both deterministic and stochastic first-order methods, and briefly covering inexact second-order information.
By Albert S. Berahas, Liyuan Cao, Katya Scheinberg
In this work, we study the oracle complexity of finding an $ε$-stationary point for nonconvex-strongly-convex (NC-SC) bilevel optimization using only first-order oracles. Existing methods achieving th...
arXiv:2610. 03222v1 Announce Type: cross Abstract: This paper studies the complexity of convex optimization using lazy second-order oracles (Doikov, Chayti, and Jaggi, ICML 2023), where an algorithm queries gradients every iteration and Hessians once per $m$ iterations.
By Xinliang Zhang, Lesi Chen, Chengchang Liu, Jingzhao Zhang
arXiv:2610.19652v1 Announce Type: new
Abstract: Recent work has sought to transfer first-order nonconvex optimization guarantees to zeroth-order methods through gradient estimators, typically incurri...
By Yuxuan Xia, Xiao-Tong Yuan
The paper establishes the optimal incremental first‑order oracle (IFO) complexity for nonconvex finite‑sum optimization under individual smoothness, proving a matching lower bound that closes a previously missing √{n} factor. It also refines the analysis of the PAGE algorithm under the global Polyak‑Lojasiewicz condition, providing tighter guarantees for different ranges of the condition number. The authors introduce a novel dense weak hiding construction that yields these lower bounds and demonstrates the limits of existing methods.
By Yuxing Peng, Zhiqing Tang, Weijia Jia