Convergence Behaviour of Some Gradient-Based Methods on Bilinear Zero-Sum Games

08/15/2019 ∙ by Guojun Zhang, et al. ∙ 0 ∙ share

Min-max formulations have attracted great attention in the ML community due to the rise of deep generative models and adversarial methods, and understanding the dynamics of (stochastic) gradient algorithms for solving such formulations has been a grand challenge. As a first step, we restrict ourselves to bilinear zero-sum games and give a systematic analysis of popular gradient updates, for both simultaneous and alternating versions. We provide exact conditions for their convergence and find the optimal parameter setup and convergence rates. In particular, our results offer formal evidence that alternating updates converge "better" than simultaneous ones.

READ FULL TEXT

Convergence Behaviour of Some Gradient-Based Methods on Bilinear Games

Min-max optimization has attracted much attention in the machine learnin...
08/15/2019 ∙ by Guojun Zhang, et al. ∙ 0 ∙ share

read it
Complex Momentum for Learning in Games

We generalize gradient descent with momentum for learning in differentia...
02/16/2021 ∙ by Jonathan Lorraine, et al. ∙ 21 ∙ share

read it
Stochastic Hamiltonian Gradient Methods for Smooth Games

The success of adversarial formulations in machine learning has brought ...
07/08/2020 ∙ by Nicolas Loizou, et al. ∙ 45 ∙ share

read it
Stochastic Primal-Dual Algorithms with Faster Convergence than O(1/√(T)) for Problems without Bilinear Structure

Previous studies on stochastic primal-dual algorithms for solving min-ma...
04/23/2019 ∙ by Yan Yan, et al. ∙ 0 ∙ share

read it
LEAD: Least-Action Dynamics for Min-Max Optimization

Adversarial formulations such as generative adversarial networks (GANs) ...
10/26/2020 ∙ by Reyhane Askari Hemmat, et al. ∙ 22 ∙ share

read it
Solving Zero-Sum Games through Alternating Projections

In this work, we establish near-linear and strong convergence for a natu...
09/30/2020 ∙ by Ioannis Anagnostides, et al. ∙ 0 ∙ share

read it
Adaptive extra-gradient methods for min-max optimization and games

We present a new family of min-max optimization algorithms that automati...
10/22/2020 ∙ by Kimon Antonakopoulos, et al. ∙ 0 ∙ share

read it

Convergence Behaviour of Some Gradient-Based Methods on Bilinear Zero-Sum Games

Authors

Convergence Behaviour of Some Gradient-Based Methods on Bilinear Games

Complex Momentum for Learning in Games

Stochastic Hamiltonian Gradient Methods for Smooth Games

Stochastic Primal-Dual Algorithms with Faster Convergence than O(1/√(T)) for Problems without Bilinear Structure

LEAD: Least-Action Dynamics for Min-Max Optimization

Solving Zero-Sum Games through Alternating Projections

Adaptive extra-gradient methods for min-max optimization and games

This week in AI