arXiv Machine Learning

Tight Lower Bounds under Matched High-Order H\"older Smoothness and Uniform Convexity

arXiv:2611. 05527v1 Announce Type: cross Abstract: In this paper, we provide tight lower bounds for minimizing high-order H\"older-smooth and uniformly convex functions when their orders match.

arXiv Machine Learning
Oct 3

Optimal Stochastic Bilevel Optimization with First-Order Oracles

The paper investigates nonconvex–strongly-convex bilevel optimization using a stochastic first-order oracle. It introduces MRT‑FD, a single-loop first‑order algorithm that tracks the upper-level variable, the lower-level solution, and an auxiliary response from implicit differentiation, updating all variables in each iteration and approximating second‑order derivative actions via order‑p finite differences. For any fixed finite smoothness order p ≥ 1, MRT‑FD achieves an ε‑stationary point with O(ε^{‑4‑2/p}) stochastic gradient queries, and the authors prove a matching Ω(ε^{‑4‑2/p}) lower bound, thereby closing the complexity gap in this setting.

By Linxuan Pan, Junchi Yang
arXiv Machine Learning
Oct 5

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.

By Xinliang Zhang, Lesi Chen, Chengchang Liu, Jingzhao Zhang
Hugging Face Trending Papers
Sep 24

Anchored Extra-Proximal Methods: Optimal Higher-Order Methods for Monotone Inclusion Problems

The paper introduces the Anchored Extra-Proximal (AEP) framework for solving composite monotone inclusion problems, combining anchored extrapolation with an inexact anchored proximal update. By replacing the operator in the implicit update with its Taylor approximation and using a bisection line search, the authors derive a pth-order method that achieves a tangent-residual error ε in “~O(ε^{-2/(3p-1)})” oracle calls for every p ≥ 2. This complexity matches a proven lower bound, establishing the method as optimally efficient for deterministic algorithms in the pth-order oracle model.