Near optimal column-based matrix reconstruction

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2011, Pages 305-314

  Boutsidis, Christos ^a   Drineas, Petros ^b   Magdon Ismail, Malik ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b RENSSELAER POLYTECHNIC INSTITUTE   (United States)

Author keywords

approximate SVD; low rank matrix approximation; spectral sparsification; subset selection; SVD

Indexed keywords

ASYMPTOTICALLY OPTIMAL; DETERMINISTIC ALGORITHMS; FROBENIUS NORM; LOW-RANK MATRICES; ORTHONORMAL; SPARSE REPRESENTATION; SPARSIFICATION; SPECTRAL NORMS; SUBSET SELECTION; SVD-LIKE DECOMPOSITION;

ALGORITHMS; SINGULAR VALUE DECOMPOSITION;

COMPUTER SCIENCE;

EID: 84863303500     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2011.21     Document Type: Conference Paper

References (24)

1. J.D. Batson, D.A. Spielman, and N. Srivastava. Twiceramanujan sparsifiers. In Proc. 41st STOC, pages 255-262, 2009.
2. C. Boutsidis, P. Drineas, and M. Magdon-Ismail. Nearoptimal Column-based Matrix Reconstruction. arXiv report: arxiv.org/abs/1103.0995, 2011.
3. T.F. Chan and P.C. Hansen. Some applications of the rank revealing QR factorization. SIAM Journal on Scientific and Statistical Computing, 13:727-741, 1992.
4. K.L. Clarkson and D.P. Woodruff. Numerical linear algebra in the streaming model. In Proc. 41st STOC, pages 205-214, 2009.
5. A. Deshpande and L. Rademacher. Efficient volume sampling for row/column subset selection. In Proc 42th STOC, pages 329-338, 2010.
6. A. Deshpande and K. R. Varadarajan. Sampling-based dimension reduction for subspace approximation. In Proc. 39th STOC, pages 641-650, 2007.
7. A. Deshpande and S. Vempala. Adaptive sampling and fast low-rank matrix approximation. In RANDOM - APPROX, 2006.
8. Amit Deshpande, Luis Rademacher, Santosh Vempala, and Grant Wang. Matrix approximation and projective clustering via volume sampling. Theory of Computing, 2(12):225-247, 2006.
9. P. Drineas, A. Frieze, R. Kannan, S. Vempala, and V. Vinay. Clustering in large graphs and matrices. In Proc. 10th SODA, pages 291-299, 1999.
10. P. Drineas, I. Kerenidis, and P. Raghavan. Competitive recommendation systems. In Proc 34th STOC, pages 82-90, 2002.
11. P. Drineas, M.W. Mahoney, and S. Muthukrishnan. Polynomial time algorithm for column-row based relative-error low-rank matrix approximation. Technical Report 2006-04, DIMACS, March 2006.
12. D. Feldman and M. Langberg. A unified framework for approximating and clustering data. In Proc. 43rd STOC, 2011.
13. D. Feldman, M. Monemizadeh, C. Sohler, and D. Woodruf. Coresets and sketches for high dimensional subspace approximation problems. In Proc. 21st SODA, pages 630-649, 2010.
14. A. Frieze, R. Kannan, and S. Vempala. Fast Monte-Carlo algorithms for finding low-rank approximations. In Proc. 39th FOCS, pages 370-378, 1998.
15. G. Golub. Numerical methods for solving linear least squares problems. Numerische Mathematik, 7:206-216, 1965.
16. M. Gu and S.C. Eisenstat. Efficient algorithms for computing a strong rank-revealing QR factorization. SIAM Journal on Scientific Computing, 17:848-869, 1996. (Pubitemid 126621180)
17. V. Guruswami and A. K. Sinop. Optimal column-based low-rank matrix reconstruction. arXiv report: arXiv:1104.1732v1, http://arxiv.org/abs/1104.1732, April 09 2011.
18. N. Halko, P.G. Martinsson, and J.A. Tropp. Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions. SIAM Review, 2011.
19. E. Liberty, F. Woolfe, P.G. Martinsson, V. Rokhlin, and M. Tygert. Randomized algorithms for the low-rank approximation of matrices. Proceedings of the National Academy of Sciences, 104(51):20167-20172, 2007.
20. M. W. Mahoney and P. Drineas. CUR matrix decompositions for improved data analysis. In Proc. PNAS, 106:697-702, 2009.
21. V. Rokhlin, A. Szlam, and M. Tygert. A randomized algorithm for principal component analysis. SIAM Journal on Matrix Analysis and Applications, 31(3):1100-1124, 2009.
22. T. Sarlos. Improved approximation algorithms for large matrices via random projections. In Proc. 47th FOCS, pages 143-152, 2006.
23. N. D. Shyamalkumar and K. R. Varadarajan. Efficient subspace approximation algorithms. In Proc. 18th SODA, pages 532-540, 2007.
24. A. Zouzias. arXiv report: arXiv:1103.2793v1, http://arxiv.org/abs/1103. 2793.