Research map / Learning theory and algorithms / Sample complexity
Rates of convergence for density estimation with generative adversarial networks
Nikita Puchkin, Sergey Samsonov, Denis Belomestny, Eric Moulines, Alexey Naumov
Read the paperCheck your idea against 137,217 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.
Closest papers by meaning
- Nonparametric Density Estimation under Adversarial Losses (NeurIPS 2018 · similarity 0.92)
- Nonparametric Density Estimation & Convergence Rates for GANs under Besov IPM Losses (NeurIPS 2019 · similarity 0.92)
- An Error Analysis of Generative Adversarial Networks for Learning Distributions (JMLR 2022 · similarity 0.91)
- How Well Generative Adversarial Networks Learn Distributions (JMLR 2021 · similarity 0.90)
- Approximation and Convergence Properties of Generative Adversarial Learning (NeurIPS 2017 · similarity 0.89)
- Statistically Optimal Generative Modeling with Maximum Deviation from the Empirical Distribution (ICML 2024 · similarity 0.87)
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.
