Ecosyste.ms: Awesome

An open API service indexing awesome lists of open source software.

https://github.com/martinarjovsky/WassersteinGAN

Last synced: about 2 months ago
JSON representation

Host: GitHub
URL: https://github.com/martinarjovsky/WassersteinGAN
Owner: martinarjovsky
License: bsd-3-clause
Created: 2017-01-30T06:51:23.000Z (over 7 years ago)
Default Branch: master
Last Pushed: 2018-12-26T16:46:00.000Z (over 5 years ago)
Last Synced: 2024-01-25T20:08:50.848Z (4 months ago)
Language: Python
Size: 1.75 MB
Stars: 3,165
Watchers: 107
Forks: 740
Open Issues: 28
Metadata Files:
- Readme: README.md
- License: LICENSE.md

Lists

Awesome-pytorch-list - WassersteinGAN
awesome-GAN - Wasserstein GAN - Code accompanying the paper ["Wasserstein GAN"](https://arxiv.org/abs/1701.07875) (Codes)
my-awesome-stars - martinarjovsky/WassersteinGAN - (Python)
awesome-pytorch - Wasserstein GAN
Awesome-pytorch-list-CNVersion - WassersteinGAN
awesome-pytorch - Wasserstein GAN

README

Wasserstein GAN
===============

Code accompanying the paper ["Wasserstein GAN"](https://arxiv.org/abs/1701.07875)

## A few notes

- The first time running on the LSUN dataset it can take a long time (up to an hour) to create the dataloader. After the first run a small cache file will be created and the process should take a matter of seconds. The cache is a list of indices in the lmdb database (of LSUN)
- The only addition to the code (that we forgot, and will add, on the paper) are the [lines 163-166 of main.py](https://github.com/martinarjovsky/WassersteinGAN/blob/master/main.py#L163-L166). These lines act only on the first 25 generator iterations or very sporadically (once every 500 generator iterations). In such a case, they set the number of iterations on the critic to 100 instead of the default 5. This helps to start with the critic at optimum even in the first iterations. There shouldn't be a major difference in performance, but it can help, especially when visualizing learning curves (since otherwise you'd see the loss going up until the critic is properly trained). This is also why the first 25 iterations take significantly longer than the rest of the training as well.
- If your learning curve suddenly takes a big drop take a look at [this](https://github.com/martinarjovsky/WassersteinGAN/issues/2). It's a problem when the critic fails to be close to optimum, and hence its error stops being a good Wasserstein estimate. Known causes are high learning rates and momentum, and anything that helps the critic get back on track is likely to help with the issue.

## Prerequisites

- Computer with Linux or OSX
- [PyTorch](http://pytorch.org)
- For training, an NVIDIA GPU is strongly recommended for speed. CPU is supported but training is very slow.

Two main empirical claims:

### Generator sample quality correlates with discriminator loss

![gensample](imgs/w_combined.png "sample quality correlates with discriminator loss")

### Improved model stability

![stability](imgs/compare_dcgan.png "stability")

## Reproducing LSUN experiments

**With DCGAN:**

```bash
python main.py --dataset lsun --dataroot [lsun-train-folder] --cuda
```

**With MLP:**

```bash
python main.py --mlp_G --ngf 512
```

Generated samples will be in the `samples` folder.

If you plot the value `-Loss_D`, then you can reproduce the curves from the paper. The curves from the paper (as mentioned in the paper) have a median filter applied to them:

```python
med_filtered_loss = scipy.signal.medfilt(-Loss_D, dtype='float64'), 101)
```