Cover Image

Embrace rejection: Kernel matrix approximation by accelerated randomly pivoted Cholesky

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Epperly, Ethan N., Tropp, Joel A., Webber, Robert J.
Format:	Preprint
Published:	2024
Subjects:	Numerical Analysis Computation Machine Learning 65F55, 65C99, 68T05
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Randomly pivoted Cholesky: Practical approximation of a kernel matrix with few entry evaluations
by: Chen, Yifan, et al.
Published: (2022)

XTrace: Making the most of every sample in stochastic trace estimation
by: Epperly, Ethan N., et al.
Published: (2023)

Sharp analysis of sketched least squares and randomized low-rank approximation
by: Epperly, Ethan N., et al.
Published: (2026)

Make the most of what you have: Resource-efficient randomized algorithms for matrix computations
by: Epperly, Ethan N.
Published: (2025)

Everything is Vecchia: Unifying low-rank and sparse inverse Cholesky approximations
by: Kaminetz, Eagan, et al.
Published: (2026)

Efficient error and variance estimation for randomized matrix computations
by: Epperly, Ethan N., et al.
Published: (2022)

Robust, randomized preconditioning for kernel ridge regression
by: Díaz, Mateo, et al.
Published: (2023)

Adaptive randomized pivoting and volume sampling
by: Epperly, Ethan N.
Published: (2025)

Faster Linear Algebra Algorithms with Structured Random Matrices
by: Camaño, Chris, et al.
Published: (2025)

Adaptive randomized pivoting for column subset selection, DEIM, and low-rank approximation
by: Cortinovis, Alice, et al.
Published: (2024)

Robust Blockwise Random Pivoting: Fast and Accurate Adaptive Interpolative Decomposition
by: Dong, Yijun, et al.
Published: (2023)

Fast and forward stable randomized algorithms for linear least-squares problems
by: Epperly, Ethan N.
Published: (2023)

Superfast direct inversion of the nonuniform discrete Fourier transform via hierarchically semi-separable least squares
by: Wilber, Heather, et al.
Published: (2024)

Optimal Krylov On Average
by: Luo, Qi, et al.
Published: (2025)

Multilevel Picard approximations overcome the curse of dimensionality when approximating semilinear heat equations with gradient-dependent nonlinearities in $L^p$-sense
by: Nguyen, Tuan Anh
Published: (2024)

Randomized block-Krylov subspace methods for low-rank approximation of matrix functions
by: Persson, David, et al.
Published: (2025)

A hybrid interpolation ACA accelerated method for parabolic boundary integral operators
by: Ambikasaran, Sivaram, et al.
Published: (2024)

Efficient error estimators for Generalized Nyström
by: Lazzarino, Lorenzo, et al.
Published: (2026)

Fast randomized numerical rank estimation for numerically low-rank matrices
by: Meier, Maike, et al.
Published: (2021)

Fast randomized least-squares solvers can be just as accurate and stable as classical direct solvers
by: Epperly, Ethan N., et al.
Published: (2024)

A Parallel-in-Time Combination Method for Parabolic Problems
by: Griebel, Michael, et al.
Published: (2025)

Error bounds for some approximate posterior measures in Bayesian inference
by: Lie, Han Cheng, et al.
Published: (2019)

Detecting when one probe vector is enough for preconditioned log-determinant approximation
by: Cortinovis, Alice, et al.
Published: (2026)

Algorithm-agnostic low-rank approximation of operator monotone matrix functions
by: Persson, David, et al.
Published: (2023)

Mathematical and numerical analysis of quantum signal processing
by: Lin, Lin
Published: (2025)

Parallel-in-time Multilevel Krylov Methods: A Prototype
by: Erlangga, Yogi A.
Published: (2023)

Does block size matter in randomized block Krylov low-rank approximation?
by: Chen, Tyler, et al.
Published: (2025)

Randomized methods for dynamical low-rank approximation
by: Carrel, Benjamin
Published: (2024)

Rejuvenating AMLI-Cycle: From Chebyshev Polynomials to Momentum Acceleration
by: Niu, Chunyan, et al.
Published: (2020)

Numerical Instabilities in the Kaczmarz Method and Stabilization by Iterative Refinement
by: Dereziński, Michał, et al.
Published: (2026)

Fast, High-Accuracy, Randomized Nullspace Computations for Tall Matrices
by: Epperly, Ethan N., et al.
Published: (2026)

A fast time-stepping strategy for dynamical systems equipped with a surrogate model
by: Roberts, Steven, et al.
Published: (2020)

CUR Matrix Approximation through Convex Optimization for Feature Selection
by: Linehan, Kathryn, et al.
Published: (2025)

Recursive sparse LU decomposition based on nested dissection and low rank approximations
by: Xuanru, Zhu, et al.
Published: (2024)

Arbitrary order approximations at constant cost for Timoshenko beam network models
by: Hauck, Moritz, et al.
Published: (2024)

Linear-Scaling Tensor Train Sketching
by: Cazeaux, Paul, et al.
Published: (2026)

Double-activation neural network for solving parabolic equations with time delay
by: Huang, Qiumei, et al.
Published: (2024)

Stochastic Trace Optimization of Parameter Dependent Matrices Based on Statistical Learning Theory
by: Saibaba, Arvind K., et al.
Published: (2025)

On fast Fourier solvers for the tensor product high-order FEM for a generalized Poisson equation
by: Zlotnik, Alexander, et al.
Published: (2017)

A direct fast FFT-based implementation for high order finite element method on rectangular parallelepipeds for PDE
by: Zlotnik, Alexander, et al.
Published: (2016)