Entropy-regularized Optimal Transport Generative Models

Abstract

We investigate the use of entropy-regularized optimal transport (EOT) cost in developing generative models to learn implicit distributions. Two generative models are proposed. One uses EOT cost directly in an one-shot optimization problem and the other uses EOT cost iteratively in an adversarial game. The proposed generative models show improved performance over contemporary models for image generation on MNSIT.

References in corpus (8)

• FaceNet: A Unified Embedding for Face Recognition and Clustering
• Unsupervised Representation Learning with Deep Convolutional Generative Adversarial Networks
• GANs Trained by a Two Time-Scale Update Rule Converge to a Local Nash Equilibrium
• Spectral Normalization for Generative Adversarial Networks
• Self-Attention Generative Adversarial Networks
• Fast Computation of Wasserstein Barycenters
• An empirical study on evaluation metrics of generative adversarial networks
• Geometric GAN