NeurIPS 2019spotlight98 citations
List-decodable Linear Regression
Sushrut Karmalkar, Adam Klivans, Pravesh Kothari
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.
BibTeX
@inproceedings{NEURIPS2019_7f5fc754,
author = {Karmalkar, Sushrut and Klivans, Adam and Kothari, Pravesh},
booktitle = {Advances in Neural Information Processing Systems},
editor = {H. Wallach and H. Larochelle and A. Beygelzimer and F. d\textquotesingle Alch\'{e}-Buc and E. Fox and R. Garnett},
pages = {},
publisher = {Curran Associates, Inc.},
title = {List-decodable Linear Regression},
url = {https://proceedings.neurips.cc/paper_files/paper/2019/file/7f5fc754c7af0a6370c9bf91314e79f4-Paper.pdf},
volume = {32},
year = {2019}
}