Wasserstein GAN (WGAN)

This is an implementation of Wasserstein GAN.

The original GAN loss is based on Jensen-Shannon (JS) divergence between the real distribution ${\mathbb{P}}_r$ and generated distribution ${\mathbb{P}}_g$. The Wasserstein GAN is based on Earth Mover distance between these distributions.

$$W({\mathbb{P}}_r,{\mathbb{P}}_g)=\underset{\gamma \in \Pi ({\mathbb{P}}_r,{\mathbb{P}}_g)}{\inf }{\mathbb{E}}_{(x,y)\sim \gamma }\Vert x-y\Vert$$

$\Pi ({\mathbb{P}}_r,{\mathbb{P}}_g)$ is the set of all joint distributions, whose marginal probabilities are $\gamma (x,y)$.

${\mathbb{E}}_{(x,y)\sim \gamma }\Vert x-y\Vert$ is the earth mover distance for a given joint distribution ($x$ and $y$ are probabilities).

So $W({\mathbb{P}}_r,\mathbb{P}g)$ is equal to the least earth mover distance for any joint distribution between the real distribution ${\mathbb{P}}_r$ and generated distribution ${\mathbb{P}}_g$.

The paper shows that Jensen-Shannon (JS) divergence and other measures for the difference between two probability distributions are not smooth. And therefore if we are doing gradient descent on one of the probability distributions (parameterized) it will not converge.

Based on Kantorovich-Rubinstein duality, $$W({\mathbb{P}}_r,{\mathbb{P}}_g)=\underset{\Vert f{\Vert }_L\le 1}{\sup }{\mathbb{E}}_{x\sim {\mathbb{P}}_r}[f(x)]-{\mathbb{E}}_{x\sim {\mathbb{P}}_g}[f(x)]$$

where $\Vert f{\Vert }_L\le 1$ are all 1-Lipschitz functions.

That is, it is equal to the greatest difference $${\mathbb{E}}_{x\sim {\mathbb{P}}_r}[f(x)]-{\mathbb{E}}_{x\sim {\mathbb{P}}_g}[f(x)]$$ among all 1-Lipschitz functions.

For $K$-Lipschitz functions, $$W({\mathbb{P}}_r,{\mathbb{P}}_g)=\underset{\Vert f{\Vert }_L\le K}{\sup }{\mathbb{E}}_{x\sim {\mathbb{P}}_r}[\frac{1}{K}f(x)]-{\mathbb{E}}_{x\sim {\mathbb{P}}_g}[\frac{1}{K}f(x)]$$

If all $K$-Lipschitz functions can be represented as $f_w$ where $f$ is parameterized by $w\in \mathcal{W}$,

$$K\cdot W({\mathbb{P}}_r,{\mathbb{P}}_g)=\underset{w\in \mathcal{W}}{\max }{\mathbb{E}}_{x\sim {\mathbb{P}}_r}[f_w(x)]-{\mathbb{E}}_{x\sim {\mathbb{P}}_g}[f_w(x)]$$

If $({\mathbb{P}}_g)$ is represented by a generator $$g_{\theta }(z)$$ and $z$ is from a known distribution $z\sim p(z)$,

$$K\cdot W({\mathbb{P}}_r,{\mathbb{P}}_{\theta })=\underset{w\in \mathcal{W}}{\max }{\mathbb{E}}_{x\sim {\mathbb{P}}_r}[f_w(x)]-{\mathbb{E}}_{z\sim p(z)}[f_w(g_{\theta }(z))]$$

Now to converge $g_{\theta }$ with ${\mathbb{P}}_r$ we can gradient descent on $\theta$ to minimize above formula.

Similarly we can find ${\max }_{w\in \mathcal{W}}$ by ascending on $w$, while keeping $K$ bounded. One way to keep $K$ bounded is to clip all weights in the neural network that defines $f$ clipped within a range.

Here is the code to try this on a simple MNIST generation experiment.

87import torch.utils.data
88from torch.nn import functional as F
89
90from labml_helpers.module import Module

Discriminator Loss

We want to find $w$ to maximize $${\mathbb{E}}_{x\sim {\mathbb{P}}_r}[f_w(x)]-{\mathbb{E}}_{z\sim p(z)}[f_w(g_{\theta }(z))]$$, so we minimize, $$-\frac{1}{m}\sum _{i=1}^m{f}_w\left(x^{(i)}\right)+\frac{1}{m}\sum _{i=1}^m{f}_w(g_{\theta }(z^{(i)}))$$

93class DiscriminatorLoss(Module):

• f_real is $f_w(x)$
• f_fake is $f_w(g_{\theta }(z))$

This returns the a tuple with losses for $f_w(x)$ and $f_w(g_{\theta }(z))$, which are later added. They are kept separate for logging.

104    def forward(self, f_real: torch.Tensor, f_fake: torch.Tensor):

Generator Loss

We want to find $\theta$ to minimize $${\mathbb{E}}_{x\sim {\mathbb{P}}_r}[f_w(x)]-{\mathbb{E}}_{z\sim p(z)}[f_w(g_{\theta }(z))]$$ The first component is independent of $\theta$, so we minimize, $$-\frac{1}{m}\sum _{i=1}^m{f}_w(g_{\theta }(z^{(i)}))$$

118class GeneratorLoss(Module):

• f_fake is $f_w(g_{\theta }(z))$

130    def forward(self, f_fake: torch.Tensor):