mlsanityData to 14 Oct 2026

Efficient error and variance estimation for randomized matrix computations

arXiv 2207.06342 ↗First posted 13 Jul 2022math.NA cs.NA stat.MLcited by 1

Not on the map. Why?

Abstract (arXiv)

Randomized matrix algorithms have become workhorse tools in scientific computing and machine learning. To use these algorithms safely in applications, they should be coupled with posterior error estimates to assess the quality of the output. To meet this need, this paper proposes two diagnostics: a leave-one-out error estimator for randomized low-rank approximations and a jackknife resampling method to estimate the variance of the output of a randomized matrix computation. Both of these diagnostics are rapid to compute for randomized low-rank approximation algorithms such as the randomized SVD and randomized Nystr"om approximation, and they provide useful information that can be used to assess the quality of the computed output and guide algorithmic parameter choices.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 7 of its 38 references that are in the map. First posted on arXiv 13 Jul 2022.

Builds on

7 of 38 references.

References · 7

  1. 2014Sketching as a Tool for Numerical Linear Algebracited by 288
  2. 2013Revisiting the Nystrom Method for Improved Large-Scale Machine Learningcited by 77
  3. 2015Randomized Block Krylov Methods for Stronger and Faster Approximate Singular Value Decompositioncited by 64
  4. 2017Fixed-Rank Approximation of a Positive-Semidefinite Matrix from Streaming Datacited by 23
  5. 2017A Bootstrap Method for Error Estimation in Randomized Matrix Multiplicationcited by 5
  6. 2020Error Estimation for Sketched SVD via the Bootstrapcited by 5
  7. 2019Bootstrapping the Operator Norm in High Dimensions: Error Estimation for Covariance Matrices and Sketchingcited by 4

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.