Lower Bounds for Stochastic First-Order Algorithms with Variance Reduction in Nonconvex--Concave Minimax Optimization

arXiv:2610.01662 · math.OC, cs.LG, stat.ML · Submitted 2026-10-01 · Read on arXiv

math.OC, cs.LG, stat.ML

Submitted: 2026-10-01

Updated: 2026-10-01

Terminology

• Accuracy — 15× in this paper · explained in 1 episode
• Activation Function — 1× in this paper · explained in 1 episode
• Adversarial Training — 1× in this paper · explained in 1 episode

Sources

• Lower Complexity Bounds for Nonconvex-Strongly-Convex Bilevel Optimization with First-Order Oracles
• On the Complexity of First-Order Methods in Stochastic Bilevel Optimization
• Single-Loop Stochastic Projected Damped Extragradient Methods for Stochastic Nonconvex--(Strongly) Concave Minimax Optimization
• Sharp First-Order Lower Bounds for Higher-Order Smooth Nonconvex 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
• 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