pith. sign in

arxiv: 1706.07191 · v1 · pith:E5EFNOXInew · submitted 2017-06-22 · 💻 cs.DC

High-Performance Out-of-core Block Randomized Singular Value Decomposition on GPU

classification 💻 cs.DC
keywords randomizedblockcomputationdatadecompositionlarge-scalemethodsprocessing
0
0 comments X
read the original abstract

Fast computation of singular value decomposition (SVD) is of great interest in various machine learning tasks. Recently, SVD methods based on randomized linear algebra have shown significant speedup in this regime. This paper attempts to further accelerate the computation by harnessing a modern computing architecture, namely graphics processing unit (GPU), with the goal of processing large-scale data that may not fit in the GPU memory. It leads to a new block randomized algorithm that fully utilizes the power of GPUs and efficiently processes large-scale data in an out-of- core fashion. Our experiment shows that the proposed block randomized SVD (BRSVD) method outperforms existing randomized SVD methods in terms of speed with retaining the same accuracy. We also show its application to convex robust principal component analysis, which shows significant speedup in computer vision applications.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Out-of-core singular value decomposition

    cs.MS 2019-07 unverdicted novelty 6.0

    An out-of-core randomized SVD implementation that factors arbitrarily large dense and sparse matrices within small memory limits via innovative partitioning for scalability and resumability.