arXiv:2405. 11454v3 Announce Type: replace Abstract: We study gradient testing and gradient estimation of smooth functions using only a comparison oracle that, given two points, indicates which one has the larger function value.
By Xiwen Tao, Chenyi Zhang, Helin Wang, Yexin Zhang, Tongyang Li
arXiv:2607. 25492v2 Announce Type: replace Abstract: We study stochastic optimization with heavy-tailed gradient noise.
By Bin Luo, Chengchang Liu, Jonathan Allcock, Shengyu Zhang, John C. S. Lui
arXiv:2504. 03626v2 Announce Type: replace-cross Abstract: We present quantum speedups for sampling from distributions of the form $\pi\propto e^{-f}$ on $\mathbb{R}^d$.
By Guneykan Ozgul, Xiantao Li, Mehrdad Mahdavi, Chunhao Wang
arXiv:2511. 19656v3 Announce Type: replace Abstract: Although upper bound guarantees for bilevel optimization have been widely studied, progress on lower bounds has been limited due to the complexity of the bilevel structure.
By Kaiyi Ji
arXiv:2606. 05438v1 Announce Type: new Abstract: We study the deterministic first-order oracle complexity of finding \(\epsilon\)-stationary points in smooth nonconvex optimization when the objective satisfies higher-order smoothness assumptions.
By Dongruo Zhou
arXiv:2605. 25303v3 Announce Type: replace-cross Abstract: The $2 \rightarrow q$ norm of a matrix $X \in \mathbb{R}^{n \times d}$ is defined as $\lVert X \rVert_{2 \rightarrow q} = \sup_{\lVert v \rVert_2 = 1} \lVert Xv \rVert_q$.
By Samuel B. Hopkins, Stefan Tiegel