Parallel Optimal Transport GAN

Gil Avraham, Yan Zuo, Tom Drummond; The IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2019, pp. 4411-4420

Abstract


Although Generative Adversarial Networks (GANs) are known for their sharp realism in image generation, they often fail to estimate areas of the data density. This leads to low modal diversity and at times distorted generated samples. These problems essentially arise from poor estimation of the distance metric responsible for training these networks. To address these issues, we introduce an additional regularisation term which performs optimal transport in parallel within a low dimensional representation space. We demonstrate that operating in a low dimension representation of the data distribution benefits from convergence rate gains in estimating the Wasserstein distance, resulting in more stable GAN training. We empirically show that our regulariser achieves a stabilising effect which leads to higher quality of generated samples and increased mode coverage of the given data distribution. Our method achieves significant improvements on the CIFAR-10, Oxford Flowers and CUB Birds datasets over several GAN baselines both qualitatively and quantitatively.

Related Material


[pdf] [supp]
[bibtex]
@InProceedings{Avraham_2019_CVPR,
author = {Avraham, Gil and Zuo, Yan and Drummond, Tom},
title = {Parallel Optimal Transport GAN},
booktitle = {The IEEE Conference on Computer Vision and Pattern Recognition (CVPR)},
month = {June},
year = {2019}
}