arXiv Machine Learning
On Global Joint Lower Bounds in Zeroth-Order Nonconvex Optimization
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
Sep 22
The Exponential Price of Determinism in Nonsmooth Nonconvex Optimization
arXiv:2609. 23837v1 Announce Type: cross Abstract: We study the complexity of finding $(\delta,\epsilon)$-Goldstein stationary points of nonsmooth nonconvex Lipschitz functions.
arXiv Machine Learning
Sep 1
Mirror Descent Linearized Augmented Lagrangian Methods for Nonconvex Constrained Stochastic Zeroth-Order Optimization
arXiv:2504.09409v3 Announce Type: replace-cross Abstract: In this paper, we study nonconvex constrained stochastic zeroth-order optimization problems with exact constraints and stochastic objective e...
arXiv Machine Learning
Oct 12
Optimal Algorithms for Nonsmooth Nonconvex Stochastic Optimization with Constraints
arXiv:2610. 13787v1 Announce Type: cross Abstract: We present new algorithms for stochastic optimization problems in which the objective is neither smooth nor convex, subject to a convex constraint set.
arXiv Statistics ML
Sep 28
Ordinary Nonconvex SGD under Distance-Dependent Moments: Finite-Horizon Stationarity and Nagaev Bounds
arXiv:2609.30499v1 Announce Type: new Abstract: Uniform noise-moment bounds exclude stochastic gradients whose variability increases with the iterate. We study ordinary, single-sample stochastic grad...
arXiv Statistics ML
Oct 2
Lower Bounds for Stochastic First-Order Algorithms with Variance Reduction in Nonconvex--Concave Minimax Optimization
arXiv:2610.01662v1 Announce Type: cross Abstract: We establish complexity lower bounds for stochastic first-order algorithms in nonconvex--concave minimax optimization, allowing algorithms to use var...
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.