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.

Authors

• Guihong Wan Departments of Biostatistics and Epidemiology, Harvard T. H. Chan School of Public Health, MA, USA Department of Dermatology, Massachusetts General Hospital, Harvard Medical School, MA, USA
• Haim Schweitzer Department of Computer Science, University of Texas at Dallas, Texas, USA

Keywords

No keywords are indexed for this paper.