Near-optimal entrywise sampling for data matrices

Advances in Neural Information Processing Systems

Volumn , Issue , 2013, Pages

  Achlioptas, Dimitris ^a   Karnin, Zohar ^b   Liberty, Edo ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b YAHOO RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

IMPORTANCE SAMPLING; OPTIMIZATION; PROBABILITY DISTRIBUTIONS;

ARBITRARY ORDER; COMPLEX FUNCTIONS; DATA MATRICES; MINIMAL INFORMATION; NEAR-OPTIMAL; OPTIMAL DISTRIBUTIONS; SAMPLING DISTRIBUTION; STREAMING MODEL;

MATRIX ALGEBRA;

EID: 84899003684     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)

1. Sanjeev Arora, Elad Hazan, and Satyen Kale. Fast algorithms for approximate semidefinite programming using the multiplicative weights update method. In Foundations of Computer Science, 2005. FOCS 2005. 46th Annual IEEE Symposium on, pages 339-348. IEEE, 2005.
2. Sanjeev Arora, Elad Hazan, and Satyen Kale. A fast random sampling algorithm for sparsifying matrices. In Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation, APPROX'06/RANDOM'06, pages 272-279, Berlin, Heidelberg, 2006. Springer-Verlag.
3. Noga Alon, Michael Krivelevich, and VanH. Vu. On the concentration of eigenvalues of random symmetric matrices. Israel Journal of Mathematics, 131:259-267, 2002.
4. Dimitris Achlioptas and Frank McSherry. Fast computation of low rank matrix approximations. In Proceedings of the thirty-third annual ACM symposium on Theory of computing, pages 611-618. ACM, 2001.
5. Dimitris Achlioptas and Frank Mcsherry. Fast computation of low-rank matrix approximations. J. ACM, 54(2), april 2007.
6. Rudolf Ahlswede and Andreas Winter. Strong converse for identification via quantum channels. IEEE Transactions on Information Theory, 48(3):569-579, 2002.
7. Aleš Berkopec. Hyperquick algorithm for discrete hypergeometric distribution. Journal of Discrete Algorithms, 5(2):341-347, 2007.
8. Emmanuel J Candès and Benjamin Recht. Exact matrix completion via convex optimization. Foundations of Computational mathematics, 9(6):717-772, 2009.
9. Emmanuel J Candès and Terence Tao. The power of convex relaxation: Near-optimal matrix completion. Information Theory, IEEE Transactions on, 56(5):2053-2080, 2010.
10. Alexandre d'Aspremont Subsampling algorithms for semidefinite programming. arXiv preprint arXiv: 0803. 1990, 2008.
11. Petros Drineas, Ravi Kannan, and Michael W. Mahoney. Fast monte carlo algorithms for matrices; approximating matrix multiplication. SIAM J. Comput., 36(1):132-157, July 2006.
12. Petros Drineas and Anastasios Zouzias. A note on element-wise matrix sparsification via a matrixvalued bernstein inequality. Inf. Process. Lett., 111(8):385-389, 2011.
13. Z. Füredi and J. Komlós. The eigenvalues of random symmetric matrices. Combinatorica, 1(3):233-241, 1981.
14. Alex Gittens and Joel A Tropp. Error bounds for random matrix approximation schemes. arXiv preprint arXiv:0911.4108, 2009.
15. F. Juhász. On the spectrum of a random graph. In Algebraic methods in graph theory, Vol. I, II (Szeged, 1978), volume 25 of Colloq. Math. Soc. János Bolyai, pages 313-316. North-Holland, Amsterdam, 1981.
16. NH Nguyen, Petros Drineas, and TD Tran. Matrix sparsification via the khintchine inequality, 2009.
17. Nam H Nguyen, Petros Drineas, and Trac D Tran. Tensor sparsification via a bound on the spectral norm of random tensors. arXiv preprint arXiv:1005.4732, 2010.
18. J. Philbin, O. Chum, M. Isard, J. Sivic, and A. Zisserman. Object retrieval with large vocabularies and fast spatial matching. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2007.
19. Benjamin Recht. A simpler approach to matrix completion. J. Mach. Learn. Res., 12:3413-3430, December 2011.
20. Mark Rudelson and Roman Vershynin. Sampling from large matrices: An approach through geometric functional analysis. J. ACM, 54(4), July 2007.
21. Will Styler. The enronsent corpus. In Technical Report 01-2011, University of Colorado at Boulder Institute of Cognitive Science, Boulder, CO., 2011.
22. Joel A. Tropp. User-friendly tail bounds for sums of random matrices. Foundations of Computational Mathematics, 12(4):389-434, 2012.
23. Joel A Tropp. User-friendly tail bounds for sums of random matrices. Foundations of Computational Mathematics, 12(4):389-434, 2012.
24. Eugene P. Wigner. On the distribution of the roots of certain symmetric matrices. Annals of Mathematics, 67(2):pp. 325-327, 1958.