List-Decodable Mean Estimation in Nearly-PCA Time

Daniel Kongsgaard
Daniel Kongsgaard
Kevin Tian
Kevin Tian
Cited by: 0|Bibtex|Views5
Other Links: arxiv.org

Abstract:

Traditionally, robust statistics has focused on designing estimators tolerant to a minority of contaminated data. Robust list-decodable learning focuses on the more challenging regime where only a minority $\frac 1 k$ fraction of the dataset is drawn from the distribution of interest, and no assumptions are made on the remaining data. W...More

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments