Tight Stochastic Condition-Number Dependence in Nonconvex-Strongly-Concave Minimax Optimization

arXiv:2609.30877 · math.OC, cs.LG · Submitted 2026-09-25 · Read on arXiv

math.OC, cs.LG

Submitted: 2026-09-25

Updated: 2026-09-25

Terminology

• Accuracy — 5× in this paper · explained in 1 episode
• Verification — 2× in this paper · explained in 2 episodes
• Geometric Distribution — 1× in this paper · explained in 2 episodes

Sources

• SAPD+: An Accelerated Stochastic Method for Nonconvex-Concave Minimax Problems
• On the Condition Number Dependency in Bilevel Optimization
• Lower Complexity Bounds for Nonconvex-Strongly-Convex Bilevel Optimization with First-Order Oracles

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
• Online Control via Counterfactual Tracking
• Asynchronous Replanning in Two Population Linear Quadratic Mean Field Games: Information Requirements and Stability
• Petrov-Galerkin operator inference with application to stability-encouraging identification