From GAN to WGAN (2017)(lilianweng.github.io) |
From GAN to WGAN (2017)(lilianweng.github.io) |
AFAIK everyone (eg, pyemd, gensim, textacy) uses wrappers around the EMD solver from http://ofirpele.droppages.com/, which is a zip file from some time in 2008. The limits on performance mean it can't practically be used in things like interactive nearest neighbor calculations (FAISS, nmslib, annoy etc)
in this case the WGAN doesn’t actually compute the discrete EMD like that. instead it uses some constraints in the optimization process (gradient clipping), which it can be argued make the training objective equivalent in the limit to minimizing continuous Wasserstein distance (between probability distributions).