Low rank approximation and regression in input sparsity time

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2013, Pages 81-90

  Clarkson, Kenneth L ^a   Woodruff, David P ^a  

^a IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

Algorithms; Theory

Indexed keywords

DIAGONAL MATRICES; EMBEDDING MATRICES; LEAST SQUARES REGRESSION; LOW RANK APPROXIMATIONS; OVER-CONSTRAINED; POLYNOMIAL FACTOR; RELATIVE ERRORS; THEORY;

ALGORITHMS; APPROXIMATION THEORY; COMPUTATION THEORY; MATRIX ALGEBRA; PROBABILITY DISTRIBUTIONS; REGRESSION ANALYSIS; VECTORS;

APPROXIMATION ALGORITHMS;

EID: 84879805132     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2488608.2488620     Document Type: Conference Paper

References (49)

1. Dimitris Achlioptas, Amos Fiat, Anna R. Karlin, and Frank McSherry. Web search via hub synthesis. In FOCS, pages 500-509, 2001.
2. Dimitris Achlioptas and Frank McSherry. On spectral learning of mixtures of distributions. In COLT, pages 458-469, 2005.
3. Dimitris Achlioptas and Frank McSherry. Fast computation of low-rank matrix approximations. J. ACM, 54(2), 2007.
4. Sanjeev Arora, Elad Hazan, and Satyen Kale. A fast random sampling algorithm for sparsifying matrices. In APPROX-RANDOM, pages 272-279, 2006.
5. Yossi Azar, Amos Fiat, Anna R. Karlin, Frank McSherry, and Jared Saia. Spectral analysis of data. In STOC, pages 619-626, 2001.
6. Moses Charikar, Kevin Chen, and Martin Farach-Colton. Finding frequent items in data streams. Theor. Comput. Sci., 312(1):3-15, 2004.
7. Ho Yee Cheung, Tsz Chiu Kwok, and Lap Chi Lau. Fast matrix rank algorithms and applications. In STOC, pages 549-562, 2012.
8. K. Clarkson, P. Drineas, Malik Magdon-Ismail, M. Mahoney, Xiangrui Meng, and David P. Woodruff. The fast cauchy transform and faster robust linear regression. In SODA, 2013.
9. Kenneth L. Clarkson and David P. Woodruff. Numerical linear algebra in the streaming model. In STOC, pages 205-214, 2009.
10. Anirban Dasgupta, Petros Drineas, Boulos Harb, Ravi Kumar, and Michael W. Mahoney. Sampling algorithms and coresets for lp regression. SIAM J. Comput., 38(5):2060-2078, 2009.
11. Anirban Dasgupta, Ravi Kumar, and Tamás Sarlós. A sparse Johnson-Lindenstrauss transform. In STOC, pages 341-350, 2010.
12. Amit Deshpande, Luis Rademacher, Santosh Vempala, and Grant Wang. Matrix approximation and projective clustering via volume sampling. In SODA, pages 1117-1126, 2006.
13. Amit Deshpande and Santosh Vempala. Adaptive sampling and fast low-rank matrix approximation. In APPROX-RANDOM, pages 292-303, 2006.
14. Petros Drineas, Alan M. Frieze, Ravi Kannan, Santosh Vempala, and V. Vinay. Clustering large graphs via the singular value decomposition. Machine Learning, 56(1-3):9-33, 2004.
15. Petros Drineas, Ravi Kannan, and Michael W. Mahoney. Fast Monte Carlo algorithms for matrices I: Approximating matrix multiplication. SIAM J. Comput., 36(1):132-157, 2006.
16. Petros Drineas, Ravi Kannan, and Michael W. Mahoney. Fast Monte Carlo algorithms for matrices II: Computing a low-rank approximation to a matrix. SIAM J. Comput., 36(1):158-183, 2006.
17. Petros Drineas, Ravi Kannan, and Michael W. Mahoney. Fast Monte Carlo algorithms for matrices III: Computing a compressed approximate matrix decomposition. SIAM J. Comput., 36(1):184-206, 2006.
18. Petros Drineas, Iordanis Kerenidis, and Prabhakar Raghavan. Competitive recommendation systems. In STOC, pages 82-90, 2002.
19. Petros Drineas, Malik Magdon-Ismail, Michael W. Mahoney, and David P. Woodruff. Fast approximation of matrix coherence and statistical leverage. CoRR, abs/1109.3843, 2011.
20. Petros Drineas, Michael Mahoney, Malik Magdon-Ismail, and David P. Woodruff. Fast approximation of matrix coherence and statistical leverage. In ICML, 2012.
21. Petros Drineas and Michael W. Mahoney. Approximating a Gram matrix for improved kernel-based learning. In COLT, pages 323-337, 2005.
22. Petros Drineas, Michael W. Mahoney, and S. Muthukrishnan. Sampling algorithms for l2 regression and applications. In SODA, pages 1127-1136, 2006.
23. Petros Drineas, Michael W. Mahoney, and S. Muthukrishnan. Subspace sampling and relative-error matrix approximation: Column-based methods. In APPROX-RANDOM, pages 316-326, 2006.
24. Petros Drineas, Michael W. Mahoney, and S. Muthukrishnan. Subspace sampling and relative-error matrix approximation: Column-row-based methods. In ESA, pages 304-314, 2006.
25. Petros Drineas, Michael W. Mahoney, S. Muthukrishnan, and Tamás Sarlós. Faster least squares approximation. CoRR, abs/0710.1435, 2007.
26. Alan M. Frieze, Ravi Kannan, and Santosh Vempala. Fast Monte-Carlo algorithms for finding low-rank approximations. J. ACM, 51(6):1025-1041, 2004.
27. N. Halko, P.-G. Martinsson, and J. A. Tropp. Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions. ArXiv e-prints, September 2009.
28. D.L. Hanson and F.T. Wright. A bound on tail probabilities for quadratic forms in independent random variables. The Annals of Mathematical Statistics, 42(3):1079-1083, 1971.
29. Daniel M. Kane and Jelani Nelson. Sparser Johnson-Lindenstrauss transforms. In SODA, pages 1195-1206, 2012.
30. Daniel M. Kane, Jelani Nelson, Ely Porat, and David P. Woodruff. Fast moment estimation in data streams in optimal space. In STOC, pages 745-754, 2011.
31. Ravindran Kannan, Hadi Salmasian, and Santosh Vempala. The spectral method for general mixture models. SIAM J. Comput., 38(3):1141-1156, 2008.
32. Jon M. Kleinberg. Authoritative sources in a hyperlinked environment. J. ACM, 46(5):604-632, 1999.
33. Avner Magen and Anastasios Zouzias. Low rank matrix-valued Chernoff bounds and approximate matrix multiplication. In SODA, pages 1422-1436, 2011.
34. Frank McSherry. Spectral partitioning of random graphs. In FOCS, pages 529-537, 2001.
35. X. Meng and M. W. Mahoney. Low-distortion Subspace Embeddings in Input-sparsity Time and Applications to Robust Linear Regression. ArXiv e-prints, October 2012.
36. Gary L. Miller and Richard Peng. Iterative approaches to row sampling. CoRR, abs/1211.2713, 2012.
37. Jelani Nelson and Huy L. Nguyen. OSNAP: Faster numerical linear algebra algorithms via sparser subspace embeddings. CoRR, abs/1211.1002, 2012.
38. Jelani Nelson and David P. Woodruff. Fast Manhattan sketches in data streams. In PODS, pages 99-110, 2010.
39. Nam H. Nguyen, Thong T. Do, and Trac D. Tran. A fast and efficient algorithm for low-rank approximation of a matrix. In STOC, pages 215-224, 2009.
40. Christos H. Papadimitriou, Prabhakar Raghavan, Hisao Tamaki, and Santosh Vempala. Latent semantic indexing: A probabilistic analysis. J. Comput. Syst. Sci., 61(2):217-235, 2000.
41. Saurabh Paul, Christos Boutsidis, Malik Magdon-Ismail, and Petros Drineas. Random projections for support vector machines. CoRR, abs/1211.6085, 2012.
42. Benjamin Recht. A simpler approach to matrix completion. CoRR, abs/0910.0651, 2009.
43. M. Rudelson. Random vectors in the isotropic position. Journal of Functional Analysis, 164(1):60-72, 1999.
44. Mark Rudelson and Roman Vershynin. Sampling from large matrices: An approach through geometric functional analysis. J. ACM, 54(4), 2007.
45. Tamás Sarlós. Improved approximation algorithms for large matrices via random projections. In FOCS, pages 143-152, 2006.
46. Mikkel Thorup and Yin Zhang. Tabulation based 4-universal hashing with applications to second moment estimation. In SODA, pages 615-624, 2004.
47. Lloyd N. Trefethen and David Bau. Numerical linear algebra. SIAM, 1997.
48. Anastasios Zouzias. A matrix hyperbolic cosine algorithm and applications. CoRR, abs/1103.2793, 2011.
49. Anastasios Zouzias and Nikolaos M. Freris. Randomized extended Kaczmarz for solving least-squares. CoRR, abs/1205.5770, 2012.