atlas

Research map / Optimization / Nonconvex and smooth optimization

Hidden Convexity of Wasserstein GANs: Interpretable Generative Models with Closed-Form Solutions

ICLR 2022 · Optimization › Nonconvex and smooth optimization · approach: Gradient descent ascent for minimax · 3 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 ProCoGAN instead of Progressive GDALinear generators with quadratic discriminators · CelebAFID: 194.1 ± 4.5 -> 128.4 ± 0.4Helped
Use ProCoGAN instead of Progressive GDALinear generators with quadratic discriminators · CelebAtraining time (seconds): 11696 ± 81 -> 153 ± 3 secondsHelped
Increase β_d^(4), β_d^(5) from (7.2×10^3, 1.0×10^4) to (1.9×10^4, 3.3×10^4) (ablation)ProCoGAN · CelebAFID: 128.4 ± 0.4 -> 147.1 ± 2.4Hurt
Increase discriminator penalty β_d (ablation)ProCoGAN · CelebA generated facesimage diversityHurt
Increase discriminator penalty β_d (ablation)ProCoGAN · CelebA generated facesimage fidelityHelped
Increase generator penalty β_g (ablation)Progressive GDA · CelebA generated facesimage diversityHurt
Increase generator penalty β_g (ablation)Progressive GDA · CelebA generated facesimage noiseHelped

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