On Approximating Matrix Norms in Data Streams

This paper presents a systematic study of the space complexity of estimating the Schatten $p$-norms of an $n\times n$ matrix in the turnstile streaming model. Both kinds of space complexities, bit ...

[1]  Subhash Khot,et al.  Near-optimal lower bounds on the multi-party communication complexity of set disjointness , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

[2]  Sudipto Guha,et al.  Sketching information divergences , 2007, Machine Learning.

[3]  Alexandr Andoni,et al.  Streaming Algorithms via Precision Sampling , 2010, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[4]  David P. Woodruff,et al.  Applications of the Shannon-Hartley theorem to data streams and sparse recovery , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[5]  Roman Vershynin,et al.  Introduction to the non-asymptotic analysis of random matrices , 2010, Compressed Sensing.

[6]  Bo Zhou.  On sum of powers of the Laplacian eigenvalues of graphs , 2008 .

[7]  Ori Sasson,et al.  Property testing of data dimensionality , 2003, SODA '03.

[8]  Ashish Khetan,et al.  Spectrum Estimation from a Few Entries , 2017, J. Mach. Learn. Res..

[9]  Imre Csiszár,et al.  Information Theory and Statistics: A Tutorial , 2004, Found. Trends Commun. Inf. Theory.

[10]  C. Pouet.  Nonparametric Goodness-of-Fit Testing Under Gaussian Models , 2004 .

[11]  Piotr Indyk,et al.  Declaring independence via the sketching of sketches , 2008, SODA '08.

[12]  Alexandr Andoni,et al.  Sketching and Embedding are Equivalent for Norms , 2014, STOC.

[13]  Sumit Ganguly,et al.  Taylor Polynomial Estimator for Estimating Frequency Moments , 2015, ICALP.

[14]  Craig Gentry,et al.  Fully homomorphic encryption using ideal lattices , 2009, STOC '09.

[15]  Alexandr Andoni.  Nearest Neighbor Search in High-Dimensional Spaces , 2011, MFCS.

[16]  Ronald L. Graham,et al.  Concrete mathematics - a foundation for computer science , 1991 .

[17]  David P. Woodruff,et al.  Turnstile streaming algorithms might as well be linear sketches , 2014, STOC.

[18]  Chris Schwiegelshohn,et al.  Sublinear Estimation of Weighted Matchings in Dynamic Data Streams , 2015, ESA.

[19]  F. Götze,et al.  Rate of convergence in probability to the Marchenko-Pastur law , 2004 .

[20]  B. Bozkurt,et al.  On the Su m of Powers of Nor m alized Laplacian Eigenvalues of Graphs , 2012 .

[21]  David P. Woodruff,et al.  1-pass relative-error Lp-sampling with applications , 2010, SODA '10.

[22]  Dong Xia.  Optimal Schatten-q and Ky-Fan-k Norm Rate of Low Rank Matrix Estimation , 2014, 1403.6499.

[23]  Lap Chi Lau,et al.  Graph Connectivities, Network Coding, and Expander Graphs , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[24]  David P. Woodruff,et al.  Optimal approximations of the frequency moments of data streams , 2005, STOC '05.

[25]  P. Massart,et al.  Adaptive estimation of a quadratic functional by model selection , 2000 .

[26]  Leon M. Hall,et al.  Special Functions , 1998 .

[27]  Graham Cormode,et al.  An improved data stream summary: the count-min sketch and its applications , 2004, J. Algorithms.

[28]  Gregory Valiant,et al.  Spectrum Estimation from Samples , 2016, ArXiv.

[29]  Sumit Ganguly.  A Lower Bound for Estimating High Moments of a Data Stream , 2012, ArXiv.

[30]  T. S. Jayram.  Hellinger Strikes Back: A Note on the Multi-party Information Complexity of AND , 2009, APPROX-RANDOM.

[31]  Alexandr Andoni,et al.  Tight Lower Bound for Linear Sketches of Moments , 2013, ICALP.

[32]  Zhengyou Zhang,et al.  Parameter estimation techniques: a tutorial with application to conic fitting , 1997, Image Vis. Comput..

[33]  Philippe Flajolet,et al.  Probabilistic counting , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[34]  Ziv Bar-Yossef,et al.  Exponential separation of quantum and classical one-way communication complexity , 2004, STOC '04.

[35]  Alexandr Andoni,et al.  Eigenvalues of a matrix in the streaming model , 2013, SODA.

[36]  Noga Alon,et al.  The space complexity of approximating the frequency moments , 1996, STOC '96.

[37]  Michael W. Mahoney,et al.  Low-distortion subspace embeddings in input-sparsity time and applications to robust linear regression , 2012, STOC '13.

[38]  Robert Krauthgamer,et al.  Sketches for Matrix Norms: Faster, Smaller and More General , 2016, ArXiv.

[39]  Xuan Vinh Doan,et al.  Finding the Largest Low-Rank Clusters With Ky Fan 2-k-Norm and ℓ1-Norm , 2014, SIAM J. Optim..

[40]  Michael W. Mahoney.  Randomized Algorithms for Matrices and Data , 2011, Found. Trends Mach. Learn..

[41]  Moses Charikar,et al.  Finding frequent items in data streams , 2002, Theor. Comput. Sci..

[42]  D. Botstein,et al.  Singular value decomposition for genome-wide expression data processing and modeling. , 2000, Proceedings of the National Academy of Sciences of the United States of America.

[43]  Katrina Ligett,et al.  A Simple and Practical Algorithm for Differentially Private Data Release , 2010, NIPS.

[44]  K. Driver,et al.  Zeros of the Hypergeometric Polynomial F(-n, b; c; z) , 2001, 0812.0708.

[45]  Andrew McGregor,et al.  Periodicity and Cyclic Shifts via Linear Sketches , 2011, APPROX-RANDOM.

[46]  David P. Woodruff,et al.  Low rank approximation and regression in input sparsity time , 2012, STOC '13.

[47]  Aleksandar Ilic,et al.  LEL-a Newly Designed Molecular Descriptor , 2009 .

[48]  David P. Woodruff,et al.  Fast moment estimation in data streams in optimal space , 2010, STOC '11.

[49]  Emmanuel J. Candès,et al.  Exact Matrix Completion via Convex Optimization , 2008, Found. Comput. Math..

[50]  Philippe Flajolet,et al.  Probabilistic Counting Algorithms for Data Base Applications , 1985, J. Comput. Syst. Sci..

[51]  S. Chatterjee,et al.  MULTIVARIATE NORMAL APPROXIMATION USING EXCHANGEABLE PAIRS , 2007, math/0701464.

[52]  R. Reiss.  Approximate Distributions of Order Statistics: With Applications to Nonparametric Statistics , 1989 .

[53]  Ran Raz,et al.  Exponential Separation for One-Way Quantum Communication Complexity, with Applications to Cryptography , 2008, SIAM J. Comput..

[54]  Tamás Sarlós,et al.  Improved Approximation Algorithms for Large Matrices via Random Projections , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[55]  David P. Woodruff,et al.  A Tight Lower Bound for High Frequency Moment Estimation with Small Error , 2013, APPROX-RANDOM.

[56]  Nisheeth K. Vishnoi,et al.  Algorithms and hardness for subspace approximation , 2009, SODA '11.

[57]  Yang Li,et al.  On Estimating Maximum Matching Size in Graph Streams , 2017, SODA.

[58]  David P. Woodruff,et al.  On the exact space complexity of sketching and streaming small norms , 2010, SODA '10.

[59]  Vladimir Braverman,et al.  An Optimal Algorithm for Large Frequency Moments Using O(n^(1-2/k)) Bits , 2014, APPROX-RANDOM.

[60]  David L. Donoho,et al.  Optimal Shrinkage of Singular Values , 2014, IEEE Transactions on Information Theory.

[61]  Piotr Indyk,et al.  Stable distributions, pseudorandom generators, embeddings, and data stream computation , 2006, JACM.

[62]  Wei Yu,et al.  The streaming complexity of cycle counting, sorting by reversals, and other problems , 2011, SODA '11.

[63]  Philippe Flajolet,et al.  An introduction to the analysis of algorithms , 1995 .

[64]  Hossein Jowhari,et al.  Tight bounds for Lp samplers, finding duplicates in streams, and related problems , 2010, PODS.

[65]  S. Janson.  Stable distributions , 2011, 1112.0220.

[66]  M. Rudelson,et al.  The Littlewood-Offord problem and invertibility of random matrices , 2007, math/0703503.

[67]  Ziv Bar-Yossef,et al.  An information statistics approach to data stream and communication complexity , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[68]  Huy L. Nguyen,et al.  OSNAP: Faster Numerical Linear Algebra Algorithms via Sparser Subspace Embeddings , 2012, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

[69]  W. Deming,et al.  The Minimum in the Gamma Function , 1935, Nature.

[70]  Gerome Miklau,et al.  Optimal error of query sets under the differentially-private matrix mechanism , 2012, ICDT '13.