paper-with-me

홈 › Papers

Bridging the Gap Between f-GANs and Wasserstein GANs

2020-01-01 · ICML 2020 1 · Jiaming Song, Stefano Ermon

Generative adversarial networks (GANs) variants approximately minimize divergences between the model and the data distribution using a discriminator. Wasserstein GANs (WGANs) enjoy superior empirical performance, however, unlike in f-GANs, the discriminator does not provide an estimate for the ratio between model and data densities, which is useful in applications such as inverse reinforcement learning. To overcome this limitation, we propose an new training objective where we additionally optimize over a set of importance weights over the generated samples. By suitably constraining the feasible set of importance weights, we obtain a family of objectives which includes and generalizes the original f-GAN and WGAN objectives. We show that a natural extension outperforms WGANs while providing density ratios as in f-GAN, and demonstrate empirical success on distribution modeling, density ratio estimation and image generation, where we achieve state-of-the-art FID scores on CIFAR10 generation.

📄 PDF Abstract BibTeX

Code (1)

ermongroup/f-wgan 공식 구현 pytorch

Tasks

Density Ratio EstimationImage GenerationReinforcement Learning (RL)

Similar Papers 제목 키워드 기반

Bridging the Gap Between $f$-GANs and Wasserstein GANs

2019-10-22 · Jiaming Song, Stefano Ermon

Generative adversarial networks (GANs) have enjoyed much success in learning high-dimensional distributions. Learning objectives approximately minimize an $f$-divergence ($f$-GANs) or an integral probability metric (Wass…

Image Generation

Wasserstein GANs Work Because They Fail (to Approximate the Wasserstein Distance)

2021-03-02 · Jan Stanczuk, Christian Etmann, Lisa Maria Kreusser, Carola-Bibiane Schönlieb

Wasserstein GANs are based on the idea of minimising the Wasserstein distance between a real and a generated distribution. We provide an in-depth mathematical analysis of differences between the theoretical setup and the…

(q,p)-Wasserstein GANs: Comparing Ground Metrics for Wasserstein GANs

2019-02-10 · Anton Mallasto, Jes Frellsen, Wouter Boomsma, Aasa Feragen

Generative Adversial Networks (GANs) have made a major impact in computer vision and machine learning as generative models. Wasserstein GANs (WGANs) brought Optimal Transport (OT) theory into GANs, by minimizing the $1$-…

A Wasserstein perspective of Vanilla GANs

2024-03-22 · Lea Kunkel, Mathias Trabs

The empirical success of Generative Adversarial Networks (GANs) caused an increasing interest in theoretical research. The statistical literature is mainly focused on Wasserstein GANs and generalizations thereof, which e…

Dimensionality Reduction

Relaxed Wasserstein with Applications to GANs

2017-05-19 · Xin Guo, Johnny Hong, Tianyi Lin, Nan Yang

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…

Image Generation