AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

Minimax Optimality (Probably) Doesn't Imply Distribution Learning for GANs

ICLR 2022 · Learning theory and algorithms › Sample complexity · approach: Statistical analysis of GAN estimators · 1 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 local-PRG-based generator with a Gaussian seed instead of sampling the target distributionReLU GAN generator · Diverse continuous target distributionsWasserstein-1 distance: ≥ Ω(1)Hurt
Use a local-PRG-based generator with a Gaussian seed instead of sampling the target distributionReLU GAN generator · Diverse continuous target distributionsPolynomial-size ReLU discriminator IPM: ≤ ε(m)·poly(m)No clear effect
Generate uniform-hypercube samples using a local PRGLocal-PRG generator G_m · Uniform distribution U_dWasserstein-1 distance: ≥ 1Hurt
Generate uniform-hypercube samples using a local PRGLocal-PRG generator G_m · Uniform distribution U_dPolynomial-size ReLU discriminator IPM: ≤ negl(m)No clear effect
Construct an explicit generator that fools the specified ReLU discriminator classContinuous-domain GAN generator · Uniform distribution I_dReLU discriminator IPM: ≤ ε(m)Mixed

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