List-Decodable Linear Regression

Sushrut Karmalkar
Sushrut Karmalkar

NeurIPS, pp. 7423-7432, 2019.

Cited by: 24|Views31
EI

Abstract:

We give the first polynomial-time algorithm for robust regression in the list-decodable setting where an adversary can corrupt a greater than 1/2 fraction of examples. For any α < 1, our algorithm takes as input a sample {(x i , y i)} i≤n of n linear equations where αn of the equations satisfy y i = x i , * + ζ for some small noise ζ and ...More

Code:

Data:

Full Text
Bibtex
Your rating :
0

 

Tags
Comments