Numerical linear algebra in the streaming model
From MaRDI portal
Recommendations
- Frequent directions: simple and deterministic matrix sketching
- On approximating matrix norms in data streams
- Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication
- Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition
- Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
Cited in
(71)- Random projections for Bayesian regression
- Randomized LU decomposition
- Structural results on matching estimation with applications to streaming
- Pass-efficient methods for compression of high-dimensional turbulent flow data
- Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections
- Narrow big data in a stream: computational limitations and regression
- Streaming algorithms for extent problems in high dimensions
- Frequent directions: simple and deterministic matrix sketching
- Sketching as a tool for numerical linear algebra
- Derandomizing restricted isometries via the Legendre symbol
- Single pass spectral sparsification in dynamic streams
- Multiplicative Approximations of Random Walk Transition Probabilities
- Everywhere-Tight Information Cost Tradeoffs for Augmented Index
- Almost Optimal Explicit Johnson-Lindenstrauss Families
- Sparser Johnson-Lindenstrauss transforms
- Core-sets: updated survey
- Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering
- Sublinear estimation of weighted matchings in dynamic data streams
- Randomized algorithms in numerical linear algebra
- Practical sketching algorithms for low-rank matrix approximation
- Literature survey on low rank approximation of matrices
- scientific article; zbMATH DE number 7049775 (Why is no real title available?)
- Online row sampling
- Approximating subadditive Hadamard functions on implicit matrices
- Randomized sketching algorithms for low-memory dynamic optimization
- Communication-efficient distributed covariance sketch, with application to distributed PCA
- Tight bounds for the subspace sketch problem with applications
- Querying a Matrix through Matrix-Vector Products
- Querying a Matrix Through Matrix-Vector Products.
- Optimality of linear sketching under modular updates
- Memory-sample tradeoffs for linear regression with small error
- Streaming low-rank matrix approximation with an application to scientific simulation
- On approximating matrix norms in data streams
- Turnstile streaming algorithms might as well be linear sketches
- Summary data structures for massive data
- Optimal principal component analysis in distributed and streaming models
- On approximating functions of the singular values in a stream
- Sketching for principal component regression
- On sketching matrix norms and the top singular vector
- Eigenvalues of a matrix in the streaming model
- Sparser Johnson-Lindenstrauss transforms
- Online row sampling
- Improved Algorithms for Time Decay Streams
- Randomized numerical linear algebra: Foundations and algorithms
- Robust Recovery of Low-Rank Matrices and Low-Tubal-Rank Tensors from Noisy Sketches
- Streaming Tensor Train Approximation
- scientific article; zbMATH DE number 7758314 (Why is no real title available?)
- Fast Metric Embedding into the Hamming Cube
- A fast randomized algorithm for computing an approximate null space
- Faster least squares approximation
- Randomized block Krylov subspace algorithms for low-rank quaternion matrix approximations
- RA-HOOI: rank-adaptive higher-order orthogonal iteration for the fixed-accuracy low multilinear-rank approximation of tensors
- Randomized low-rank approximation methods for projection-based model order reduction of large nonlinear dynamical problems
- Solving, tracking and stopping streaming linear inverse problems
- A sequential multilinear Nyström algorithm for streaming low-rank approximation of tensors in Tucker format
- Online randomized interpolative decomposition with \textit{a posteriori} error estimator for temporal PDE data reduction
- Sharp error bounds for approximate eigenvalues and singular values from subspace methods
- Matrix perturbation analysis of methods for extracting singular values from approximate singular subspaces
- Randomized methods for dynamical low-rank approximation
- Turning big data into tiny data: coresets for unsupervised learning problems
- Near-linear time and fixed-parameter tractable algorithms for tensor decompositions
- A generalized Nyström method with subspace iteration for low-rank approximations of large-scale nonsymmetric matrices
- Efficient convex optimization requires superlinear memory
- Detecting interactions in high-dimensional data using cross leverage scores
- Satisfying the restricted isometry property with the optimal number of rows and slightly less randomness
- Fixed-sparsity matrix approximation from matrix-vector products
- A very sketchy talk (invited talk)
- Almost optimal superconstant-pass streaming lower bounds for reachability
- Fast one-pass sparse approximation of the top eigenvectors of huge approximately low-rank matrices? Yes, MAM^!
- Guessing efficiently for constrained subspace approximation
- Hutch#: Optimal non-adaptive Frobenius norm estimation
This page was built for publication: Numerical linear algebra in the streaming model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5172714)
