HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Extragradient with player sampling for faster Nash equilibrium finding

Abstract : Data-driven modeling increasingly requires to find a Nash equilibrium in multi-player games, e.g. when training GANs. In this paper, we analyse a new extra-gradient method for Nash equilibrium finding, that performs gradient extrapolations and updates on a random subset of players at each iteration. This approach provably exhibits a better rate of convergence than full extra-gradient for non-smooth convex games with noisy gradient oracle. We propose an additional variance reduction mechanism to obtain speed-ups in smooth convex games. Our approach makes extrapolation amenable to massive multiplayer settings, and brings empirical speed-ups, in particular when using a heuristic cyclic sampling scheme. Most importantly, it allows to train faster and better GANs and mixtures of GANs.
Complete list of metadata

Contributor : Arthur Mensch Connect in order to contact the contributor
Submitted on : Saturday, July 11, 2020 - 12:18:03 PM
Last modification on : Thursday, March 17, 2022 - 10:08:19 AM


Files produced by the author(s)


  • HAL Id : hal-02142598, version 5
  • ARXIV : 1905.12363



Samy Jelassi, Carles Domingo-Enrich, Damien Scieur, Arthur Mensch, Joan Bruna. Extragradient with player sampling for faster Nash equilibrium finding. Proceedings of the International Conference on Machine Learning, 2020, Vienna, Austria. ⟨hal-02142598v5⟩



Record views


Files downloads