atlas

Research map / Learning theory and algorithms / Optimal transport

A Two-Step Computation of the Exact GAN Wasserstein Distance

ICML 2018 · Learning theory and algorithms › Optimal transport · approach: Wasserstein losses for generative models · 23 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
Replace weight clipping/penalty critic with two-step LP + DNN regression (WGAN-TS)WGAN critic · 8 Gaussian toyaccuracy of approximated Wasserstein distanceHelped
Replace WGAN-GP critic penalty with two-step LP + DNN regressionWGAN-GP critic · CIFAR-10Inception score: +0.14Helped
Replace WGAN-GP critic penalty with two-step LP + DNN regressionWGAN-GP critic · MNISTInception score: +0.01No clear effect
Replace WGAN-GP critic with two-step methodcritic time per generator iteration · CIFAR-10critic time (s): 0.881 to 0.278Helped
Use two-step method instead of weight clippingWGAN · MNISTInception score: +0.71Helped
Use two-step method instead of weight clippingWGAN · CIFAR-10Inception score: +0.36Helped
Weight scaling of critic after each update to satisfy constraintsWGAN-TS · LSUNfraction of beta equal to 1No clear effect

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