mlsanityData to 7 Oct 2026

Robust Learning of Mixtures of Gaussians

arXiv 2007.05912 ↗First posted 12 Jul 2020cs.DS cs.LG math.STcited by 15

Not on the map. Why?

Abstract (arXiv)

We resolve one of the major outstanding problems in robust statistics. In particular, if X is an evenly weighted mixture of two arbitrary d-dimensional Gaussians, we devise a polynomial time algorithm that given access to samples from X an eps-fraction of which have been adversarially corrupted, learns X to error poly(eps) in total variation distance.

Key facts. Cited by 15 papers in the map (data through 7 Oct 2026). First posted on arXiv 12 Jul 2020.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 6; 2022: 1; 2023: 4; 2024: 1; 2025: 2; 2026: 1.

15 papers.

Sort:

By area: