Robust Estimation for Nonparametric Families via Generative Adversarial Networks
원문 초록
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 adversarially corrupted samples. Prior work focus on the problem of robust mean and covariance estimation when the true distribution lies in the family of Gaussian distributions or elliptical distributions, and analyze depth or scoring rule based GAN losses for the problem. Our work extend these to robust mean estimation, second moment estimation, and robust linear regression when the true distribution only has bounded Orlicz norms, which includes the broad family of sub-Gaussian, sub-Exponential and bounded moment distributions. We also provide a different set of sufficient conditions for the GAN loss to work: we only require its induced distance function to be a cumulative density function of some light-tailed distribution, which is easily satisfied by neural networks with sigmoid activation. In terms of techniques, our proposed GAN losses can be viewed as a smoothed and generalized Kolmogorov-Smirnov distance, which overcomes the computational intractability of the original Kolmogorov-Smirnov distance used in the prior work.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
h-calibration: Rethinking Classifier Recalibration with Probabilistic Error-Bounded Objective
Enforcing tail calibration when training probabilistic forecast models
Harnessing Superclasses for Learning from Hierarchical Databases
Bayesian Autoregressive Online Change-Point Detection with Time-Varying Parameters
Improving probabilistic forecasts of extreme wind speeds by training statistical post-processing models with weighted scoring rules
Distributional Regression U-Nets for the Postprocessing of Precipitation Ensemble Forecasts
토론
이 논문과 연결된 포럼 글이 아직 없습니다.