Near-Optimal Convex Optimization with Lazy Second-Order Oracles

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. Under this setting, we show a lower bound of Omega(m+ m^{1/7} epsilon^{-2/7}) on the number of total iterations to find an epsilon-solution using a novel block zero-chain construction. Then we propose a novel method that achieves a new upper bound of ilde{O}(m+ m^{1/7} epsilon^{-2/7}), which significantly improves the prior one (Chen, Liu, Luo, and Zhang, COLT 2026) of ilde{O}(m+ m^{13/21} epsilon^{-2/7}) and is tight up to logarithmic factors.

Source: arXiv cs.LG | 2026-10-05