Convergence and Sample Complexity of SGD in GANs

1 December 2020

Papers citing "Convergence and Sample Complexity of SGD in GANs"

10 / 10 papers shown

Title
Poincaré Recurrence, Cycles and Spurious Equilibria in Gradient-Descent-Ascent for Non-Convex Non-Concave Zero-Sum Games Lampros Flokas Emmanouil-Vasileios Vlatakis-Gkaragkounis Georgios Piliouras MLT 60 41 0 28 Oct 2019
SGD Learns One-Layer Networks in WGANs Qi Lei Jason D. Lee A. Dimakis C. Daskalakis GAN 35 35 0 15 Oct 2019
On Gradient Descent Ascent for Nonconvex-Concave Minimax Problems Tianyi Lin Chi Jin Michael I. Jordan 107 507 0 02 Jun 2019
Efficient Statistics, in High Dimensions, from Truncated Samples C. Daskalakis Themis Gouleakis Christos Tzamos Manolis Zampetakis 60 49 0 11 Sep 2018
The Limit Points of (Optimistic) Gradient Descent in Min-Max Optimization C. Daskalakis Ioannis Panageas 51 255 0 11 Jul 2018
Which Training Methods for GANs do actually Converge? L. Mescheder Andreas Geiger Sebastian Nowozin 73 1,464 0 13 Jan 2018
CyCADA: Cycle-Consistent Adversarial Domain Adaptation Judy Hoffman Eric Tzeng Taesung Park Jun-Yan Zhu Phillip Isola Kate Saenko Alexei A. Efros Trevor Darrell 134 3,001 0 08 Nov 2017
On Convergence and Stability of GANs Naveen Kodali Jacob D. Abernethy James Hays Z. Kira GAN 49 87 0 19 May 2017
Towards Principled Methods for Training Generative Adversarial Networks Martín Arjovsky M. Nault GAN 79 2,106 0 17 Jan 2017
Unrolled Generative Adversarial Networks Luke Metz Ben Poole David Pfau Jascha Narain Sohl-Dickstein GAN 93 1,003 0 07 Nov 2016