Discriminator optimal transport

By Akinori Tanaka. 2019

55 citations recorded by the source corpus.

Within a broad class of generative adversarial networks, we show that discriminator optimization process increases a lower bound of the dual cost function for the Wasserstein distance between the target distribution $p$ and the generator distribution $p_G$. It implies that the trained discriminator can approximate optimal transport (OT) from $p_G$ to $p$. Based on some experiments and a bit of OT theory, we propose discriminator optimal transport (DOT) scheme to improve generated images. We show that it improves inception score and FID calculated by un-conditional GAN trained by CIFAR-10, STL-10 and a public pre-trained model of conditional GAN trained by ImageNet.

Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition, Statistical and Nonlinear Physics, Mathematical Optimization

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Yoshua Bengio
  2. Dacheng Tao
  3. Sergey Levine
  4. Quoc V. Le
  5. Mohit Bansal
  6. Ruslan Salakhutdinov
  7. Trevor Darrell
  8. Tie-Yan Liu

In Computer Vision and Pattern Recognition

  1. Luc Van Gool
  2. Dacheng Tao
  3. Ming-Hsuan Yang
  4. Xiaogang Wang
  5. Trevor Darrell
  6. Andrew Zisserman
  7. Jitendra Malik
  8. Andrea Vedaldi

In Statistical and Nonlinear Physics

  1. Yoshua Bengio
  2. Hugo Larochelle
  3. Abdul Fatir Ansari
  4. Harold Soh
  5. M. L. Ang
  6. Lars Ruthotto
  7. Jascha Narain Sohl-Dickstein
  8. Liang Zhou

In Mathematical Optimization

  1. Zhisheng Xiao
  2. Jascha Narain Sohl-Dickstein
  3. Jinwoo Shin
  4. Samy Wu Fung
  5. Yuan Cao
  6. Minkai Xu
  7. Yuxuan Song
  8. Arthur Gretton

Citations in the corpus