atlas

Research map / Learning theory and algorithms / Optimal transport

A Gradual, Semi-Discrete Approach to Generative Network Training via Explicit Wasserstein Minimization

ICML 2019 · Learning theory and algorithms › Optimal transport · approach: Wasserstein losses for generative models · 4 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 alternating OTS and FIT instead of fitting once to the initial transport plan (ablation)Proposed generative method · MNISTvisual qualityHelped
Use alternating OTS and FIT instead of fitting once to the initial transport plan (ablation)Proposed generative method · synthetic examplemanifold smoothnessHelped
Apply the proposed method rather than WAEMLP generator · MNIST trainingWD: 90.91 -> 66.68Helped
Apply the proposed method rather than WGANGPMLP generator · MNIST trainingFID: 8.46 -> 3.21Helped
Apply the proposed method rather than WGANGPDCGAN generator · MNIST testNND-WC: 0.07 -> 0.09Hurt
Apply the proposed method rather than WAEDCGAN generator · Thin-8WD: 1950 -> 923Helped
Apply the proposed method rather than WGANGPDCGAN generator · Thin-8NND-GP: 79.47 -> 47.59Helped
Minimize pixel-wise Wasserstein distance rather than use an adversarial objectiveGenerative models · CIFAR10visual qualityHurt
Use the proposed method rather than WGAN-GPGenerative models · CIFAR10WD: 849 -> 655Helped

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