Uniform sampling for matrix approximation

ITCS 2015 - Proceedings of the 6th Innovations in Theoretical Computer Science

Volumn , Issue , 2015, Pages 181-190

  Cohen, Michael B ^a   Lee, Yin Tat ^a   Musco, Cameron ^a   Musco, Christopher ^a   Peng, Richard ^a   Sidford, Aaron ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Leverage scores; Matrix sampling; Randomized numerical linear algebra; Regression

Indexed keywords

APPROXIMATION ALGORITHMS; ITERATIVE METHODS; LINEAR ALGEBRA; REGRESSION ANALYSIS;

LEVERAGE SCORES; MATRIX APPROXIMATION; NUMERICAL LINEAR ALGEBRA; PROBABILITY PROPORTIONAL; REGRESSION; SAMPLING ALGORITHM; THEORETICAL PERFORMANCE; UNIFORM SAMPLING;

MATRIX ALGEBRA;

EID: 84922209704     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2688073.2688113     Document Type: Conference Paper

References (29)

1. H. Avron, P. Maymounkov, and S. Toledo. Blendenpik: Supercharging LAPACK's least-squares solver. SIAM J. Scientific Computing, 32(3):1217-1236, 2010.
2. H. Avron and S. Toledo. Effective stiness: Generalizing effective resistance sampling to finite element matrices. Computing Research Repository (CoRR), abs/1110. 4437, 2011. arXiv:1110. 4437.
3. K. Clarkson and D. Woodru-. Numerical linear algebra in the streaming model. In Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC), pages 205-214, 2009.
4. K. L. Clarkson and D. P. Woodru-. Low rank approximation and regression in input sparsity time. In Proceedings of the 45th Annual ACM Symposium on Theory of Computing (STOC), pages 81-90, 2013.
5. E. S. Coakley, V. Rokhlin, and M. Tygert. A fast randomized algorithm for orthogonal projection. SIAM J. Scientific Computing, 33(2):849-868, 2011.
6. M. B. Cohen, Y. T. Lee, C. Musco, C. Musco, R. Peng, and A. Sidford. Uniform sampling for matrix approximation. Computing Research Repository (CoRR), abs/1408. 5099, 2014. arXiv:1408. 5099.
7. P. Drineas, R. Kannan, and M. W. Mahoney. Fast Monte Carlo algorithms for matrices I: Approximating matrix multiplication. SIAM J. Comput., 36(1):132-157, 2006. Preliminary version in the 42nd Annual IEEE Symposium on Foundations of Computer Science (FOCS).
8. P. Drineas, R. Kannan, and M. 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.
9. P. Drineas, R. Kannan, and M. W. Mahoney. Fast Monte Carlo algorithms for matrices III: Computing a compressed approximate matrix decomposition. SIAM J. Comput., 36(1):184-206, 2006. Preliminary version in the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA).
10. P. Drineas, M. Mahoney, and S. Muthukrishnan. Subspace sampling and relative-error matrix approximation: Column-based methods. In Proceedings of the 10th International Workshop on Randomization and Computation (RANDOM), pages 316-326, 2006.
11. P. Drineas and M. W. Mahoney. Effective resistances, statistical leverage, and applications to linear equation solving. Computing Research Repository (CoRR), abs/1005. 3097, 2010. arXiv:1005. 3097.
12. P. Drineas, M. W. Mahoney, and S. Muthukrishnan. Sampling algorithms for 2 regression and applications. In Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1127-1136, 2006.
13. P. Drineas, M. W. Mahoney, and S. Muthukrishnan. Relative-error CUR matrix decompositions. SIAM J. Matrix Anal. Appl., 30(2):844-881, 2008.
14. N. Halko, P. G. Martinsson, and J. A. Tropp. Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions. SIAM Review, 53(2):217-288, 2011.
15. W. Johnson and J. Lindenstrauss. Extensions of Lipschitz mappings into a Hilbert space. In Conference on modern analysis and probability, volume 26 of Contemporary Mathematics, pages 189-206. 1984.
16. I. Koutis, G. L. Miller, and R. Peng. Approaching optimality for solving SDD linear systems. In Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 235-244, 2010.
17. S. Kumar, M. Mohri, and A. Talwalkar. Sampling methods for the Nystrom method. Journal of Machine Learning Research, 13(1):981-1006, 2012.
18. M. Li, G. L. Miller, and R. Peng. Iterative row sampling. In Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 127-136, 2013.
19. M. W. Mahoney. Randomized algorithms for matrices and data. Foundations and Trends in Machine Learning, 3(2):123-224, 2011.
20. M. W. Mahoney and X. Meng. Low-distortion subspace embeddings in input-sparsity time and applications to robust linear regression. In Proceedings of the 45th Annual ACM Symposium on Theory of Computing (STOC), pages 91-100, 2013.
21. X. Meng, M. A. Saunders, and M. W. Mahoney. LSRN: A parallel iterative solver for strongly over-or under-determined systems. SIAM J. Scientific Computing, 36(2), 2014.
22. C. D. Meyer, Jr. Generalized inversion of modified matrices. SIAM J. Appl. Math, 24(3):315-323, 1973.
23. M. Mohri and A. Talwalkar. Can matrix coherence be eficiently and accurately estimated In Proceedings of the 14th International Conference on Artificial Intelligence and Statistics (AISTATS), pages 534-542, 2011.
24. J. Nelson and H. L. Nguyen. OSNAP: Faster numerical linear algebra algorithms via sparser subspace embeddings. In Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 117-126, 2013.
25. V. Rokhlin and M. Tygert. A fast randomized algorithm for overdetermined linear least-squares regression. Proc. Natl. Acad. Sci. USA, 1005(36):13212-7, 2008.
26. T. Sarlos. Improved approximation algorithms for large matrices via random projections. In Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 143-152, 2006.
27. D. A. Spielman and N. Srivastava. Graph sparsification by effective resistances. SIAM Journal on Computing, 40(6):1913-1926, 2011. Preliminary version in the 40th Annual ACM Symposium on Theory of Computing (STOC).
28. D. A. Spielman and S.-H. Teng. Nearly linear time algorithms for preconditioning and solving symmetric, diagonally dominant linear systems. SIAM Journal on Matrix Analysis and Applications, 35(3):835-885, 2014. Preliminary version in the 36th Annual ACM Symposium on Theory of Computing (STOC).
29. J. A. Tropp. User-friendly tail bounds for sums of random matrices. Foundations of Computational Mathematics, 12(4):389-434, 2012.