A note on element-wise matrix sparsification via a matrix-valued Bernstein inequality

Information Processing Letters

Volumn 111, Issue 8, 2011, Pages 385-389

  Drineas, Petros ^a   Zouzias, Anastasios ^b  

^a RENSSELAER POLYTECHNIC INSTITUTE   (United States)

^b UNIVERSITY OF TORONTO   (Canada)

Author keywords

Algorithms; Matrix sparsification; Matrix valued Bernstein bounds

Indexed keywords

APPROXIMATION ACCURACY; MATRIX; MATRIX-VALUED BERNSTEIN BOUNDS; NON-COMMUTATIVE; SPARSIFICATION;

APPROXIMATION ALGORITHMS;

EID: 78651554345     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2011.01.010     Document Type: Article

References (15)

1. D. Achlioptas, F. McSherry, Fast computation of low rank matrix approximations, in: Proceedings of the Symposium on Theory of Computing (STOC), 2001, pp. 611-618.
2. D. Achlioptas, and F. McSherry Fast computation of low rank matrix approximations Journal of the ACM 54 2 2007
3. S. Arora, E. Hazan, S. Kale, Fast algorithms for approximate semidefinite programming using the multiplicative weights update method, in: IEEE Symposium on Foundations of Computer Science (FOCS), 2005, pp. 339-348.
4. S. Arora, E. Hazan, S. Kale, A fast random sampling algorithm for sparsifying matrices, in: Proceedings of the International Workshop on Randomization and Approximation Techniques (RANDOM), 2006, pp. 272-279.
5. E.J. Candès, and B. Recht Exact matrix completion via convex optimization Foundations of Computational Mathematics 9 3 2009 717 772
6. E.J. Candès, and T. Tao The power of convex relaxation: Near-optimal matrix completion IEEE Trans. Inf. Theor. 56 5 2010 2053 2080
7. A. d'Aspremont Subsampling algorithms for semidefinite programming available at arXiv:0803.1990v5 November 2009
8. P. Drineas, R. Kannan, and M.W. Mahoney Fast Monte Carlo algorithms for matrices I: Approximating matrix multiplication SIAM J. Comput. 36 1 2006 132 157 (Pubitemid 46374021)
9. A. Gittens, and J.A. Tropp Error bounds for random matrix approximation schemes available at arXiv:0911.4108 November 2009
10. D. Gross Recovering low-rank matrices from few coefficients in any basis available at arXiv:0910.1879 December 2009
11. R.A. Horn, and C.R. Johnson Matrix Analysis 1990 Cambridge University Press
12. N.H. Nguyen, P. Drineas, T.D. Tran, Matrix sparsification via the Khintchine inequality, manuscript, 2009.
13. N.H. Nguyen, P. Drineas, and T.D. Tran Tensor sparsification via a bound on the spectral norm of random tensors available at arXiv:1005.4732 May 2010
14. B. Recht A simpler approach to matrix completion available at arXiv:0910.0651 October 2009
15. J.A. Tropp User-friendly tail bounds for sums of random matrices available at arXiv:1004.4389 April 2010