From GAN to WGAN

18 Apr 2019 · Lilian Weng ·

This paper explains the math behind a generative adversarial network (GAN) model and why it is hard to be trained. Wasserstein GAN is intended to improve GANs' training by adopting a smooth metric for measuring the distance between two probability distributions.

Code

Add Remove Mark official

Sinestro38/qosf-qgan

23

Tasks

Add Remove

Generative Adversarial Network

Datasets

Add Datasets introduced or used in this paper

Results from the Paper

Edit

Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.

Methods

Add Remove

Convolution • GAN