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$. (MG26) provides selectors with a movement bound for the problem of chasing high-dimensional convex nested sets for every $p<q$ and generally reduces Lipschitz convex optimization...
David Martínez-Rubio, Brian Bullins, Cristóbal Guzmán et al.· 0 citations
We study first-order black-box convex optimization over an $\ell_p$-ball for objectives Lipschitz in the $\ell_q$-norm, solving in the affirmative the nonsmooth version of the COLT open question (Guz15b) on whether the geometry of a smaller feasible set ($p<q$) can improve convergence rates in convex optimization, and...
David Martínez-Rubio, Brian Bullins, Cristóbal Guzmán et al.· 1 citation
Inspired by Muon, this work adopts the spectral view for unlearning and proposes Spectral Saliency Unlearning (SSU), a thresholding approach that thresholds weak singular components and updates only those directions supported by a confident unlearning signal.
Cedar Site Bai, Amber Yijia Zheng, Raymond A. Yeh et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.