Siqi Zhang

Stochastic nonconvex-strongly-concave minimax optimization is officially closed: new $\Omega(\kappa \epsilon^{-4})$ and $\Omega(\kappa^{3/2}\epsilon^{-3})$ lower bounds prove that standard first-order algorithms have already hit the fundamental limits of sample complexity.