Embrace rejection: kernel matrix approximation by accelerated randomly pivoted Cholesky

DOI10.1137/24M1699048MaRDI QIDQ6881036zbMATH OpenFDO

Authors Ethan N. Epperly, Joel A. Tropp, Robert J. Webber

Publication date 18 December 2025

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

zbMATH Keywords

kernel matrixlow-rank approximationrandomCholesky decompositionpositive-semidefinite matrixNyström approximation

Mathematics Subject Classification ID

Numerical methods for low-rank matrix approximation; matrix compression (65F55)

Cites work

• scientific article; zbMATH DE number 6159604 (Why is no real title available?)
• scientific article; zbMATH DE number 4189084 (Why is no real title available?)
• 10.1162/15324430260185619
• Accuracy and Stability of Numerical Algorithms
• Adaptive Sampling and Fast Low-Rank Matrix Approximation
• Faster kernel ridge regression using sketching and preconditioning
• Matrix approximation and projective clustering via volume sampling
• Matrix theory. Basic results and techniques
• On the Nyström method for approximating a gram matrix for improved kernel-based learning
• Randomized Nyström Preconditioning
• Randomly pivoted Cholesky: practical approximation of a kernel matrix with few entry evaluations
• Robust blockwise random pivoting: fast and accurate adaptive interpolative decomposition
• Rounding error analysis of the classical Gram-Schmidt orthogonalization process
• Sketching as a tool for numerical linear algebra
• Sublinear time low-rank approximation of positive semidefinite matrices

This page was built for publication: Embrace rejection: kernel matrix approximation by accelerated randomly pivoted Cholesky

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