arXiv Machine Learning

Near-Optimal Acceleration for Smooth $\ell_p$ / $\ell_q$ Nondual Convex First-Order Oracle Optimization

arXiv:2609. 21880v1 Announce Type: cross Abstract: We study the optimization of convex objectives with $(L,\kappa-1)$-H\"older-continuous gradients in $\ell_q$ over $R B_p^d$, $1<\kappa\le 2$.

Hugging Face Trending Papers
Sep 17

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

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), thereby resolving the nonsmooth end of the COLT 2015 open problem (Guz15b).

arXiv Machine Learning
Jun 19

Beyond Averaging in John Ellipsoid Approximation: High-Accuracy Algorithms in the Leverage-Score Model

arXiv:2606. 20082v1 Announce Type: cross Abstract: The John ellipsoid of a symmetric polytope $P=\{\mathbf{x}\in\mathbb{R}^d:\|\mathbf{A}\mathbf{x}\|_\infty\le1\}$, $\mathbf{A}\in\mathbb{R}^{n\times d}$, is computed by a long line of leverage-score algorithms, from Cohen, Cousins, Lee and Yang (COLT 2019) to its successors [WY24, CLS+25], all reaching a $(1+\varepsilon)$-approximation in $\Theta(\varepsilon^{-1}\log(n/d))$ iterations.

By Xiaoyu Li, Junwei Yu, Jiaojiao Jiang, Junbin Gao, Andi Han
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
arXiv Machine Learning
Oct 12

RanSOM: Second-Order Momentum with Randomized Scaling for Constrained and Unconstrained Optimization

The paper introduces RanSOM, a second‑order momentum algorithm that eliminates the need for a Lipschitz Hessian or auxiliary forward/backward passes by randomizing the step length. By sampling the step from an exponential distribution and using a Stein‑type identity, the method obtains an unbiased estimate of the gradient change with a single Hessian‑vector product that also serves the next gradient computation. RanSOM-E achieves optimal oracle‑complexity exponents for heavy‑tailed noise without clipping, while RanSOM-B preserves feasibility for Frank‑Wolfe iterates, and experiments on CIFAR‑10 show comparable accuracy to existing methods with lower update time.

By El Mahdi Chayti, Mohamad Fakhouri
arXiv Machine Learning
Oct 15

Dimension-Optimal Dynamic Regret in Exp-Concave Online Learning

arXiv:2610.20187v1 Announce Type: new Abstract: Tracking changing comparators is a central problem in online learning. For exp-concave losses, previous work established the $T^{1/3}P_T^{2/3}$ depende...

By Yanyi Li, Wendao Wu, Haihan Zhang, Qinshi Wang, Chenheng Zhang, Chunyuan Zheng, Cong Fang, Haoxuan Li, Zhouchen Lin
arXiv Machine Learning
Oct 3

Sharp Oracle-Regret Tradeoffs for Projection-Free Online Convex Optimization

The paper studies online convex optimization when the learner can only query an exact linear optimization oracle. It establishes a dimension‑free minimax expected regret bound of θ(GD max{√T, T/(1+min{Q,BT})^{1/4}}) for convex G‑Lipschitz losses, where Q is the total oracle budget and B the per‑round limit. The authors provide matching lower and upper bounds, showing how strict per‑round or total‑budget constraints affect the achievable regret, and extend the analysis to smooth losses with curvature‑dependent bounds.

By Vaneet Aggarwal