# List-Decodable Linear Regression

Karmalkar Sushrut
Cited by: 0|Views21

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 $\alpha < 1$, our algorithm takes as input a sample $\{ (x_i,y_i)\}_{i \leq n}$ of $n$ linear equations where $\alpha n$ of the equations satisfy \$y_i = \langle...More

Code:

Data:

Full Text
Bibtex