Memory limited, streaming PCA

Advances in Neural Information Processing Systems

Volumn , Issue , 2013, Pages

  Mitliagkas, Ioannis ^a   Caramanis, Constantine ^a   Jain, Prateek ^b  

^a The University of Texas at Austin   (United States)

^b MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; DIGITAL STORAGE; PRINCIPAL COMPONENT ANALYSIS; WHITE NOISE;

COVARIANCE MODELING; DIMENSIONAL SUBSPACE; HIGH-DIMENSIONAL; LIMITED MEMORY; MEMORY COMPLEXITY; NUMBER OF SAMPLES; SAMPLE COMPLEXITY; STANDARD ALGORITHMS;

ALGORITHMS;

EID: 84898955433     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. Arora, R., Cotter, A., Livescu, K., and Srebro, N. Stochastic optimization for PCA and PLS. In 50th Allerton Conference on Communication, Control, and Computing, Monticello, IL, 2012.
2. Balzano, L., Nowak, R., and Recht, B. Online identification and tracking of subspaces from highly incomplete information. In Communication, Control, and Computing (Allerton), 2010 48th Annual Allerton Conference on, pp. 704-711, 2010.
3. Brand, M. Fast low-rank modifications of the thin singular value decomposition. Linear algebra and its applications, 415(1):20-30, 2006.
4. Brand, Matthew. Incremental singular value decomposition of uncertain data with missing values. Computer Vision-ECCV 2002, pp. 707-720, 2002.
5. Clarkson, Kenneth L. andWoodruff, David P. Numerical linear algebra in the streaming model. In Proceedings of the 41st annual ACM symposium on Theory of computing, pp. 205-214, 2009.
6. Comon, P. and Golub, G. H. Tracking a few extreme singular values and vectors in signal processing. Proceedings of the IEEE, 78(8):1327-1343, 1990.
7. Golub, Gene H. and Van Loan, Charles F. Matrix computations, volume 3. JHUP, 2012.
8. Halko, Nathan, Martinsson, Per-Gunnar, and Tropp, Joel A. Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions. SIAM review, 53(2):217-288, 2011.
9. He, J., Balzano, L., and Lui, J. Online robust subspace tracking from partial information. arXiv preprint arXiv:1109.3827, 2011.
10. Herbster, Mark andWarmuth, Manfred K. Tracking the best linear predictor. The Journal of Machine Learning Research, 1:281-309, 2001.
11. Johnstone, IainM. On the distribution of the largest eigenvalue in principal components analysis.(english. Ann. Statist, 29(2):295-327, 2001.
12. Li, Y. On incremental and robust subspace learning. Pattern recognition, 37(7):1509-1518, 2004.
13. Mitliagkas, Ioannis, Caramanis, Constantine, and Jain, Prateek. Memory limited, streaming PCA. arXiv preprint arXiv:1307.0032, 2013.
14. Nadler, Boaz. Finite sample approximation results for principal component analysis: a matrix perturbation approach. The Annals of Statistics, pp. 2791-2817, 2008.
15. Porteous, Ian, Newman, David, Ihler, Alexander, Asuncion, Arthur, Smyth, Padhraic, and Welling, Max. Fast collapsed gibbs sampling for latent dirichlet allocation. In Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 569-577, 2008.
16. Robbins, Herbert and Monro, Sutton. A stochastic approximation method. The Annals of Mathematical Statistics, pp. 400-407, 1951.
17. Roweis, Sam. EM algorithms for PCA and SPCA. Advances in neural information processing systems, pp. 626-632, 1998.
18. Rudelson, Mark and Vershynin, Roman. Smallest singular value of a random rectangular matrix. Communications on Pure and Applied Mathematics, 62(12):1707-1739, 2009.
19. Tipping, Michael E. and Bishop, Christopher M. Probabilistic principal component analysis. Journal of the Royal Statistical Society: Series B (Statistical Methodology), 61(3):611-622, 1999.
20. Vershynin, R. How close is the sample covariance matrix to the actual covariance matrix? Journal of Theoretical Probability, pp. 1-32, 2010a.
21. Vershynin, Roman. Introduction to the non-asymptotic analysis of random matrices. arXiv preprint arXiv:1011.3027, 2010b.
22. Warmuth, Manfred K. and Kuzmin, Dima. Randomized online PCA algorithms with regret bounds that are logarithmic in the dimension. Journal of Machine Learning Research, 9:2287-2320, 2008.