Adaptive randomized pivoting and volume sampling

DOI10.1137/25M1818503MaRDI QIDQ7404671zbMATH OpenFDO

Authors Ethan N. Epperly

Publication date 2026

Published in SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/25M1818503

zbMATH Keywords

active learningcolumn subset selectionQR factorizationvolume sampling

Mathematics Subject Classification ID

Numerical methods for low-rank matrix approximation; matrix compression (65F55) Randomized algorithms (68W20)

Cites work

• A DEIM induced CUR factorization
• A fast randomized algorithm for computing a hierarchically semiseparable representation of a matrix
• A Stable and Efficient Algorithm for the Rank-One Modification of the Symmetric Eigenproblem
• Adaptive randomized pivoting for column subset selection, DEIM, and low-rank approximation
• Adaptive Sampling and Fast Low-Rank Matrix Approximation
• An improved approximation algorithm for the column subset selection problem
• Comparison theorems for the minimum eigenvalue of a random positive-semidefinite matrix
• CUR matrix decompositions for improved data analysis
• Determinantal point processes in randomized numerical linear algebra
• Determinantal processes and independence
• Efficient algorithms for CUR and interpolative matrix decompositions
• Embrace rejection: kernel matrix approximation by accelerated randomly pivoted Cholesky
• Fast Monte-Carlo algorithms for finding low-rank approximations
• Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
• scientific article; zbMATH DE number 6159604 (Why is no real title available?)
• Matrix approximation and projective clustering via volume sampling
• Nearly tight oblivious subspace embeddings by trace inequalities
• Optimal subspace embeddings: resolving Nelson-nguyen conjecture up to sub-polylogarithmic factors
• Randomized numerical linear algebra: Foundations and algorithms
• Randomly pivoted Cholesky: practical approximation of a kernel matrix with few entry evaluations
• Reverse iterative volume sampling for linear regression
• Robust blockwise random pivoting: fast and accurate adaptive interpolative decomposition
• Simpler is better: a comparative study of randomized pivoting algorithms for CUR and interpolative decompositions
• Sketching as a tool for numerical linear algebra
• Sparsity lower bounds for dimensionality reducing maps
• Streaming low-rank matrix approximation with an application to scientific simulation
• Subspace Iteration Randomization and Singular Value Problems
• TT-cross approximation for multidimensional arrays

This page was built for publication: Adaptive randomized pivoting and volume sampling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7404671)