Copertina

Randomly pivoted Cholesky: Practical approximation of a kernel matrix with few entry evaluations

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Chen, Yifan, Epperly, Ethan N., Tropp, Joel A., Webber, Robert J.
Natura:	Preprint
Pubblicazione:	2022
Soggetti:	Numerical Analysis Machine Learning 65F55, 65C99, 68T05
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Embrace rejection: Kernel matrix approximation by accelerated randomly pivoted Cholesky
di: Epperly, Ethan N., et al.
Pubblicazione: (2024)

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

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

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

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

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

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

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

Adaptive randomized pivoting and volume sampling
di: Epperly, Ethan N.
Pubblicazione: (2025)

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

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

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

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

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

Randomized methods for dynamical low-rank approximation
di: Carrel, Benjamin
Pubblicazione: (2024)

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

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

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

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

Optimal Krylov On Average
di: Luo, Qi, et al.
Pubblicazione: (2025)

Sparse inverse Cholesky factorization of dense kernel matrices by greedy conditional selection
di: Huan, Stephen, et al.
Pubblicazione: (2023)

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

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

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

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

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

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

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

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

Randomized Large-Scale Quaternion Matrix Approximation: Practical Rangefinders and One-Pass Algorithm
di: Chang, Chao, et al.
Pubblicazione: (2024)

Randomized coupled decompositions
di: Begovic, Erna, et al.
Pubblicazione: (2024)

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

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

Row-aware Randomized SVD with applications
di: Palitta, Davide, et al.
Pubblicazione: (2024)

Projected exponential methods for stiff dynamical low-rank approximation problems
di: Carrel, Benjamin, et al.
Pubblicazione: (2023)

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

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

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

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

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