A Two-Step Computation of the Exact GAN Wasserstein Distance
Lists
Only you see this
Abstract
In this paper, we propose a two-step method to compute the Wasserstein distance in Wasserstein Generative Adversarial Networks (WGANs): 1) The convex part of our objective can be solved by linear p...
BibTeX
@inproceedings{liu2018two,
author = {Huidong Liu and Xianfeng Gu and Dimitris Samaras},
title = {{A Two-Step Computation of the Exact GAN Wasserstein Distance}},
booktitle = {International Conference on Machine Learning},
year = {2018},
}| Wasserstein GAN | arXiv · 2017 |
| Training Wasserstein GANs without gradient penalties | arXiv · 2021 |
| Towards Generalized Implementation of Wasserstein Distance in GANs | arXiv · 2020 |
| Wasserstein Divergence for GANs | ECCV · 2018 |
| On the regularization of Wasserstein GANs | arXiv · 2017 |
| Improved Training of Wasserstein GANs | arXiv · 2017 |