The Mechanics of n-Player Differentiable Games

Authors: David Balduzzi, Sebastien Racaniere, James Martens, Jakob Foerster, Karl Tuyls, Thore Graepel

ICML 2018 | Conference PDF | Archive PDF | Plain Text | LLM Run Details

Reproducibility Variable Result LLM Response
Research Type Experimental Section 4 investigates a basic GAN setup from Metz et al. (2017)... Basic experiments show SGA is competitive with recently proposed algorithms for finding stable fixed points in GANs whilst at the same time being applicable to and having guarantees in much more general games.
Researcher Affiliation Collaboration 1Deep Mind 2University of Oxford. Correspondence to: David Balduzzi <dbalduzzi@google.com>.
Pseudocode Yes Algorithm 1 Symplectic Gradient Adjustment
Open Source Code Yes Appendix C contains Tensor Flow code to compute the adjustment.
Open Datasets No No
Dataset Splits No No
Hardware Specification No No
Software Dependencies No No
Experiment Setup Yes The generator and discriminator networks both have 6 Re LU layers of 384 neurons. The generator has two output neurons; the discriminator has one. The networks are trained under RMSProp. Learning rates were chosen by visual inspection of grid search results at iteration 8000, see appendix.