Stable Movement for Nondual Lipschitz Convex Optimization: Efficiency and Nearly Optimal Oracle Rates

Paper recorded by Signals 4 on 2026-09-17 in cs.LG. Abstract reproduced from arXiv; link to the original below.

Published 2026-09-17 on arXiv · recorded by Signals 4 on 2026-09-18

Category: cs.LG · 机器学习 · first seen 2026-09-18

Abstract

We study efficient algorithms for realizing the first-order oracle complexity of optimization of $G$-Lipschitz convex functions with respect to the $\ell_{q}$-norm over an $\ell_{p}$-ball of radius $R$, where $1\leq p,q\leq \infty$. For $p<q$, we obtain error $\widetilde{O}_{p,q}(GR/T^{1/p-(1/q-1/2)_{+}})$ after $T$ oracle queries, efficiently realizing the nearly optimal rates of (MBG+26), thereb

Read on arXiv →