AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

Nonparametric Density Estimation & Convergence Rates for GANs under Besov IPM Losses

NeurIPS 2019 · Learning theory and algorithms › Sample complexity · approach: Statistical analysis of GAN estimators · 7 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 wavelet-thresholding rather than a linear density estimatorBesov density estimation under Besov IPM losses · Besov density classesBesov IPM riskHelped
Use a sufficiently large ReLU GAN with wavelet-thresholding regularizationBesov density estimation · Smooth Besov density and discriminator classesBesov IPM riskHelped
Use linear estimators instead of estimators that adapt to inhomogeneous smoothnessBesov density estimation under Besov IPM losses · Besov density classes where linear estimators are sub-optimalBesov IPM riskHurt
Use a weaker Besov IPM loss rather than a traditional L^p lossNonparametric distribution estimation · Besov distribution classesConvergence rateHelped

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