AI Chat AI Image Generator AI Video Text to Speech

Robust Learning of Mixtures of Gaussians

07/12/2020

∙

by Daniel M. Kane, et al.

∙

∙

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 -fraction of which have been adversarially corrupted, learns X to error () in total variation distance.

page 1

page 2

page 3

page 4

research

∙ 05/13/2020

Robustly Learning any Clusterable Mixture of Gaussians

We study the efficient learnability of high-dimensional Gaussian mixture...

6 Ilias Diakonikolas, et al. ∙

research

∙ 11/06/2020

Settling the Robust Learnability of Mixtures of Gaussians

This work represents a natural coalescence of two important lines of wor...

0 Allen Liu, et al. ∙

research

∙ 05/23/2023

On the robust learning mixtures of linear regressions

In this note, we consider the problem of robust learning mixtures of lin...

0 Ying Huang, et al. ∙

research

∙ 02/23/2023

Beyond Moments: Robustly Learning Affine Transformations with Asymptotically Optimal Error

We present a polynomial-time algorithm for robustly learning an unknown ...

0 He Jia, et al. ∙

research

∙ 06/03/2021

Privately Learning Mixtures of Axis-Aligned Gaussians

We consider the problem of learning mixtures of Gaussians under the cons...

0 Ishaq Aden-Ali, et al. ∙

research

∙ 05/06/2020

Outlier-Robust Clustering of Non-Spherical Mixtures

We give the first outlier-robust efficient algorithm for clustering a mi...

0 Ainesh Bakshi, et al. ∙

research

∙ 12/03/2020

Robustly Learning Mixtures of k Arbitrary Gaussians

We give a polynomial-time algorithm for the problem of robustly estimati...

3 Ainesh Bakshi, et al. ∙