On some theoretical limitations of Generative Adversarial Networks
Not on the map. Why?
Abstract (arXiv)
Generative Adversarial Networks have become a core technique in Machine Learning to generate unknown distributions from data samples. They have been used in a wide range of context without paying much attention to the possible theoretical limitations of those models. Indeed, because of the universal approximation properties of Neural Networks, it is a general assumption that GANs can generate any probability distribution. Recently, people began to question this assumption and this article is in line with this thinking. We provide a new result based on Extreme Value Theory showing that GANs can't generate heavy tailed distributions. The full proof of this result is given.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 5 of its 16 references that are in the map. First posted on arXiv 21 Oct 2021.
Builds on
5 of 16 references.
References · 5
- 2018Adversarial vulnerability for any classifiercited by 78
- 2020Random Matrix Theory Proves that Deep Learning Representations of GAN-data Behave as Gaussian Mixturescited by 47
- 2021Pareto GAN: Extending the Representational Power of GANs to Heavy-Tailed Distributionscited by 23
- 2019Copula & Marginal Flows: Disentangling the Marginal from its Jointcited by 17
- 2021Improved Estimation of Concentration Under ℓp-Norm Distance Metrics Using Half Spacescited by 4
Built on by
Citing papers per year: 2023: 1; 2024: 1.
2 papers.
- 20233D GANs and Latent Space: A comprehensive surveycited by 1
- 2024Generalized Regression with Conditional GANscited by 0
- 2024Generalized Regression with Conditional GANs21 Apr 2024
- 20233D GANs and Latent Space: A comprehensive survey8 Apr 2023