Near-optimal column-based matrix reconstruction

SIAM Journal on Computing

Volumn 43, Issue 2, 2014, Pages 687-717

  Boutsidis, Christos ^a   Drineas, Petros ^a   Magdon ismail, Malik ^a  

^a RENSSELAER POLYTECHNIC INSTITUTE   (United States)

Author keywords

Low rank approximations; Numerical linear algebra; Randomized algorithms

Indexed keywords

APPROXIMATION THEORY; LINEAR ALGEBRA;

ASYMPTOTICALLY OPTIMAL; DETERMINISTIC ALGORITHMS; FROBENIUS NORM; LOW RANK APPROXIMATIONS; NUMERICAL LINEAR ALGEBRA; RANDOMIZED ALGORITHMS; SPARSE REPRESENTATION; SVD-LIKE DECOMPOSITION;

APPROXIMATION ALGORITHMS;

EID: 84899628186     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/12086755X     Document Type: Conference Paper

References (26)

1. H. Avron and C. Boutsidis, Faster subset selection for matrices and applications, SIAM J. Matrix Anal. Appl., 34 (2013), pp. 1464-1499.
2. J.D. Batson, D.A. Spielman, and N. Srivastava, Twice-Ramanujan sparsifiers, in Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC), 2009, pp. 255-262.
3. C. Boutsidis, M.W. Mahoney, and P. Drineas, An improved approximation algorithm for the column subset selection problem, in Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2009, pp. 968-977.
4. T.F. Chan and P.C. Hansen, Some applications of the rank revealing QR factorization, SIAM J. Sci. Statist. Comput., 13 (1992), pp. 727-741.
5. K.L. Clarkson and D.P. Woodruff, Numerical linear algebra in the streaming model, in Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC), 2009.
6. A. Deshpande and L. Rademacher, Efficient volume sampling for row/column subset selection, in Proceedings of the 42nd Annual ACM Symposium on Theory of Computing (STOC), 2010.
7. A. Deshpande, L. Rademacher, S. Vempala, and G. Wang, Matrix approximation and projective clustering via volume sampling, Theory Comput., 2 (2006), pp. 225-247.
8. A. Deshpande and K.R. Varadarajan, Sampling-based dimension reduction for subspace approximation, in Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC), 2007.
9. A. Deshpande and S. Vempala, Adaptive sampling and fast low-rank matrix approximation, in Proceedings of RANDOM-APPROX, 2006.
10. P. Drineas, A. Frieze, R. Kannan, S. Vempala, and V. Vinay, Clustering in large graphs and matrices, in Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1999, pp. 291-299.
11. P. Drineas, I. Kerenidis, and P. Raghavan, Competitive recommendation systems, in Proceedings of 34th Annual ACM Symposium on Theory of Computing (STOC), 2002.
12. P. Drineas, M.W. Mahoney, and S. Muthukrishnan, Polynomial Time Algorithm for Column-Row Based Relative-Error Low-Rank Matrix Approximation, Report, DIMACS, 2006.
13. D. Feldman and M. Langberg, A unified framework for approximating and clustering data, in Proceedings of the 43rd Annual ACM Symposium on Theory of Computing (STOC), 2011.
14. D. Feldman, M. Monemizadeh, C. Sohler, and D.P. Woodruff, Coresets and sketches for high dimensional subspace approximation problems, in Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2010, pp. 630-649.
15. A. Frieze, R. Kannan, and S. Vempala, Fast Monte-Carlo algorithms for finding low-rank approximations, in Proceedings from the 39th Annual Symposium on Foundations of Computer Science (FOCS), 1998.
16. G. Golub, Numerical methods for solving linear least squares problems, Numer. Math., 7 (1965), pp. 206-216.
17. M. Gu and S.C. Eisenstat, Efficient algorithms for computing a strong rank-revealing QR factorization, SIAM J. Sci. Comput., 17 (1996), pp. 848-869.
18. V. Guruswami and A.K. Sinop, Optimal column-based low-rank matrix reconstruction, in Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2012, pp. 1207-1214.
19. N. Halko, P.G. Martinsson, and J.A. Tropp, Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions, SIAM Rev., 53 (2011), pp. 217-288.
20. E. Liberty, F. Woolfe, P.G. Martinsson, V. Rokhlin, and M. Tygert, Randomized algorithms for the low-rank approximation of matrices, Proc. Natl. Acad. Sci. USA, 104 (2007), pp. 20167-20172.
21. M.W. Mahoney and P. Drineas, CUR matrix decompositions for improved data analysis, Proc. Natl. Acad. Sci. USA, 106 (2009), pp. 697-702.
22. V. Rokhlin, A. Szlam, and M. Tygert, A randomized algorithm for principal component analysis, SIAM J. Matrix Anal. Appl., 31 (2009), pp. 1100-1124.
23. T. Sarlos, Improved approximation algorithms for large matrices via random projections, in Proceedings of the 47th Annual Symposium on Foundations of Computer Science (FOCS), 2006.
24. N.D. Shyamalkumar and K. Varadarajan, Efficient subspace approximation algorithms, in Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2007, pp. 532-540.
25. D. Szyld, The many proofs of an identity on the norm of oblique projections, Numer. Algorithms, 42 (2006), pp. 309-323.
26. A. Zouzias, A matrix hyperbolic cosine algorithm and applications, in Proceedings of the 39th International Colloquium on Automata, Languages and Programming (ICALP), 2012.