On sketching matrix norms and the top singular vector

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2014, Pages 1562-1581

  Li, Yi ^a   Nguyên, Huy L ^b   Woodruff, David P ^c  

^a UNIVERSITY OF MICHIGAN   (United States)

^b PRINCETON UNIVERSITY   (United States)

^c IBM RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

NEAREST NEIGHBOR SEARCH; PROBABILITY DISTRIBUTIONS; TABLE LOOKUP; VECTORS;

ALGORITHMIC TOOLS; APPROXIMATION FACTOR; LINEAR MAPS; LINEAR SKETCHING; MATRIX NORMS; SCHATTEN NORMS; SINGULAR VALUES; SINGULAR VECTORS;

MATRIX ALGEBRA;

EID: 84902082486     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973402.114     Document Type: Conference Paper

References (46)

1. N. Alon, Y. Matias, and M. Szegedy. The Space Complexity of Approximating the Frequency Moments. J. Comput. Syst. Sci., 58(1):137-147, 1999.
2. A. Andoni. Nearest neighbor search in high- dimensional spaces. In the workshop: Barriers in Computational Complexity II, 2010. http://www.mit.edu/ andoni/nns-barriers.pdf.
3. A. Andoni, R. Krauthgamer, and K. Onak. Streaming algorithms from precision sampling. In FOCS, pages 363-372. 2011.
4. A. Andoni and H. L. Nguyen. Eigenvalues of a matrix in the streaming model. In SODA, 2013.
5. A. Andoni, H. L. Nguyen, Y. Polyansnkiy, and Y. Yu. Tight lower bound for linear sketches of moments. In ICALP, 2013.
6. Z. Bar-Yossef, T. S. Jayram, R. Kumar, and D. Sivakumar. An information statistics approach to data stream and communication complexity. J. Comput. Syst. Sci, 68(4):702-732, 2004.
7. L. Bhuvanagiri, S. Ganguly, D. Kesh, and C. Saha. Simpler algorithm for estimating frequency moments of data streams. In SODA, pages 708-713, 2006.
8. E. J. Candes and B. Recht. Exact matrix completion via convex optimization. Commun. ACM, 55(6):111- 119, 2012.
9. A. Chakrabarti, S. Khot, and X. Sun. Near-optimal lower bounds on the multi-party communication complexity of set disjointness. In CCC, 2003.
10. M. Charikar, K. Chen, and M. Farach-Colton. Finding frequent items in data streams. In Proceedings of the 29th International Colloquium on Automata, Languages and Programming (ICALP), pages 693-703, 2002.
11. H. Y. Cheung, L. C. Lau, and K. M. Leung. Graph connectivities, network coding, and expander graphs. In FOCS, pages 190-199, 2011.
12. K. L. Clarkson and D. P. Woodruff. Low rank approximation and regression in input sparsity time. In STOC, pages 81-90, 2013.
13. G. Cormode and S. Muthukrishnan. An improved data stream summary: The count-min sketch and its applications. J. Algorithms, 55(1):58-75, 2005.
14. M. S. Crouch and A. McGregor. Periodicity and cyclic shifts via linear sketches. In APPROX-RANDOM, pages 158-170, 2011.
15. A. Deshpande, M. Tulsiani, and N. K. Vishnoi. Algorithms and hardness for subspace approximation. In SODA, pages 482-496, 2011.
16. P. Flajolet and G. N. Martin. Probabilistic counting. In Proceedings of the 24th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 76-82, 1983.
17. P. Flajolet and G. N. Martin. Probabilistic counting algorithms for data base applications. J. Comput. Syst. Sci., 31(2):182-209, 1985.
18. F. Gotze and A. Tikhomirov. Rate of convergence in probability to the marchenko-pastur law. Bernoulli, 10(3):pp. 503-548, 2004.
19. S. Guha, P. Indyk, and A. McGregor. Sketching information divergences. Machine Learning, 72(1-2):5- 19, 2008.
20. M. Hardt, K. Ligett, and F. McSherry. A simple and practical algorithm for differentially private data release. In Advances in Neural Information Processing Systems 25, pages 2348-2356. 2012.
21. P. Indyk. Stable distributions, pseudorandom generators, embeddings, and data stream computation. J. ACM, 53(3):307-323, 2006.
22. P. Indyk. Sketching, streaming and sublinear-space algorithms, 2007. Graduate course notes available at http://stellar.mit.edu/S/course/6/fa07/6.895/ .
23. P. Indyk and A. McGregor. Declaring independence via the sketching of sketches. In SODA, pages 737- 745, 2008.
24. P. Indyk and D. P. Woodruff. Optimal approximations of the frequency moments of data streams. In STOC, pages 202-208, 2005.
25. Y. Ingster and I. A. Suslina. Nonparametric Goodness- of-Fit Testing Under Gaussian Models. Springer, 1st edition, 2002.
26. T. Jiang. How many entries of a typical orthogonal matrix can be approximated by independent normals? The Annals of Probability, 34(4):pp. 1497-1529, 2006.
27. T. Kalai, A. Moitra, and G. Valiant. Efficiently learning mixtures of two gaussians. In Proceedings of the 42nd STOC, pages 553-562, 2010.
28. M. Kane, J. Nelson, E. Porat, and D. P. Woodruff. Fast moment estimation in data streams in optimal space. In Proceedings of the 43rd annual ACM symposium on Theory of computing, STOC '11, pages 745- 754, 2011.
29. R. Krauthgamer and O. Sasson. Property testing of data dimensionality. In SODA, pages 18-27, 2003.
30. R. Latala. Estimates of moments and tails of Gaussian chaoses. Ann. Probab., 34(6):2315-2331, 2006.
31. B.Laurent and P. Massart. Adaptive estimation of a quadratic functional by model selection. Annals of Statistics, 28(5): 1302-1338, 2000.
32. J. Lehec. Moments of the Gaussian chaos. In Seminaire de Probabilites XLIII, volume 2006 of Lecture Notes in Math., pages 327-340. Springer, Berlin, 2011.
33. C. Li and G. Miklau. Measuring the achievable error of query sets under differential privacy. CoRR, abs/1202.3399, 2012.
34. Y. Li and D. P. Woodruff. A tight lower bound for high frequency moment estimation with small error. In RANDOM, 2013.
35. M. W. Mahoney. Randomized algorithms for matrices and data. Foundations and Trends in Machine Learning, 3(2):123-224, 2011.
36. V. A. Marcenko and L. A. Pastur. Distribution of eigenvalues in certain sets of random matrices. Mat. Sb. (N.S.), 72 (114):507-536, 1967.
37. X. Meng and M. W. Mahoney. Low-distortion sub- space embeddings in input-sparsity time and applications to robust linear regression. In STOC, pages 91- 100, 2013.
38. S. Muthukrishnan. Data Streams: Algorithms and Applications. Foundations and Trends in Theoretical Computer Science, 1(2):117-236, 2005.
39. J. Nelson and H. L. Nguyen. OSNAP: Faster numerical linear algebra algorithms via sparser subspace embeddings. CoRR, abs/1211.1002, 2012.
40. E.Price and D. P. Woodruff. Applications of the Shannon-Hartley theorem to data streams and sparse recovery. In ISIT, pages 2446-2450, 2012.
41. M. Rudelson and R. Vershynin. Hanson-Wright inequality and sub-gaussian concentration. Manuscript. http://arxiv.org/abs/1306.2872v2.
42. M. Rudelson and R. Vershynin. The Littlewood- Offord problem and invertibility of random matrices. Advances in Mathematics, 218(2):600 - 633, 2008.
43. M. E. Saks and X. Sun. Space lower bounds for distance approximation in the data stream model. In STOC, pages 360-369, 2002.
44. T. Sarlos. Improved approximation algorithms for large matrices via random projections. In FOCS, pages 143-152, 2006.
45. A. B. Tsybakov. Introduction to Nonparametric Estimation. Springer, 1st edition, 2008.
46. R. Vershynin. Introduction to the non-asymptotic analysis of random matrices. In Y. C. Eldar and G. Kutyniok, editors, Compressed Sensing: Theory and Applications. Cambridge University Press, 2011.