Cover Image

Fast Rank Adaptive CUR via a Recycled Small Sketch

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Pritchard, Nathaniel, Park, Taejun, Nakatsukasa, Yuji, Martinsson, Per-Gunnar
Format:	Preprint
Published:	2025
Subjects:	Numerical Analysis Computation 65F55, 15A23, 68W20
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Low-rank approximation of parameter-dependent matrices via CUR decomposition
by: Park, Taejun, et al.
Published: (2024)

Accuracy and Stability of CUR decompositions with Oversampling
by: Park, Taejun, et al.
Published: (2024)

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

Efficient Bounds and Estimates for Canonical Angles in Randomized Subspace Approximations
by: Dong, Yijun, et al.
Published: (2022)

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

Improving Sketching Algorithms for Low-Rank Matrix Approximation via Sketch-Power Iterations
by: Chang, Chao, et al.
Published: (2026)

Numerical Stability of the Nyström Method
by: Bucci, Alberto, et al.
Published: (2025)

Fast and Accurate Interpolative Decompositions for General, Sparse, and Structured Tensors
by: Zhang, Yifan, et al.
Published: (2025)

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

Sharp error bounds for approximate eigenvalues and singular values from subspace methods
by: Haas, Irina-Beatrice, et al.
Published: (2025)

The Pseudoinverse of $A=CR$ is $A^+=R^+C^+$ (?)
by: Karpowicz, Michał P., et al.
Published: (2023)

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

Matrix perturbation analysis of methods for extracting singular values from approximate singular subspaces
by: Lazzarino, Lorenzo, et al.
Published: (2024)

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

Accelerating a restarted Krylov method for matrix functions with randomization
by: Guidotti, Nicolas L., et al.
Published: (2025)

Randomized algorithms for streaming low-rank approximation in tree tensor network format
by: Bucci, Alberto, et al.
Published: (2024)

A sequential multilinear Nyström algorithm for streaming low-rank approximation of tensors in Tucker format
by: Bucci, Alberto, et al.
Published: (2024)

Approximating Sparse Matrices and their Functions using Matrix-vector products
by: Park, Taejun, et al.
Published: (2023)

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

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

Efficient Sketching-Based Summation of Tucker Tensors
by: Smith, Rudi, et al.
Published: (2026)

Randomized coupled decompositions
by: Begovic, Erna, et al.
Published: (2024)

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

Randomized flexible Krylov methods for $\ell_p$ regularization
by: Landman, Malena Sabaté, et al.
Published: (2025)

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

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

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

Randomized algorithms for computing the tensor train approximation and their applications
by: Che, Maolin, et al.
Published: (2024)

Efficient randomized algorithms for the fixed Tucker-rank problem of Tucker decomposition with adaptive shifts
by: Che, Maolin, et al.
Published: (2025)

Beyond Low Rank: Fast Low-Rank + Diagonal Decomposition with a Spectral Approach
by: Yeon, Kingsley, et al.
Published: (2025)

Robust Tensor CUR Decompositions: Rapid Low-Tucker-Rank Tensor Recovery with Sparse Corruption
by: Cai, HanQin, et al.
Published: (2023)

Stochastic trace estimation for parameter-dependent matrices applied to spectral density approximation
by: Matti, Fabio, et al.
Published: (2025)

Quasi-optimal hierarchically semi-separable matrix approximation
by: Amsel, Noah, et al.
Published: (2025)

Optimal Sensor Placement in Gaussian Processes via Column Subset Selection
by: Chen, Jessie, et al.
Published: (2026)

On a randomized small-block Lanczos method for large-scale null space computations
by: Kressner, Daniel, et al.
Published: (2024)

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

Sequential Least-Squares Estimators with Fast Randomized Sketching for Linear Statistical Models
by: Chen, Guan-Yu, et al.
Published: (2025)

Distributed Hybrid Sketching for $\ell_2$-Embeddings
by: Charalambides, Neophytos, et al.
Published: (2024)

Subspace-constrained randomized coordinate descent for linear systems with good low-rank matrix approximations
by: Lok, Jackie, et al.
Published: (2025)

Randomized Matrix Sketching for Neural Network Training and Gradient Monitoring
by: Antil, Harbir, et al.
Published: (2025)