Robustly Clustering a Mixture of Gaussians

11/26/2019
by   He Jia, et al.
0

We give an efficient algorithm for robustly clustering of a mixture of arbitrary Gaussians, a central open problem in the theory of computationally efficient robust estimation, assuming only that for each pair of component Gaussians, their means are well-separated or their covariances are well-separated.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/03/2020

Robustly Learning Mixtures of k Arbitrary Gaussians

We give a polynomial-time algorithm for the problem of robustly estimati...
research
10/31/2017

On Learning Mixtures of Well-Separated Gaussians

We consider the problem of efficiently learning mixtures of a large numb...
research
03/04/2023

Bayesian clustering of high-dimensional data via latent repulsive mixtures

Model-based clustering of moderate or large dimensional data is notoriou...
research
05/15/2020

Efficiently Learning Adversarially Robust Halfspaces with Noise

We study the problem of learning adversarially robust halfspaces in the ...
research
05/06/2020

Outlier-Robust Clustering of Non-Spherical Mixtures

We give the first outlier-robust efficient algorithm for clustering a mi...
research
06/25/2012

Learning mixtures of spherical Gaussians: moment methods and spectral decompositions

This work provides a computationally efficient and statistically consist...
research
03/02/2022

Near-Optimal Correlation Clustering with Privacy

Correlation clustering is a central problem in unsupervised learning, wi...

Please sign up or login with your details

Forgot password? Click here to reset