Wasserstein GAN can perform PCA

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 181
  • Download : 0
Generative Adversarial Networks (GANs) have become a powerful framework to learn generative models that arise across a wide variety of domains. While there has been a recent surge in the development of numerous GAN architectures with distinct optimization metrics, we are still lacking in our understanding on how far away such GANs are from optimality. In this paper, we make progress on a theoretical understanding of the GANs under a simple linear-generator Gaussian-data setting where the optimal maximum-likelihood generator is known to perform Principal Component Analysis (PCA). We find that the original GAN by Goodfellow et. al. fails to recover the optimal PCA solution. On the other hand, we show that Wasserstein GAN can approach the PCA solution in the limit of sample size, and hence it may serve as a basis for an optimal GAN architecture that yields the optimal generator for a wide range of data settings.
Publisher
Proceedings of Allerton on Communication, Control, and Computing
Issue Date
2019-09
Language
English
Citation

57th Annual Allerton Conference on Communication, Control, and Computing (Allerton), pp.895 - 901

ISSN
2474-0195
URI
http://hdl.handle.net/10203/269279
Appears in Collection
EE-Conference Papers(학술회의논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0