A New Robust Subspace Recovery Algorithm (Student Abstract)

A common task in data analysis is to compute an approximate embedding of the data in a low dimensional subspace. Robust Subspace Recovery computes the embedding by ignoring a fraction of the data considered as outliers. Its performance can be evaluated by how accurate the inliers are represented. We propose a new algorithm that outperforms the current state of the art when the data is dominated by outliers. The main idea is to rank each point by evaluating the change in the global PCA error when that point is considered as an outlier. We show that this lookahead procedure can be implemented efficiently by centered rank-one modifications. Our Approach A fundamental part in our approach is to assign a value to each point, indicating how likely it is to be an outlier. We compute this as the error of the entire PCA model "if"