Error Estimation for Sketched SVD via the Bootstrap

by   Miles E. Lopes, et al.

In order to compute fast approximations to the singular value decompositions (SVD) of very large matrices, randomized sketching algorithms have become a leading approach. However, a key practical difficulty of sketching an SVD is that the user does not know how far the sketched singular vectors/values are from the exact ones. Indeed, the user may be forced to rely on analytical worst-case error bounds, which do not account for the unique structure of a given problem. As a result, the lack of tools for error estimation often leads to much more computation than is really necessary. To overcome these challenges, this paper develops a fully data-driven bootstrap method that numerically estimates the actual error of sketched singular vectors/values. In particular, this allows the user to inspect the quality of a rough initial sketched SVD, and then adaptively predict how much extra work is needed to reach a given error tolerance. Furthermore, the method is computationally inexpensive, because it operates only on sketched objects, and it requires no passes over the full matrix being factored. Lastly, the method is supported by theoretical guarantees and a very encouraging set of experimental results.



There are no comments yet.


page 11


Ranky : An Approach to Solve Distributed SVD on Large Sparse Matrices

Singular Value Decomposition (SVD) is a well studied research topic in m...

Error Estimation for Randomized Least-Squares Algorithms via the Bootstrap

Over the course of the past decade, a variety of randomized algorithms h...

Batched computation of the singular value decompositions of order two by the AVX-512 vectorization

In this paper a vectorized algorithm for simultaneously computing up to ...

Compressive spectral embedding: sidestepping the SVD

Spectral embedding based on the Singular Value Decomposition (SVD) is a ...

Fast Singular Value Shrinkage with Chebyshev Polynomial Approximation Based on Signal Sparsity

We propose an approximation method for thresholding of singular values u...

An Empirical Evaluation of Sketched SVD and its Application to Leverage Score Ordering

The power of randomized algorithms in numerical methods have led to fast...

LazySVD: Even Faster SVD Decomposition Yet Without Agonizing Pain

We study k-SVD that is to obtain the first k singular vectors of a matri...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.