On approximating matrix norms in data streams
From MaRDI portal
Publication:5244397
Recommendations
Cites work
- scientific article; zbMATH DE number 5764818 (Why is no real title available?)
- scientific article; zbMATH DE number 1231230 (Why is no real title available?)
- scientific article; zbMATH DE number 718142 (Why is no real title available?)
- scientific article; zbMATH DE number 2079317 (Why is no real title available?)
- scientific article; zbMATH DE number 7049740 (Why is no real title available?)
- scientific article; zbMATH DE number 2086663 (Why is no real title available?)
- scientific article; zbMATH DE number 815575 (Why is no real title available?)
- scientific article; zbMATH DE number 3244317 (Why is no real title available?)
- 1-pass relative-error \(L_p\)-sampling with applications
- A Tight Lower Bound for High Frequency Moment Estimation with Small Error
- Adaptive estimation of a quadratic functional by model selection.
- Algorithms and hardness for subspace approximation
- An improved data stream summary: the count-min sketch and its applications
- An information statistics approach to data stream and communication complexity
- An optimal algorithm for large frequency moments using \(O(n^{1-2/k})\) bits
- Approximate distributions of order statistics. With applications to nonparametric statistics
- Eigenvalues of a matrix in the streaming model
- Exact matrix completion via convex optimization
- Exponential separation of quantum and classical one-way communication complexity
- Exponential separations for one-way quantum communication complexity, with applications to cryptography
- Fast moment estimation in data streams in optimal space
- Finding frequent items in data streams
- Finding the largest low-rank clusters with Ky Fan \(2\)-\(k\)-norm and \(\ell_1\)-norm
- Fully homomorphic encryption using ideal lattices
- Graph Connectivities, Network Coding, and Expander Graphs
- Hellinger Strikes Back: A Note on the Multi-party Information Complexity of AND
- Information Theory and Statistics: A Tutorial
- Low-distortion subspace embeddings in input-sparsity time and applications to robust linear regression
- Multivariate normal approximation using exchangeable pairs
- Nonparametric goodness-of-fit testing under Gaussian models
- On estimating maximum matching size in graph streams
- On sum of powers of the Laplacian eigenvalues of graphs
- On the exact space complexity of sketching and streaming small norms
- On the sum of powers of normalized Laplacian eigenvalues of graphs
- Optimal Shrinkage of Singular Values
- Optimal approximations of the frequency moments of data streams
- Periodicity and cyclic shifts via linear sketches
- Probabilistic counting algorithms for data base applications
- Randomized Algorithms for Matrices and Data
- Rate of convergence in probability to the Marchenko-Pastur law
- Sketching Information Divergences
- Sketching and embedding are equivalent for norms
- Spectral norm of products of random and deterministic matrices
- Spectrum estimation from samples
- Stable distributions, pseudorandom generators, embeddings, and data stream computation
- Streaming algorithms via precision sampling
- Sublinear estimation of weighted matchings in dynamic data streams
- Taylor polynomial estimator for estimating frequency moments
- The Littlewood-Offord problem and invertibility of random matrices
- The Minimum in the Gamma Function
- The space complexity of approximating the frequency moments
- The streaming complexity of cycle counting, sorting by reversals, and other problems
- Tight lower bound for linear sketches of moments
- Turnstile streaming algorithms might as well be linear sketches
Cited in
(18)- Smoothness of Schatten norms and sliding-window matrix streams
- Eigenvalues of a matrix in the streaming model
- Streaming symmetric norms via measure concentration
- On sketching matrix norms and the top singular vector
- Tight bounds for the subspace sketch problem with applications
- An approximate \(L^p\) difference algorithm for massive data streams
- On deterministic sketching and streaming for sparse recovery and norm estimation
- Numerical linear algebra in the streaming model
- Optimal eigenvalue approximation via sketching
- Vector-Matrix-Vector Queries for Solving Linear Algebra, Statistics, and Graph Problems
- On the exact space complexity of sketching and streaming small norms
- Monte Carlo estimators for the Schatten \(p\)-norm of symmetric positive semidefinite matrices
- Embeddings of Schatten norms with applications to data streams
- Stable distributions, pseudorandom generators, embeddings, and data stream computation
- On approximating functions of the singular values in a stream
- Tight bounds for sketching the operator norm, Schatten norms, and subspace embeddings
- On sketching the \(q\) to \(p\) norms
- scientific article; zbMATH DE number 1629825 (Why is no real title available?)
This page was built for publication: On approximating matrix norms in data streams
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5244397)
