Matching Multi-Loop Complexities with a Single Loop: Optimal Optimization Stationarity and Best-Known Game Stationarity in Nonconvex--Concave Minimax Optimization

arXiv:2609.17973 · math.OC, cs.LG, stat.ML · Submitted 2026-09-16 · Read on arXiv

math.OC, cs.LG, stat.ML

Submitted: 2026-09-16

Updated: 2026-09-16

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

• Accuracy — 9× in this paper · explained in 1 episode
• Regularization — 6× in this paper · explained in 3 episodes
• Lyapunov function — 2× in this paper · explained in 2 episodes
• Generalization — 1× in this paper · explained in 13 episodes
• Objective Function — 1× in this paper · explained in 2 episodes

Sources

• Distributionally Robust Neural Networks for Group Shifts: On the Importance of Regularization for Worst-Case Generalization
• Smoothing Meets Perturbation: Unified and Tight Analysis for Nonconvex-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
• 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