Robust and Scalable Column/Row Sampling from Corrupted Big Data
arXiv:1611.05977
Abstract
Conventional sampling techniques fall short of drawing descriptive sketches of the data when the data is grossly corrupted as such corruptions break the low rank structure required for them to perform satisfactorily. In this paper, we present new sampling algorithms which can locate the informative columns in presence of severe data corruptions. In addition, we develop new scalable randomized designs of the proposed algorithms. The proposed approach is simultaneously robust to sparse corruption and outliers and substantially outperforms the state-of-the-art robust sampling algorithms as demonstrated by experiments conducted using both real and synthetic data.
References in corpus (7)
- Prototype selection for interpretable classification
- Robust PCA via Outlier Pursuit
- A convex model for non-negative matrix factorization and dimensionality reduction on physical space
- Coherence Pursuit: Fast, Simple, and Robust Principal Component Analysis
- High Dimensional Low Rank plus Sparse Matrix Decomposition
- Randomized Robust Subspace Recovery for High Dimensional Data Matrices
- Innovation Pursuit: A New Approach to Subspace Clustering