Streaming Low-Rank Matrix Approximation with an Application to Scientific Simulation
From MaRDI portal
Publication:5230655
DOI10.1137/18M1201068zbMath1420.65060arXiv1902.08651OpenAlexW2964361301MaRDI QIDQ5230655
Madeleine Udell, Joel A. Tropp, Volkan Cevher, A. Yurtsever
Publication date: 28 August 2019
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1902.08651
sketchingsingular value decompositiondimension reductionnumerical linear algebrastreamingmatrix approximation
Related Items
Pass-efficient methods for compression of high-dimensional turbulent flow data, Low-Rank Tucker Approximation of a Tensor from Streaming Data, Randomized numerical linear algebra: Foundations and algorithms, A Nonlinear Matrix Decomposition for Mining the Zeros of Sparse Data, Simpler is better: a comparative study of randomized pivoting algorithms for CUR and interpolative decompositions, Robust Recovery of Low-Rank Matrices and Low-Tubal-Rank Tensors from Noisy Sketches, Finding robust minimizer for non-convex phase retrieval, Randomized Low-Rank Approximation for Symmetric Indefinite Matrices, Practical sketching algorithms for low-rank Tucker approximation of large tensors, Principled interpolation of Green's functions learned from data, Pass-efficient truncated UTV for low-rank approximations, Fast Metric Embedding into the Hamming Cube, Fast randomized numerical rank estimation for numerically low-rank matrices, Efficient Error and Variance Estimation for Randomized Matrix Computations, A fast randomized algorithm for computing an approximate null space, A stable parareal-like method for the second order wave equation, Memory-Efficient Structured Convex Optimization via Extreme Point Sampling, Single-pass randomized algorithms for LU decomposition, Randomized Sketching Algorithms for Low-Memory Dynamic Optimization, Scalable Semidefinite Programming, Perturbations of CUR Decompositions, Single-pass randomized QLP decomposition for low-rank approximation, Bootstrapping the operator norm in high dimensions: error estimation for covariance matrices and sketching
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- Toward a unified theory of sparse dimensionality reduction in Euclidean space
- A randomized algorithm for the decomposition of matrices
- Tracking join and self-join sizes in limited storage
- Improved bounds on sample size for implicit matrix trace estimators
- A fast randomized algorithm for the approximation of matrices
- Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
- Latent semantic indexing: A probabilistic analysis
- Principal component analysis.
- Fast low-rank modifications of the thin singular value decomposition
- Frequent Directions: Simple and Deterministic Matrix Sketching
- Improved Matrix Algorithms via the Subsampled Randomized Hadamard Transform
- Model-based scaling of the streamwise energy density in high-Reynolds-number turbulent channels
- Climate Modeling for Scientists and Engineers
- Computational Advertising: Techniques for Targeting Relevant Ads
- Dimensionality Reduction for k-Means Clustering and Low Rank Approximation
- Randomized algorithms for estimating the trace of an implicit symmetric positive semi-definite matrix
- IMPROVED ANALYSIS OF THE SUBSAMPLED RANDOMIZED HADAMARD TRANSFORM
- An Algorithm for the Principal Component Analysis of Large Data Sets
- Randomized Algorithms for Matrices and Data
- Low-Rank Approximation and Regression in Input Sparsity Time
- A Fast Randomized Algorithm for Computing a Hierarchically Semiseparable Representation of a Matrix
- Estimating Extremal Eigenvalues and Condition Numbers of Matrices
- Extensions of Lipschitz mappings into a Hilbert space
- A Stochastic Estimator of the Trace of the Influence Matrix for Laplacian Smoothing Splines
- A Randomized Algorithm for Principal Component Analysis
- Large Eddy Simulation for Compressible Flows
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Algorithm 799: revolve
- Improved Bounds for Small-Sample Estimation
- Nearly Tight Oblivious Subspace Embeddings by Trace Inequalities
- Practical Sketching Algorithms for Low-Rank Matrix Approximation
- Geometric Subspace Updates with Applications to Online Adaptive Nonlinear Model Reduction
- Compression and Conditional Emulation of Climate Model Output
- Low-Rank Tucker Approximation of a Tensor from Streaming Data
- Lower Bounds for Oblivious Subspace Embeddings
- Numerical linear algebra in the streaming model
- The Fast Johnson–Lindenstrauss Transform and Approximate Nearest Neighbors
- Turnstile streaming algorithms might as well be linear sketches
- Optimal principal component analysis in distributed and streaming models
- Fast monte-carlo algorithms for finding low-rank approximations
- Low-distortion subspace embeddings in input-sparsity time and applications to robust linear regression
- Large Eddy Simulation for Incompressible Flows
