Near-Optimal Complexity of Finite-Sum Nonconvex-Strongly-Concave Minimax Optimization
math.OC, cs.LG
Submitted: 2026-10-04
Updated: 2026-10-04
Sources
- The Complexity of Nonconvex-Strongly-Concave Minimax Optimization
- Complexity Lower Bounds for Nonconvex-Strongly-Concave Min-Max Optimization
- SPIDER: Near-Optimal Non-Convex Optimization via Stochastic Path Integrated Differential Estimator
- Dense Weak Hiding: Closing Complexity Gaps in Nonconvex and PL Finite-Sum Optimization under Individual Smoothness
- Lower Bounds for Smooth Nonconvex Finite-Sum Optimization
- Near Optimal Stochastic Algorithms for Finite-Sum Unbalanced Convex-Concave Minimax Optimization
- Lower Bounds for Finding Stationary Points II: First-Order Methods
- Stochastic Recursive Gradient Descent Ascent for Stochastic Nonconvex-Strongly-Concave Minimax Problems
- Faster Stochastic Algorithms for Minimax Optimization under Polyak--{\L}ojasiewicz Conditions
- A variance reduced framework for (non)smooth nonconvex-nonconcave stochastic minimax problems with extended Kurdyka-Lojasiewicz property
- Sharper Rates for Separable Minimax and Finite Sum Optimization via Primal-Dual Extragradient Methods
- Tight Stochastic Condition-Number Dependence in Nonconvex-Strongly-Concave Minimax Optimization
Related papers
- Lions and Muons: Optimization via Stochastic Frank-Wolfe under Heavy-Tailed Noise
- Adam-HNAG: A Convergent Reformulation of Adam with Accelerated Rate
- Incremental Learning in Mirror Flows
- Second-Order Optimization with Asynchronous Curvature
- Online Control via Counterfactual Tracking
- Asynchronous Replanning in Two Population Linear Quadratic Mean Field Games: Information Requirements and Stability