Robust Low-Complexity Randomized Methods for Locating Outliers in Large Matrices
arXiv:1612.02334
Abstract
This paper examines the problem of locating outlier columns in a large, otherwise low-rank matrix, in settings where {}{the data} are noisy, or where the overall matrix has missing elements. We propose a randomized two-step inference framework, and establish sufficient conditions on the required sample complexities under which these methods succeed (with high probability) in accurately locating the outliers for each task. Comprehensive numerical experimental results are provided to verify the theoretical bounds and demonstrate the computational efficiency of the proposed algorithm.
16 pages, 4 figures
References in corpus (8)
- A geometric analysis of subspace clustering with outliers
- Support union recovery in high-dimensional multivariate regression
- A Novel M-Estimator for Robust PCA
- Randomized Robust Subspace Recovery for High Dimensional Data Matrices
- Sketched SVD: Recovering Spectral Features from Compressive Measurements
- Identifying Outliers in Large Matrices via Randomized Adaptive Compressive Sampling
- Multistage Adaptive Estimation of Sparse Signals
- On the Power of Adaptivity in Matrix Completion and Approximation