mlsanityData to 14 Oct 2026

Tractable and Near-Optimal Adversarial Algorithms for Robust Estimation in Contaminated Gaussian Models

arXiv 2112.12919 ↗First posted 24 Dec 2021math.ST stat.ML stat.THcited by 2

Not on the map. Why?

Abstract (arXiv)

Consider the problem of simultaneous estimation of location and variance matrix under Huber's contaminated Gaussian model. First, we study minimum f-divergence estimation at the population level, corresponding to a generative adversarial method with a nonparametric discriminator and establish conditions on f-divergences which lead to robust estimation, similarly to robustness of minimum distance estimation. More importantly, we develop tractable adversarial algorithms with simple spline discriminators, which can be implemented via nested optimization such that the discriminator parameters can be fully updated by maximizing a concave objective function given the current generator. The proposed methods are shown to achieve minimax optimal rates or near-optimal rates depending on the f-divergence and the penalty used. This is the first time such near-optimal error rates are established for adversarial algorithms with linear discriminators under Huber's contamination model. We present simulation studies to demonstrate advantages of the proposed methods over classic robust estimators, pairwise methods, and a generative adversarial method with neural network discriminators.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 6 of its 51 references that are in the map. First posted on arXiv 24 Dec 2021.

Builds on

6 of 51 references.

References · 6

  1. 2017Geometric GANcited by 233
  2. 2016Agnostic Estimation of Mean and Covariancecited by 131
  3. 2017Regularized calibrated estimation of propensity scores with model misspecification and high-dimensional datacited by 15
  4. 2015Robust estimation of precision matrices under cellwise contaminationcited by 5
  5. 2018Robust Estimation and Generative Adversarial Netscited by 5
  6. 2020On loss functions and regret bounds for multi-category classificationcited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 2.

2 papers.