Out-of-core singular value decomposition

07/15/2019
by   Vadim Demchik, et al.
0

Singular value decomposition (SVD) is a standard matrix factorization technique that produces optimal low-rank approximations of matrices. It has diverse applications, including machine learning, data science and signal processing. However, many common problems involve very large matrices that cannot fit in the main memory of commodity computers, making it impractical to use standard SVD algorithms that assume fast random access or large amounts of space for intermediate calculations. To address this issue, we have implemented an out-of-core (external memory) randomized SVD solution that is fully scalable and efficiently parallelizable. This solution factors both dense and sparse matrices of arbitrarily large size within arbitrarily small memory limits, efficiently using out-of-core storage as needed. It uses an innovative technique for partitioning matrices that lends itself to out-of-core and parallel processing, as well as memory and I/O use planning, automatic load balancing, performance tuning, and makes possible a number of other practical enhancements to the current state-of-the-art. Furthermore, by using persistent external storage (generally HDDs or SSDs), users can resume interrupted operations without having to recalculate previously performed steps, solving a major practical problem in factoring very large matrices.

READ FULL TEXT

page 9

page 10

research
11/26/2019

Shifted Randomized Singular Value Decomposition

We extend the randomized singular value decomposition (SVD) algorithm <c...
research
05/27/2023

On the Noise Sensitivity of the Randomized SVD

The randomized singular value decomposition (R-SVD) is a popular sketchi...
research
08/10/2020

Randomized Projection for Rank-Revealing Matrix Factorizations and Low-Rank Approximations

Rank-revealing matrix decompositions provide an essential tool in spectr...
research
10/25/2021

NetMF+: Network Embedding Based on Fast and Effective Single-Pass Randomized Matrix Factorization

In this work, we propose NetMF+, a fast, memory-efficient, scalable, and...
research
08/19/2021

U-match factorization: sparse homological algebra, lazy cycle representatives, and dualities in persistent (co)homology

Persistent homology is a leading tool in topological data analysis (TDA)...
research
02/17/2020

Computing rank-revealing factorizations of matrices stored out-of-core

This paper describes efficient algorithms for computing rank-revealing f...
research
04/29/2021

High-Performance Partial Spectrum Computation for Symmetric eigenvalue problems and the SVD

Current dense symmetric eigenvalue (EIG) and singular value decompositio...

Please sign up or login with your details

Forgot password? Click here to reset