From GAN to WGAN. (arXiv:1904.08994v1 [cs.LG])

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.

from cs updates on arXiv.org http://bit.ly/2GCuu81
//