pith. sign in

arxiv: 1803.05573 · v1 · pith:Y5TPOOYWnew · submitted 2018-03-15 · 💻 cs.LG · stat.ML

Improving GANs Using Optimal Transport

classification 💻 cs.LG stat.ML
keywords distanceoptimaltransportdistributionenergyhighlymetricmini-batch
0
0 comments X
read the original abstract

We present Optimal Transport GAN (OT-GAN), a variant of generative adversarial nets minimizing a new metric measuring the distance between the generator distribution and the data distribution. This metric, which we call mini-batch energy distance, combines optimal transport in primal form with an energy distance defined in an adversarially learned feature space, resulting in a highly discriminative distance function with unbiased mini-batch gradients. Experimentally we show OT-GAN to be highly stable when trained with large mini-batches, and we present state-of-the-art results on several popular benchmark problems for image generation.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Resistance Distance and Linearized Optimal Transport on Graphs

    math.OC 2024-04 unverdicted novelty 7.0

    Proves that the squared discrete transportation distance between nearby measures on a connected graph is bounded by the quadratic form of a reweighted Laplacian pseudoinverse, yielding a resistance distance with multi...

  2. Adversarial Computation of Optimal Transport Maps

    cs.LG 2019-06 unverdicted novelty 6.0

    A GAN with Wasserstein discriminator objective makes the generator follow the W2 geodesic to learn an optimal transport map.