Optimal Oracle Complexity for Weakly Convex Optimization
math.OC
Submitted: 2026-08-04
Updated: 2026-11-13
Code: https://github.com/SiyuPan04/Weakly-Convex-Lower-Bound-Lean
Terminology
Sources
- Stochastic subgradient method converges at the rate $O(k^{-1/4})$ on weakly convex functions
- A Proximal Descent Method for Minimizing Weakly Convex Optimization
- Lower Bound for Randomized First Order Convex Optimization
Related papers
- An Accelerated Proximal Gradient Method for Bures-Wasserstein Space
- FOMTools: Development and AI-Assisted Code Generation for First-Order Methods
- Lions and Muons: Optimization via Stochastic Frank-Wolfe under Heavy-Tailed Noise
- Dynamic Service Recommendation with Congestion-Dependent Joining: Near-Optimal and Constant-Factor Approximation Algorithms
- Integrating Learning and Optimization for Open Transport Capacity Pooling under Disruption
- Zeroth-Order Gradient Estimators under Decision-Dependent Noise