OpenAlex ·
Tight Lower Bounds for Stochastic Nonconvex-Strongly-Concave Minimax Optimization
- Published
- Source
- OpenAlex
- Published in
- arXiv (Cornell University)
- DOI
- 10.48550/arxiv.2609.35206
- Original
- Read it at the publisher
- Topics
Abstract
We study the stochastic first-order oracle complexity of finding $ε$-stationary points of the primal function in smooth nonconvex-strongly-concave minimax optimization. For sufficiently small $ε$, we establish lower bounds of $Ω(κLΔσ^2ε^{-4})$ under the bounded-variance assumption and $Ω(κ^{3/2}\bar LΔσε^{-3})$ under the additional assumption of averaged smoothness. Here, $L$ and $\bar L$ denote the smoothness and averaged-smoothness constants, respectively, $Δ$ is the initial primal gap, $σ^2$ bounds the oracle variance, and $κ=L/μ$ or $\bar L/μ$ in the respective settings, where $μ$ is the strong-concavity parameter. Our bounded-variance lower bound improves the dependence on the condition number from $κ^{1/3}$ in previous lower bounds to $κ$, while our averaged-smoothness lower bound is the first of its kind. In both settings, the resulting lower bounds match existing upper bounds in their dependence on $κ$ and $ε$. Our proofs are based on a unified quadratic lifting construction that transfers a hardness instance for stochastic nonconvex minimization to unconstrained minimax optimization while preserving the required variance and smoothness properties.
The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.
Read it on ReadSearch
Each opens after you create an account, and brings you back to this paper.
More in Artificial Intelligence
Near-Optimal Bounds on the Density of Low-Energy States of $k$-Local Hamiltonians and Faster Quantum Algorithms
Sample Complexity of Equivariant Reinforcement Learning
Depth-Optimal Quantum Compilation
Degree Balance as a Fine-Grained Complexity Boundary for Quantum SAT
Computational Complexity of Clifford Template Compilation: Are Quantum Computers Useful for Compiling Quantum Circuits?
Get the few papers worth your time in Artificial Intelligence every morning.
ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.