atlas

Research map / Learning theory and algorithms / Optimal transport

On the Convergence and Robustness of Training GANs with Regularized Optimal Transport

NeurIPS 2018 · Learning theory and algorithms › Optimal transport · approach: Wasserstein losses for generative models · 58 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use a learned latent representation for the cost instead of pixel-space cost (ablation)SWGAN on MNIST · MNISTgenerated image qualityHelped
Use Sinkhorn loss instead of regularized OT as the generator objective (ablation)SWGAN with L1 cost on MNIST · MNISTgenerated image qualityHelped
Use regularized OT rather than Sinkhorn loss as the generator objective (ablation)SWGAN on CIFAR-10 · CIFAR-10generated image qualityHurt
Use L1 cost rather than Cosine cost (ablation)Latent Sinkhorn loss SWGAN · CIFAR-10inception score convergenceHelped
Use Cosine cost rather than L1 cost (ablation)Latent Sinkhorn loss SWGAN · CIFAR-10visual appeal of generated samplesHelped
Use SWGAN instead of the compared OT-GAN and Sinkhorn solver methodsGAN image generation · MNISTgenerated image qualityHelped
Use SWGAN instead of the compared algorithmsGAN image generation · CIFAR-10inception score convergenceHelped
Use a small regularization weight for the regularized OT objective (ablation)SWGAN · GAN trainingtraining stabilityHurt

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy