Controlled-Minimax: Stabilizing Adversarial Optimization via Control Theory
Not on the map. Why?
Abstract (arXiv)
Minimax optimization is fundamental to adversarial learning yet suffers from severe stability challenges, often manifesting as persistent limit cycles or divergence. This paper investigates these instabilities through the lens of continuous-time dynamical systems. By modeling training dynamics as a second-order Ordinary Differential Equation (ODE), we rigorously identify the root cause of non-convergence: the problematic eigenstructure of the loss function's Hessian near equilibrium points. To address this, we introduce Controlled-Minimax, a novel stabilization framework that reformulates the optimization trajectory as a controllable physical system. Unlike heuristic regularization techniques, our approach derives a specific feedback controller that provides theoretical guarantees of local exponential stability, regardless of the underlying Hessian spectrum. Consequently, our method stabilizes general minimax problems where traditional gradient descent-ascent methods fail. Extensive experiments on pathological benchmarks including the Dirac-GAN, 2D Gaussian mixtures, and Swiss Roll datasets, as well as high-resolution image synthesis with StyleGAN2-ada, demonstrate that Controlled-Minimax effectively suppresses oscillatory behavior while ensuring fast and robust convergence.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 19 of its 35 references that are in the map. First posted on arXiv 9 Oct 2026.
Builds on
19 of 35 references.
References · 19
- 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,415
- 2018A Style-Based Generator Architecture for Generative Adversarial Networkscited by 6,013
- 2022Generative Adversarial Networkscited by 5,627
- 2017Improved Training of Wasserstein GANscited by 2,235
- 2018Spectral Normalization for Generative Adversarial Networkscited by 1,636
- 2020Training Generative Adversarial Networks with Limited Datacited by 1,186
- 2018Which Training Methods for GANs do actually Converge?cited by 679
- 2015A Differential Equation for Modeling Nesterov's Accelerated Gradient Method: Theory and Insightscited by 206
- 2018On the Convergence of Stochastic Gradient Descent with Adaptive Stepsizescited by 156
- 2019A Unified Analysis of Extra-gradient and Optimistic Gradient Methods for Saddle Point Problems: Proximal Point Approachcited by 143
- 2018Optimistic mirror descent in saddle-point problems: Going the extra (gradient) milecited by 136
- 2017The Numerics of GANscited by 105
7 more
- 2018The Limit Points of (Optimistic) Gradient Descent in Min-Max Optimizationcited by 101
- 2017Gradient descent GAN optimization is locally stablecited by 67
- 2019Reducing Noise in GAN Training with Variance Reduced Extragradientcited by 62
- 2016Stochastic Variance Reduction Methods for Saddle-Point Problemscited by 60
- 2018Negative Momentum for Improved Game Dynamicscited by 60
- 2018Finding Mixed Nash Equilibria of Generative Adversarial Networkscited by 49
- 2023Stabilizing GANs' Training with Brownian Motion Controllercited by 4
Built on by
Not cited yet.