On the robust learning mixtures of linear regressions

05/23/2023
by   Ying Huang, et al.
0

In this note, we consider the problem of robust learning mixtures of linear regressions. We connect mixtures of linear regressions and mixtures of Gaussians with a simple thresholding, so that a quasi-polynomial time algorithm can be obtained under some mild separation condition. This algorithm has significantly better robustness than the previous result.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/01/2021

Clustering Mixtures with Almost Optimal Separation in Polynomial Time

We consider the problem of clustering mixtures of mean-separated Gaussia...
research
07/12/2020

Robust Learning of Mixtures of Gaussians

We resolve one of the major outstanding problems in robust statistics. I...
research
11/06/2020

Settling the Robust Learnability of Mixtures of Gaussians

This work represents a natural coalescence of two important lines of wor...
research
11/20/2017

Mixture Models, Robustness, and Sum of Squares Proofs

We use the Sum of Squares method to develop new efficient algorithms for...
research
06/06/2020

Learning Mixtures of Plackett-Luce Models with Features from Top-l Orders

Plackett-Luce model (PL) is one of the most popular models for preferenc...
research
01/29/2023

Imbalanced Mixed Linear Regression

We consider the problem of mixed linear regression (MLR), where each obs...
research
08/17/2018

Efficiently Learning Mixtures of Mallows Models

Mixtures of Mallows models are a popular generative model for ranking da...

Please sign up or login with your details

Forgot password? Click here to reset