PCA in Sparse Data-Dependent Noise
暂无分享,去创建一个
[1] Constantine Caramanis,et al. Fast Algorithms for Robust PCA via Gradient Descent , 2016, NIPS.
[2] Namrata Vaswani,et al. Finite sample guarantees for PCA in non-isotropic and data-dependent noise , 2017, 2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[3] Namrata Vaswani,et al. Correlated-PCA: Principal Components' Analysis when Data and Noise are Correlated , 2016, NIPS.
[4] Namrata Vaswani,et al. MEDRoP: Memory-Efficient Dynamic Robust PCA , 2017, ArXiv.
[5] I. Johnstone. On the distribution of the largest eigenvalue in principal components analysis , 2001 .
[6] Prateek Jain,et al. Low-rank matrix completion using alternating minimization , 2012, STOC '13.
[7] Prateek Jain,et al. Non-convex Robust PCA , 2014, NIPS.
[8] Roman Vershynin,et al. Introduction to the non-asymptotic analysis of random matrices , 2010, Compressed Sensing.
[9] B. Nadler. Finite sample approximation results for principal component analysis: a matrix perturbation approach , 2009, 0901.3245.
[10] E. Candès. The restricted isometry property and its implications for compressed sensing , 2008 .
[11] Yi Ma,et al. Robust principal component analysis? , 2009, JACM.
[12] Namrata Vaswani,et al. Recursive robust PCA or recursive sparse recovery in large but structured noise , 2013, ICASSP.
[13] Prateek Jain,et al. Streaming PCA: Matching Matrix Bernstein and Near-Optimal Finite Sample Guarantees for Oja's Algorithm , 2016, COLT.
[14] Ioannis Mitliagkas,et al. Memory Limited, Streaming PCA , 2013, NIPS.