Every deterministic first-order algorithm needs Ω(ρG²Δ/ε⁴) oracle calls to find an ε-stationary point of a ρ-weakly convex, G-Lipschitz function in the small-gap regime.
ICML Workshop on Beyond First-Order Methods in ML Systems , pages=
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Optimal Deterministic Oracle Complexity for Weakly Convex Optimization
Every deterministic first-order algorithm needs Ω(ρG²Δ/ε⁴) oracle calls to find an ε-stationary point of a ρ-weakly convex, G-Lipschitz function in the small-gap regime.