arXiv Machine Learning
Linearly Convergent Algorithms for Nonsmooth Problems with Unknown Smooth Regions
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv Machine Learning
Jun 5
Learning to optimize with guarantees: a complete characterization of linearly convergent algorithms
arXiv:2508. 00775v2 Announce Type: replace-cross Abstract: The design of many classical optimization algorithms is driven by the certification of linear convergence rates over classes of optimization problems.
arXiv Machine Learning
Jul 13
Nonconvex Composite Functional Constraints via First-Order Augmented Lagrangian Methods under Local Regularity
arXiv:2607. 08954v1 Announce Type: cross Abstract: We study nonasymptotic convergence of primal-dual methods for a class of nonconvex constrained optimization problems with a convex-composite structure.
arXiv Machine Learning
Sep 15
Projection-Free Multi-level Algorithms for Stochastic Constrained Compositional Optimization
arXiv:2609.15679v1 Announce Type: cross Abstract: This paper studies projection-free algorithms for stochastic constrained multi-level compositional optimization. In this context, the objective funct...
arXiv Machine Learning
Jun 5
Sharp First-Order Lower Bounds for Higher-Order Smooth Nonconvex Optimization
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.
arXiv Machine Learning
Jun 5
Efficiently Escaping Saddle Points under Generalized Smoothness via Self-Bounding Regularity
arXiv:2503. 04712v3 Announce Type: replace-cross Abstract: We study the optimization of non-convex functions that are not necessarily smooth (gradient and/or Hessian are Lipschitz) using first order methods.
arXiv Machine Learning
Jul 13
Accelerated Fully First-Order Methods for Bilevel and Minimax Optimization
arXiv:2405. 00914v4 Announce Type: replace-cross Abstract: We present in this paper novel accelerated fully first-order methods in \emph{Bilevel Optimization} (BLO).