Discretization Drift in Two-Player Games
Mihaela Rosca, Yan Wu, Benoit Dherin, David Barrett
Abstract
Gradient-based methods for two-player games produce rich dynamics that can solve challenging problems, yet can be difficult to stabilize and understand. Part of this complexity originates from the discrete update steps given by simultaneous or alternating gradient descent, which causes each player to drift away from the continuous gradient flow -- a phenomenon we call discretization drift. Using backward error analysis, we derive modified continuous dynamical systems that closely follow the discrete dynamics. These modified dynamics provide an insight into the notorious challenges associated with zero-sum games, including Generative Adversarial Networks. In particular, we identify distinct components of the discretization drift that can alter performance and in some cases destabilize the game. Finally, quantifying discretization drift allows us to identify regularizers that explicitly cancel harmful forms of drift or strengthen beneficial forms of drift, and thus improve performance of GAN training.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 1e5c2d3a-a79d-435a-9b1d-856bf5edf16dCited by top-tier papers6
- Why neural networks find simple solutions: The many regularizers of geometric complexityBenoit Dherin, Michael Munn, Mihaela Rosca, David BarrettNeurIPS 2022 · 52 citations
- On the Implicit Bias of AdamMatias D. Cattaneo, Jason M. Klusowski, Boris ShigidaICML 2024 · 26 citations
- A Primal-Dual Approach to Solving Variational Inequalities with General ConstraintsTatjana Chavdarova, Tong Yang, Matteo Pagliardini, Michael I. JordanICLR 2024 · 4 citations
- Deep Fusion: Efficient Network Training via Pre-trained InitializationsHanna Mazzawi, Javier Gonzalvo, Michael Wunder, Sammy Jerome et al.ICML 2024 · 4 citations
- Understanding Dynamics of Adam in Zero-Sum Games: An ODE ApproachYi Feng, Weiming Ou, Xiao WangICML 2026
Builds on8
- On the Origin of Implicit Regularization in Stochastic Gradient DescentSamuel L. Smith, Benoit Dherin, David G. T. Barrett, Soham DeICLR 2021 · 235 citations
- Implicit Gradient RegularizationDavid G. T. Barrett, Benoit DherinICLR 2021 · 235 citations
- A Game Theoretic Framework for Model Based Reinforcement LearningAravind Rajeswaran, Igor Mordatch, Vikash KumarICML 2020 · 137 citations
- On Solving Minimax Optimization Locally: A Follow-the-Ridge ApproachYuanhao Wang, Guodong Zhang, Jimmy BaICLR 2020 · 106 citations
- Conformal Symplectic and Relativistic OptimizationGuilherme França, Jeremias Sulam, Daniel P. Robinson, René VidalNeurIPS 2020 · 81 citations
Related papers
- Training Generative Adversarial Networks by Solving Ordinary Differential EquationsChongli Qin, Yan Wu, Jost Tobias Springenberg, Andy Brock et al.NeurIPS 2020 · 35 citations
- Solving Min-Max Optimization with Hidden Structure via Gradient Descent AscentEmmanouil V. Vlatakis-Gkaragkounis, Lampros Flokas, Georgios PiliourasNeurIPS 2021 · 16 citations
- Implicit Learning Dynamics in Stackelberg Games: Equilibria Characterization, Convergence Analysis, and Empirical StudyTanner Fiez, Benjamin Chasnov, Lillian J. RatliffICML 2020 · 144 citations
- Do GANs always have Nash equilibria?Farzan Farnia, Asuman E. OzdaglarICML 2020 · 93 citations
- Convergence of Gradient Methods on Bilinear Zero-Sum GamesGuojun Zhang, Yaoliang YuICLR 2020 · 37 citations
