Banach Wasserstein GAN
arXiv:1806.06621
Abstract
Wasserstein Generative Adversarial Networks (WGANs) can be used to generate realistic samples from complicated image distributions. The Wasserstein metric used in WGANs is based on a notion of distance between individual images, which induces a notion of distance between probability distributions of images. So far the community has considered as the underlying distance. We generalize the theory of WGAN with gradient penalty to Banach spaces, allowing practitioners to select the features to emphasize in the generator. We further discuss the effect of some particular choices of underlying norms, focusing on Sobolev norms. Finally, we demonstrate a boost in performance for an appropriate choice of norm on CIFAR-10 and CelebA.
arXiv commentIn NeurIPS2018. 10 pages, 9 page appendix
References in corpus (4)
Cited by in corpus (17)
- Deep Bayesian Inversion
- Wasserstein GANs for MR Imaging: from Paired to Unpaired Training
- Adversarial Lipschitz Regularization
- Implicit competitive regularization in GANs
- Self-Diagnosing GAN: Diagnosing Underrepresented Samples in Generative Adversarial Networks
- Asymptotic Guarantees for Learning Generative Models with the Sliced-Wasserstein Distance
- Asymptotic Guarantees for Generative Modeling Based on the Smooth Wasserstein Distance
- A Wasserstein GAN model with the total variational regularization
- k-GANs: Ensemble of Generative Models with Semi-Discrete Optimal Transport
- PriorGAN: Real Data Prior for Generative Adversarial Nets
- Inclusive GAN: Improving Data and Minority Coverage in Generative Models
- Gradient penalty from a maximum margin perspective
- "Best-of-Many-Samples" Distribution Matching
- Orthogonal Wasserstein GANs
- Generative Modeling by Inclusive Neural Random Fields with Applications in Image Generation and Anomaly Detection
- About exchanging expectation and supremum for conditional Wasserstein GANs
- Robust W-GAN-Based Estimation Under Wasserstein Contamination