A new analysis of the randomly pivoted Cholesky algorithm
From MaRDI portal
Cites work
- Accelerating Natural Gradient Descent for PINNs with Randomized Nyström Preconditioning
- Adaptive Sampling and Fast Low-Rank Matrix Approximation
- Bounds on the Lambert function and their application to the outage analysis of user cooperation
- Determinantal point processes in randomized numerical linear algebra
- Embrace rejection: Kernel matrix approximation by accelerated randomly pivoted Cholesky
- Everything is Vecchia: Unifying low-rank and sparse inverse Cholesky approximations
- JENSEN'S OPERATOR INEQUALITY
- Kernel interpolation with continuous volume sampling
- Kernel quadrature with randomly pivoted Cholesky
- Low rank approximation of positive semi-definite symmetric matrices using Gaussian elimination and volume sampling
- Make the most of what you have: Resource-efficient randomized algorithms for matrix computations
- Matrix functions
- Randomized Numerical Linear Algebra: Foundations & Algorithms
- Randomized Nyström Preconditioning
- Randomly pivoted Cholesky: practical approximation of a kernel matrix with few entry evaluations
- Robust, randomized preconditioning for kernel ridge regression
- Sublinear time low-rank approximation of positive semidefinite matrices
- Sublinear Time Low-Rank Approximation of Positive Semidefinite Matrices
- Subspace-constrained randomized coordinate descent for linear systems with good low-rank matrix approximations
- Ten Digits on a Train: AI-Assisted Verification of Two Eigenvalue Problems
- The fast committor machine: Interpretable prediction with kernels
- The spectral norm error of the naive Nystrom extension
This page was built for publication: A new analysis of the randomly pivoted Cholesky algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7285032)
