paper-with-me

Papers

Nonparametric Density Estimation under Adversarial Losses

2018-05-22 · NeurIPS 2018 12 · Shashank Singh, Ananya Uppal, Boyue Li, Chun-Liang Li, Manzil Zaheer, Barnabás Póczos

We study minimax convergence rates of nonparametric density estimation under a large class of loss functions called "adversarial losses", which, besides classical $\mathcal{L}^p$ losses, includes maximum mean discrepancy (MMD), Wasserstein distance, and total variation distance. These losses are closely related to the losses encoded by discriminator networks in generative adversarial networks (GANs). In a general framework, we study how the choice of loss and the assumed smoothness of the underlying density together determine the minimax rate. We also discuss implications for training GANs based on deep ReLU networks, and more general connections to learning implicit generative models in a minimax statistical sense.

📄 PDF Abstract BibTeX arXiv:1805.08836

Code (0)

등록된 구현이 없습니다.

Tasks

Density Estimation

Similar Papers 제목 키워드 기반

Robust Density Estimation under Besov IPM Losses

2020-04-18 · NeurIPS 2020 12 · Ananya Uppal, Shashank Singh, Barnabas Poczos

We study minimax convergence rates of nonparametric density estimation in the Huber contamination model, in which a proportion of the data comes from an unknown outlier distribution. We provide the first results for this…

Density Estimation

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

2019-02-09 · NeurIPS 2019 12 · Ananya Uppal, Shashank Singh, Barnabás Póczos

We study the problem of estimating a nonparametric probability density under a large family of losses called Besov IPMs, which include, for example, $\mathcal{L}^p$ distances, total variation distance, and generalization…

Density Estimation

Robust Estimation for Nonparametric Families via Generative Adversarial Networks

2022-02-02 · Banghua Zhu, Jiantao Jiao, Michael I. Jordan

We provide a general framework for designing Generative Adversarial Networks (GANs) to solve high dimensional robust statistics problems, which aim at estimating unknown parameter of the true distribution given adversari…

scoring rule

Rates of convergence for density estimation with generative adversarial networks

2021-01-30 · Nikita Puchkin, Sergey Samsonov, Denis Belomestny, Eric Moulines 외

In this work we undertake a thorough study of the non-asymptotic properties of the vanilla generative adversarial networks (GANs). We prove an oracle inequality for the Jensen-Shannon (JS) divergence between the underlyi…

Density Estimation

Robust Kernel Density Estimation with Median-of-Means principle

2020-06-30 · Pierre Humbert, Batiste Le Bars, Ludovic Minvielle, Nicolas Vayatis

In this paper, we introduce a robust nonparametric density estimator combining the popular Kernel Density Estimation method and the Median-of-Means principle (MoM-KDE). This estimator is shown to achieve robustness to an…

Density Estimation