paper-with-me

홈 › Papers

Convergence of Gradient Methods on Bilinear Zero-Sum Games

2019-08-15 · ICLR 2020 1 · Guojun Zhang, Yao-Liang Yu

Min-max formulations have attracted great attention in the ML community due to the rise of deep generative models and adversarial methods, while understanding the dynamics of gradient algorithms for solving such formulations has remained a grand challenge. As a first step, we restrict 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.

📄 PDF Abstract BibTeX arXiv:1908.05699

Code (1)

Gordon-Guojun-Zhang/ICLR-2020 공식 구현 pytorch

Similar Papers 제목 키워드 기반

Poincaré Recurrence, Cycles and Spurious Equilibria in Gradient-Descent-Ascent for Non-Convex Non-Concave Zero-Sum Games

2019-10-28 · NeurIPS 2019 12 · Lampros Flokas, Emmanouil-Vasileios Vlatakis-Gkaragkounis, Georgios Piliouras

We study a wide class of non-convex non-concave min-max games that generalizes over standard bilinear zero-sum games. In this class, players control the inputs of a smooth function whose output is being applied to a bili…

A Tight and Unified Analysis of Gradient-Based Methods for a Whole Spectrum of Games

2019-06-13 · Waïss Azizian, Ioannis Mitliagkas, Simon Lacoste-Julien, Gauthier Gidel

We consider differentiable games where the goal is to find a Nash equilibrium. The machine learning community has recently started using variants of the gradient method (GD). Prime examples are extragradient (EG), the op…

Stochastic Hamiltonian Gradient Methods for Smooth Games

2020-07-08 · ICML 2020 1 · Nicolas Loizou, Hugo Berard, Alexia Jolicoeur-Martineau, Pascal Vincent 외

The success of adversarial formulations in machine learning has brought renewed motivation for smooth games. In this work, we focus on the class of stochastic Hamiltonian methods and provide the first convergence guarant…

BIG-bench Machine Learning

Complex Momentum for Optimization in Games

2021-02-16 · Jonathan Lorraine, David Acuna, Paul Vicol, David Duvenaud

We generalize gradient descent with momentum for optimization in differentiable games to have complex-valued momentum. We give theoretical motivation for our method by proving convergence on bilinear zero-sum games for s…

Characterizing Lookahead Dynamics of Smooth Games

2021-01-01 · Junsoo Ha, Gunhee Kim

As multi-agent systems proliferate in machine learning research, games have attracted much attention as a framework to understand optimization of multiple interacting objectives. However, a key challenge in game optimiza…