Tensor sparsification via a bound on the spectral norm of random tensors

Information and Inference

Volumn 4, Issue 3, 2015, Pages 195-229

  Nguyen, Nam H ^a   Drineas, Petros ^b   Tran, Trac D ^c  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b Rensselaer Polytechnic Institute   (United States)

^c Johns Hopkins University   (United States)

Author keywords

Fast tensor computation; Random tensor; Tensor; Tensor norm; Tensor sparsification

Indexed keywords

EID: 85030107265     PISSN: None     EISSN: 20498772     Source Type: Journal    
DOI: 10.1093/imaiai/iav004     Document Type: Article

References (42)

1. Achlioptas, D., Karnin, Z. S. & Liberty, E. (2013) Near-optimal entrywise sampling for data matrices. The 27th Annual Conference on Neural Information Processing Systems, Harrahs and Harveys, Lake Tahoe, 05-10 December 2013, pp. 1565-1573.
2. Achlioptas, D. & McSherry, F. (2001) Fast computation of low rank matrix approximations. Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, Heraklion, Crete, Greece, 06-08 July 2011, pp. 611-618.
3. Achlioptas, D. & McSherry, F. (2007) Fast computation of low rank matrix approximations. J. ACM, 54, 1-19.
4. Ahlswede, R. & Winter, A. (2002) Strong converse for identification via quantum channels. IEEE Trans. Inf. Theory, 48, 569-579.
5. Alon, N., de la Vega, W. F., Kannan, R. & Karpinski, M. (2003) Random sampling and approximation of MAX-CSPs. J. Comput. System Sci., 67, 212-243.
6. Arora, S., Hazan, E. & Kale, S. (2005) Fast algorithms for approximate semidefinite programming using the multiplicative weights update method. Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, 23-25 October 2005, Pittsburgh, PA, pp. 339-348.
7. Arora, S., Hazan, E. & Kale, S. (2006) A fast random sampling algorithm for sparsifying matrices. APPROX-RANDOM, Barcelona, Spain, 28-30 August 2006, pp. 272-279.
8. Azar, Y., Fiat, A., Karlin, A. R., McSherry, F. & Saia, J. (2001) Spectral analysis of data. Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, Heraklion, Crete, Greece, 06-08 July 2011, pp. 619-626.
9. Batson, J., Spielman, D. A. & Srivastava, N. (2009) Twice-ramanujan sparsifiers. Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, Atlanta, GA, 24-27 October 2009, pp. 255-262.
10. Candès, E. J. & Recht, B. (2009) Exact matrix completion via convex optimization. Found. Comput. Math., 9, 717-772.
11. Candès, E. J. & Tao, T. (2010) The power of convex relaxation: near-optimal matrix completion. IEEE Trans. Inf. Theory, 56, 2053-2080.
12. d'Aspremont, A. (2009) Subsampling algorithms for semidefinite programming. arXiv:0803.1990v5.
13. de la Vega, W. F., Kannan, R., Karpinski, M. & Vempala, S. (2005) Tensor decomposition and approximation schemes for constraint satisfaction problems. Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Hunt Valley, MD, 22-24 May 2005, pp. 747-754.
14. De Lathauwer, L., De Moor, B. & Vandewalle, J. (2000) An introduction to independent component analysis. J. Chemometr., 14, 123-149.
15. De Lathauwer, L., De Moor, B. & Vandewalle, J. (2000) A multilinear singular value decomposition. SIAM J. Matrix Anal. Appl., 21, 1253-1278.
16. N) approximation of higher-order tensors. SIAM J. Matrix Anal. Appl., 21, 1324-1342.
17. Drineas, P., Kannan, R. & Mahoney, M. W. (2008) Sampling subproblems of heterogeneous max-cut problems and approximation algorithms. Random Struct. Algorithms, 32, 307-333.
18. Drineas, P. & Mahoney, M. W. (2007) A randomized algorithm for a tensor-based generalization of the Singular Value Decomposition. Linear Algebr. Appl., 420, 553-571.
19. Drineas, P., Mahoney, M. W. & Muthukrishnan, S. (2008) Relative-error CUR matrix decompositions. SIAM J. Matrix Anal. Appl., 30, 844-881.
20. Drineas, P. & Zouzias, A. (2011) A note on element-wise matrix sparsification via matrix-valued chernoff bounds. Inform. Process. Lett., 111, 385-389.
21. Faloutsos, C., Kolda, T. G. & Sun, J. (2007) Tutorial: mining large time-evolving data using matrix and tensor tools. Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Jose, CA, 12-15 August 2007.
22. Frieze, A., Kannan, R. & Vempala, S. (1998) Fast Monte-Carlo algorithms for finding low-rank approximations. Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, Palo Alto, CA, 08-11 November 1998, pp. 370-378.
23. Füredi, Z. & Komlós, J. (1981) The eigenvalues of random symmetric matrices. Combinatorica, 1, 233-241.
24. Gittens, A. & Tropp, J. (2009) Error bounds for random matrix approximation schemes. Preprint.
25. Kolda, T. G. (2001) Orthogonal tensor decompositions. SIAM J. Matrix Anal. Appl., 23, 243-255.
26. Kolda, T. G. & Bader, B. W. (2009) Tensor decompositions and applications. SIAM Rev., 51, 455-500.
27. Latala, R. (2004) Somes estimates of norms of random matrices. Proc. Amer. Math. Soc., 133, 1273-1282.
28. Ledoux, M. (2001) The Concentration of Measure Phenomenon. Providence, RI: American Mathematical Society.
29. Ledoux, M. & Talagrand, M. (1991) Probability in Banach Space: Isoperimetry and Processes. Berlin: Springer.
30. Mahoney, M. W. & Drineas, P. (2009) CUR matrix decompositions for improved data analysis. Proc. Natl. Acad. Sci., 106, 697-702.
31. Mahoney, M. W., Maggioni, M. & Drineas, P. (2006) Tensor-CUR decompositions for tensor-based data. Proceedings of the Twelfth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Philadelphia, PA, 20-23 August 2006, pp. 327-336.
32. Mahoney, M. W., Maggioni, M. & Drineas, P. (2008) Tensor-CUR decompositions and data applications. SIAM J. Matrix Anal. Appl., 30, 957-987.
33. Nguyen, N. H., Do, T. T. & Tran, T. D. (2009) A fast and efficient algorithm for low-rank approximation of a matrix. Proceedings of the 41st Annual ACM Symposium on Theory of Computing, Bethesda, MA, 31 May-2 June 2009, pp. 215-224.
34. Oliveira, R. I. (2002) Sums of random hermitian matrices and an inequality by Rudelson. Electron. Comm. Probab., 15, 203-212.
35. Rudelson, M. & Vershynin, R. (2009) The smallest singular value of a random rectangular matrix. Comm. Pure Appl. Math., 62, 1707-1739.
36. Sarlos, T. (2006) Improved approximation algorithms for large matrices via random projections. Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, Berkeley, CA, 21-24 October 2006, pp. 143-152.
37. Spielman, D. A. & Srivastava, N. (2008) Graph sparsification by effective resistances. Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, Victoria, BC, Canada, 17-20 May 2008, pp. 563-568.
38. Tropp, J. A. (2012) User-friendly tail bounds for sums of random matrices. Found. Comput. Math., 1, 2-20.
39. Tropp, J. A. (2015) An introduction to matrix concentration inequalities. Preprint.
40. Tsourakakis, C. E. (2010) Mach: Fast randomized tensor decompositions. SIAM International Conference on Data Mining, Sydney, Australia, 14-17 December 2010, pp. 689-700.
41. Vershynin, R. (2011) Spectral norm of products of random and deterministic matrices. Probab. Theory Related Fields, 150, 471-509.
42. Vershynin, R. (2012) Introduction to the non-asymptotic analysis of random matrices. Compressed Sensing: Theory and Applications. Cambridge: Cambridge University Press, pp. 210-268.