Solving a class of non-convex min-max games using adaptive momentum methods
Not on the map. Why?
Abstract (arXiv)
Adaptive momentum methods have recently attracted a lot of attention for training of deep neural networks. They use an exponential moving average of past gradients of the objective function to update both search directions and learning rates. However, these methods are not suited for solving min-max optimization problems that arise in training generative adversarial networks. In this paper, we propose an adaptive momentum min-max algorithm that generalizes adaptive momentum methods to the non-convex min-max regime. Further, we establish non-asymptotic rates of convergence for the proposed algorithm when used in a reasonably broad class of non-convex min-max optimization problems. Experimental results illustrate its superior performance vis-a-vis benchmark methods for solving such problems.
Key facts. Cited by 10 papers in the map (data through 14 Oct 2026). Builds on 27 of its 42 references that are in the map. First posted on arXiv 26 Apr 2021.
Builds on
27 of 42 references.
References · 27
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2017Progressive Growing of GANs for Improved Quality, Stability, and Variationcited by 2,988
- 2016Improved Techniques for Training GANscited by 2,970
- 2016Optimization Methods for Large-Scale Machine Learningcited by 1,150
- 2019On the Convergence of Adam and Beyondcited by 841
- 2017Wasserstein GANcited by 639
- 2019On Gradient Descent Ascent for Nonconvex-Concave Minimax Problemscited by 270
- 2017Training GANs with Optimismcited by 217
- 2019SGD: General Analysis and Improved Ratescited by 207
- 2018On the Convergence of A Class of Adam-Type Algorithms for Non-Convex Optimizationcited by 174
- 2019Solving a Class of Non-Convex Min-Max Games Using Iterative First Order Methodscited by 148
- 2018Optimistic mirror descent in saddle-point problems: Going the extra (gradient) milecited by 136
15 more
- 2019Efficient Algorithms for Smooth Minimax Optimizationcited by 76
- 2019A Decentralized Parallel Algorithm for Training Generative Adversarial Netscited by 43
- 2020Efficient Search of First-Order Nash Equilibria in Nonconvex-Concave Smooth Min-Max Problemscited by 39
- 2020Non-convex Min-Max Optimization: Applications, Challenges, and Recent Theoretical Advancescited by 38
- 2017Extragradient method with variance reduction for stochastic variational inequalitiescited by 33
- 2019DADAM: A Consensus-based Distributed Adaptive Gradient Method for Online Optimizationcited by 30
- 2019Towards Better Understanding of Adaptive Gradient Algorithms in Generative Adversarial Netscited by 29
- 2019On the Convergence Proof of AMSGrad and a New Versioncited by 21
- 2019What is Local Optimality in Nonconvex-Nonconcave Minimax Optimization?cited by 20
- 2020GANs May Have No Nash Equilibriacited by 20
- 2016Frank-Wolfe Algorithms for Saddle Point Problemscited by 18
- 2020Solving Non-Convex Non-Differentiable Min-Max Games using Proximal Gradient Methodcited by 10
- 2020Adaptive First-and Zeroth-order Methods for Weakly Convex Stochastic Optimization Problemscited by 7
- 2018On the Behavior of the Expectation-Maximization Algorithm for Mixture Modelscited by 4
- 2019Training generative networks using random discriminatorscited by 4
Built on by
Citing papers per year: 2021: 5; 2022: 2; 2023: 1; 2024: 1; 2025: 1.
10 papers.
- 2022FedNest: Federated Bilevel, Minimax, and Compositional Optimizationcited by 60
- 2021Decentralized Local Stochastic Extra-Gradient for Variational Inequalitiescited by 25
- 2021A Decentralized Adaptive Momentum Method for Solving a Class of Min-Max Optimization Problemscited by 9
- 2021Nonconvex-Nonconcave Min-Max Optimization with a Small Maximization Domaincited by 8
- 2021On Characterizing GAN Convergence Through Proximal Duality Gapcited by 3
- 2022Dissecting adaptive methods in GANscited by 3
- 2025A Novel Multi-Task Teacher-Student Architecture with Self-Supervised Pretraining for 48-Hour Vasoactive-Inotropic Trend Analysis in Sepsis Mortality Predictioncited by 3
- 2024Accelerated Stochastic Min-Max Optimization Based on Bias-corrected Momentumcited by 2
- 2021Efficient Algorithms for Estimating the Parameters of Mixed Linear Regression Modelscited by 1
- 2023Federated Multi-Sequence Stochastic Approximation with Local Hypergradient Estimationcited by 0
- 2025A Novel Multi-Task Teacher-Student Architecture with Self-Supervised Pretraining for 48-Hour Vasoactive-Inotropic Trend Analysis in Sepsis Mortality Prediction24 Feb 2025
- 2024Accelerated Stochastic Min-Max Optimization Based on Bias-corrected Momentum18 Jun 2024
- 2023Federated Multi-Sequence Stochastic Approximation with Local Hypergradient Estimation2 Jun 2023
- 2022Dissecting adaptive methods in GANs9 Oct 2022
- 2022FedNest: Federated Bilevel, Minimax, and Compositional Optimization4 May 2022
- 2021Nonconvex-Nonconcave Min-Max Optimization with a Small Maximization Domain8 Oct 2021
- 2021Decentralized Local Stochastic Extra-Gradient for Variational Inequalities15 Jun 2021
- 2021A Decentralized Adaptive Momentum Method for Solving a Class of Min-Max Optimization Problems10 Jun 2021
- 2021Efficient Algorithms for Estimating the Parameters of Mixed Linear Regression Models12 May 2021
- 2021On Characterizing GAN Convergence Through Proximal Duality Gap11 May 2021