Asymptotic Statistical Analysis of f-divergence GAN
Not on the map. Why?
Abstract (arXiv)
Generative Adversarial Networks (GANs) have achieved great success in data generation. However, its statistical properties are not fully understood. In this paper, we consider the statistical behavior of the general f-divergence formulation of GAN, which includes the Kullback--Leibler divergence that is closely related to the maximum likelihood principle. We show that for parametric generative models that are correctly specified, all f-divergence GANs with the same discriminator classes are asymptotically equivalent under suitable regularity conditions. Moreover, with an appropriately chosen local discriminator, they become equivalent to the maximum likelihood estimate asymptotically. For generative models that are misspecified, GANs with different f-divergences converge to different estimators, and thus cannot be directly compared. However, it is shown that for some commonly used f-divergences, the original f-GAN is not optimal in that one can achieve a smaller asymptotic variance when the discriminator training in the original f-GAN formulation is replaced by logistic regression. The resulting estimation method is referred to as Adversarial Gradient Estimation (AGE). Empirical studies are provided to support the theory and to demonstrate the advantage of AGE over the original f-GANs under model misspecification.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 22 of its 37 references that are in the map. First posted on arXiv 14 Sep 2022.
Builds on
22 of 37 references.
References · 22
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
- 2018A Style-Based Generator Architecture for Generative Adversarial Networkscited by 6,013
- 2022Generative Adversarial Networkscited by 5,627
- 2014Deep Learning Face Attributes in the Wildcited by 3,693
- 2018Large Scale GAN Training for High Fidelity Natural Image Synthesiscited by 2,626
- 2018Spectral Normalization for Generative Adversarial Networkscited by 1,636
- 2019Normalizing Flows for Probabilistic Modeling and Inferencecited by 1,323
- 2018Self-Attention Generative Adversarial Networkscited by 809
- 2019Neural Spline Flowscited by 596
- 2017MoCoGAN: Decomposing Motion and Content for Video Generationcited by 524
- 2016f-GAN: Training Generative Neural Samplers using Variational Divergence Minimizationcited by 506
- 2016SeqGAN: Sequence Generative Adversarial Nets with Policy Gradientcited by 376
10 more
- 2020Loss landscapes and optimization in over-parameterized non-linear systems and neural networkscited by 233
- 2017Generalization and Equilibrium in Generative Adversarial Nets (GANs)cited by 166
- 2017MuseGAN: Multi-track Sequential Generative Adversarial Networks for Symbolic Music Generation and Accompanimentcited by 151
- 2017Stability and Generalization of Learning Algorithms that Converge to Global Optimacited by 100
- 2018How Well Generative Adversarial Networks Learn Distributionscited by 78
- 2017On the Discrimination-Generalization Tradeoff in GANscited by 48
- 2017Approximation and Convergence Properties of Generative Adversarial Learningcited by 28
- 2018Approximability of Discriminators Implies Diversity in GANscited by 28
- 2018Some Theoretical Properties of GANscited by 27
- 2017Dualing GANscited by 4
Built on by
Citing papers per year: 2023: 1; 2024: 0; 2025: 1.
2 papers.