Low rank matrix-valued chernoff bounds and approximate matrix multiplication

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2011, Pages 1422-1436

  Magen, Avner ^a   Zouzias, Anastasios ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS;

APPROXIMATE SOLUTION; CONCENTRATION OF MEASURE; INTRINSIC DIMENSIONALITIES; LINEAR COMBINATIONS; LOW-RANK MATRIX APPROXIMATIONS; MATRIX MULTIPLICATION; NONUNIFORM SAMPLING; SAMPLING PROCEDURES;

MATRIX ALGEBRA;

EID: 79955706537     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973082.109     Document Type: Conference Paper

References (43)

1. S. Arora, E. Hazan, and S. Kale. A Fast Random Sampling Algorithm for Sparsifying Matrices. In Proceedings of the International Workshop on Randomization and Approximation Techniques (RANDOM), pages 272-279, 2006. (Cited on page 2). (Pubitemid 44577537)
2. D. Achlioptas and F. Mcsherry. Fast Computation of Low-rank Matrix Approximations. Journal of the ACM (JACM), 54(2):9, 2007. (Cited on pages 1, 2 and 5).
3. R. Ahlswede and A. Winter. Strong Converse for Identification via Quantum Channels. IEEE Transactions on Information Theory, 48(3):569-579, 2002. (Cited on pages 1 and 2). (Pubitemid 34239788)
4. R. Bhatia. Matrix Analysis, volume 169. Graduate Texts in Mathematics, Springer, First edition, 1996. (Cited on pages 3 and 13).
5. C. Boutsidis, M. W. Mahoney, and P. Drineas. An Improved Approximation Algorithm for the Column Subset Selection Problem. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 968-977, 2009. (Cited on page 9).
6. A. Buchholz. Operator Khintchine Inequality in Non-commutative Probability. Mathematische Annalen, 319(1-16):1-16, January 2001. (Cited on pages 3 and 13).
7. K. L. Clarkson. Tighter Bounds for Random Projections of Manifolds. In Proceedings of the A CM Symposium on Computational Geometry (SoCG), pages 39-48, 2008. (Cited oil page 2).
8. E. Candes and J. Romberg. Sparsity and Incoherence in Compressive Sampling. Inverse Problems, 23(3):969, 2007. (Cited on page 2).
9. K. L. Clarkson and D. P. Woodruff. Numerical Linear Algebra in the Streaming Model. In Proceedings of the Symposium on Theory of Computing (S'TOC), pages 205-214, 2009. (Cited on pages 1, 3 and 5).
10. P. Drineas and R. Kaiman. Pass Efficient Algorithms for Approximating Large Matrices. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 223-232, 2003. (Cited on page 5).
11. P. Drineas, R. Kamian, and M. W. Mahoney. Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication. Journal of the ACM (JACM), 36(1):132-157, 2006. (Cited on pages 1, 2 and 3). (Pubitemid 46374021)
12. P. Drineas, R. Kannan, and M. W. Mahoney. Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix. Journal of the ACM (JACM), 36(1):158-183, 2006. (Cited on page 3). (Pubitemid 46374022)
13. P. Drineas, R. Kannan, and M. W. Mahoney. Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition. Journal of the ACM (JACM), 36(l):184-206, 2006. (Cited on page 3). (Pubitemid 46374023)
14. P. Drineas and M. W. Mahoney. Effective Resistances, Statistical Leverage, and Applications to Linear Equation Solving. Available at arxiv: 1005.3097, May 2010. (Cited on page 6).
15. 2-regression and Applications. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1127-1136, 2006. (Cited on pages 1 and 5).
16. P. Drineas, M. W. Mahoney, S. Muthukrishnan, and T. Sarlos. Faster Least Squares Approximation. Available at arvix:0710.1435, May 2009. (Cited on page 5).
17. A. Deshpande and L. Rademacher. Efficient Volume Sampling for Row/column Subset Selection. In Proceedings of the Symposium on Foundations of Computer Science (FOCS), 2010. (Cited on page 1).
18. A. Deshpande, L. Rademacher, S. Vempala, and G. Wang. Matrix Approximation and Projec-tive Clustering via Volume Sampling. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1117-1126, 2006. (Cited on page 5). (Pubitemid 43275339)
19. P. Drineas and A. Zouzias. A Note on Element-wise Matrix Sparsification via Matrix-valued Chernoff Bounds. Available at arxiv: 1006.0407, June 2010. (Cited on page 2).
20. A. Frieze, R. Kannan, and S. Vempala. Fast Monte-carlo Algorithms for Finding Low-rank Approximations. Journal of the ACM (JACM), 51(6):1025-1041, 2004. (Cited on pages 1, 3 and 5). (Pubitemid 40818314)
21. D. Gross, Y.-K. Liu, S. T. Flammia, S. Becker, and J. Eisert. Quantum State Tomography via Compressed Sensing. Available at 0909.3304, September 2009. (Cited on pages 1 and 4).
22. D. Gross. Recovering Low-rank Matrices from Few Coefficients in any Basis. Available at arxiv:0910.1879, December 2009. (Cited on pages 1 and 2).
23. G. H. Golub and C. F. Van Loan. Matrix Computations. The Johns Hopkins University Press, Third edition, October 1996. (Cited on pages 3 and 12).
24. N. Halko, P. G. Martinsson, and J. A. Tropp. Finding Structure with Randomness: Stochastic Algorithms for Constructing Approximate Matrix Decompositions. Available at arxiv:0909.4061, Sep. 2009. (Cited on pages 5, 6, 7 and 9).
25. p(1 < p < oo). C. R. Acad. Sci. Paris Sér. I Math., 303(7):289-292, 1986. (Cited on pages 3 and 13).
26. F. Lust-Piquard and G. Pisier. Non Commutative Khintchine and Paley Inequalities. Arkiv för Matematik, 29(l-2):241-260, December 1991. (Cited on page 13).
27. M. Ledoux and M. Talagrand. Probability in Banach Spaces, volume 23 of Ergebnisse der Mathematik und ihrer Grenzgebiete (3). Springer-Verlag, 1991. Isoperimetry and Processes. (Cited on page 13).
28. A. Magen. Dimensionality Reductions in l2 that Preserve Volumes and Distance to Affine Spaces. Discrete & Computational Geometry, 38(1):139-153, 2007. (Cited on page 2).
29. V.D. Milman. A new Proof of A. Dvoretzky's Theorem on Cross-sections of Convex Bodies. Funkcional. Anal, i Prilozhen., 5(4):28-37, 1971. (Cited on page 2).
30. N. H. Nguyen, T. T. Do, and T. D. Tran. A Fast and Efficient Algorithm for Low-rank Approximation of a Matrix. In Proceedings of the Symposium on Theory of Computing (STOC'), pages 215-224, 2009. (Cited on pages 3, 5, 6, 9 and 13).
31. A. Nemirovski. Sums of Random Symmetric Matrices and Quadratic Optimization under Orthogonality Constraints. Mathematical Programming, 109(2) :283-317, 2007. (Cited on page 2). (Pubitemid 46197858)
32. B. Recht. A Simpler Approach to Matrix Completion. Available at arxiv:0910.0651, October 2009. (Cited on pages 1, 2 and 4).
33. 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. (Cited on page 5).
34. M. Rudelson. Random Vectors in the Isotropic Position. J. Fund. Anal., 164(l):60-72, 1999. (Cited on pages 3 and 13).
35. M. Rudelson and R. Vershynin. Sampling from Large Matrices: An Approach through Geometric Functional Analysis. Journal of the ACM (JACM), 54(4):21, 2007. (Cited on pages 2, 3, 4, 5, 10 and 13).
36. M. Rudelson and R. Vershynin. The Smallest Singular Value of a Random Rectangular Matrix. Communications on Pure and Applied Mathematics, 62(1-2):1707-1739, 2009. (Cited on page 9).
37. T. Sarlos. Improved Approximation Algorithms for Large Matrices via Random Projections. In Proceedings of the Symposium on Foundations of Computer Science (FOCS), pages 143-152, 2006. (Cited on pages 1, 2, 3, 5 and 8). (Pubitemid 351175504)
38. A. Man-Cho So. Improved Approximation Bound for Quadratic Optimization Problems with Orthogonality Constraints. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1201-1209, 2009. (Cited on page 2).
39. A. Man-Cho So. Moment Inequalities for sums of Random Matrices and their Applications in Optimization. Mathematical Programming, December 2009. (Cited on page 2).
40. G. W. Stewart and J. G. Sun. Matrix Perturbation Theory (Computer Science and Scientific Computing). Academic Press, June 1990. (Cited on page 3).
41. D. A. Spielman and N. Srivastava. Graph Sparsification by Effective Resistances. In Proceedings of the Symposium on Theory of Computing (STOC), pages 563-568, 2008. (Cited on pages 6 and 10).
42. J. A. Tropp. User-Friendly Tail Bounds for Sums of Random Matrices. Available at arxiv: 1004.4389, April 2010. (Cited on pages 1 and 4).
43. A. Wigderson and D. Xiao. Derandomizing the Ahlswede-Winter Matrix-valued Chernoff Bound using Pessimistic Estimators, and Applications. Theory of Computing, 4(l):53-76, 2008. (Cited on pages 2 and 4).