Exploiting the Hidden Tasks of GANs: Making Implicit Subproblems Explicit
Not on the map. Why?
Abstract (arXiv)
We present an alternative perspective on the training of generative adversarial networks (GANs), showing that the training step for a GAN generator decomposes into two implicit subproblems. In the first, the discriminator provides new target data to the generator in the form of "inverse examples" produced by approximately inverting classifier labels. In the second, these examples are used as targets to update the generator via least-squares regression, regardless of the main loss specified to train the network. We experimentally validate our main theoretical result and demonstrate significant improvements over standard GAN training made possible by making these subproblems explicit.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 19 of its 24 references that are in the map. First posted on arXiv 28 Jan 2021.
Builds on
19 of 24 references.
References · 19
- 2014Explaining and Harnessing Adversarial Examplescited by 7,287
- 2014Deep Learning Face Attributes in the Wildcited by 3,679
- 2019Analyzing and Improving the Image Quality of StyleGANcited by 3,580
- 2016Improved Techniques for Training GANscited by 2,938
- 2015Unsupervised Representation Learning with Deep Convolutional Generative Adversarial Networkscited by 2,048
- 2017Deep Image Priorcited by 1,097
- 2016Least Squares Generative Adversarial Networkscited by 1,000
- 2014Understanding Deep Image Representations by Inverting Themcited by 399
- 2014In Search of the Real Inductive Bias: On the Role of Implicit Regularization in Deep Learningcited by 339
- 2016NIPS 2016 Tutorial: Generative Adversarial Networkscited by 284
- 2017Are GANs Created Equal? A Large-Scale Studycited by 267
- 2020A Review on Generative Adversarial Networks: Algorithms, Theory, and Applicationscited by 209
7 more
- 2016Inverting The Generator Of A Generative Adversarial Networkcited by 140
- 2018Implicit Maximum Likelihood Estimationcited by 52
- 2017Many Paths to Equilibrium: GANs Do Not Need to Decrease a Divergence At Every Stepcited by 45
- 2019On Solving Minimax Optimization Locally: A Follow-the-Ridge Approachcited by 34
- 2018Non-Adversarial Image Synthesis with Generative Latent Nearest Neighborscited by 19
- 2018Global Convergence to the Equilibrium of GANs using Variational Inequalitiescited by 15
- 2018On the Implicit Assumptions of GANscited by 6
Built on by
Citing papers per year: 2023: 1.
1 paper.
- 2023The Score-Difference Flow for Implicit Generative Modeling25 Apr 2023