Research map / Learning theory and algorithms / Matrix and tensor methods
Schatten Norms in Matrix Streams: Hello Sparsity, Goodbye Dimension
Vladimir Braverman, Robert Krauthgamer, Aditya Krishnan, Roi Sinoff
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use adaptive importance sampling over row cycles in multiple row-order passes | Schatten p estimation for k-sparse matrices · Row-order streams, even p | space dependence on matrix dimension: O_p(ε^{-2}k^{3p/2 - 3}) words | Improved |
| Restrict the input to Laplacian matrices | Row-order Schatten p algorithm · k-sparse Laplacian matrices | space: O_p(ε^{-2}k^{p/2}) words | Improved |
| Assume nonzero entries lie in [α, β] | Row-order Schatten p algorithm · k-sparse matrices with bounded positive nonzero entries | space: O_p(ε^{-2}k^{p/2 - 1}(β/α)^{p/2-2}) words | Improved |
| Use s sampled rows to cover multiple cycle segments | Row-order Schatten p algorithm · k-sparse matrices, even p | passes: ⌊p/(2(s+1))⌋+1 passes | Improved |
| Use the two-set sampling/BFS construction | Row-order Schatten p algorithm · k-sparse matrices, even p | passes: ⌊p/6⌋+1 passes | Improved |
| Remove the sparsity requirement and use the p=4 method | Schatten 4-norm estimation · Arbitrary matrices in row-order streams | space: tilde{O}_p(ε^{-2}) versus tilde{O}_p(ε^{-2}k) | Improved |
Closest papers by meaning
- Matrix Norm Estimation from a Few Entries (NeurIPS 2017 · similarity 0.92)
- Spectral Perturbation Bounds for Low-Rank Approximation with Applications to Privacy (NeurIPS 2025 · similarity 0.87)
- Fast exact recovery of noisy matrix from few entries: the infinity norm approach (NeurIPS 2025 · similarity 0.86)
- Perturbation Bounds for Low-Rank Inverse Approximations under Noise (NeurIPS 2025 · similarity 0.86)
- Nonlinear Laplacians: Tunable principal component analysis under directional prior information (NeurIPS 2025 · similarity 0.86)
- Entrywise error bounds for low-rank approximations of kernel matrices (NeurIPS 2024 · similarity 0.86)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
