3.8 Proceedings Paper

RELAXED WASSERSTEIN WITH APPLICATIONS TO GANS

出版社

IEEE
DOI: 10.1109/ICASSP39728.2021.9414454

关键词

WGANs; Bregman cost functions; image and signal processing; wireless communication; fast and stable convergence

向作者/读者索取更多资源

This paper introduces a new class of Relaxed Wasserstein distances by generalizing Wasserstein-1 distance with Bregman cost functions. Experiments demonstrate that Relaxed WGANs with Kullback-Leibler cost function outperform other competing approaches in terms of statistical flexibility and efficient approximations.
Wasserstein Generative Adversarial Networks (WGANs) provide a versatile class of models, which have attracted great attention in various applications. However, this framework has two main drawbacks: (i) Wasserstein-1 (or Earth-Mover) distance is restrictive such that WGANs cannot always fit data geometry well; (ii) It is difficult to achieve fast training of WGANs. In this paper, we propose a new class of Relaxed Wasserstein (RW) distances by generalizing Wasserstein-1 distance with Bregman cost functions. We show that RW distances achieve nice statistical properties while not sacrificing the computational tractability. Combined with the GANs framework, we develop Relaxed WGANs (RWGANs) which are not only statistically flexible but can be approximated efficiently using heuristic approaches. Experiments on real images demonstrate that the RWGAN with Kullback-Leibler (KL) cost function outperforms other competing approaches, e.g., WGANs, even with gradient penalty.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

3.8
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据