DeepAI AI Chat
Log In Sign Up

Randomized Matrix Decompositions using R

by   N. Benjamin Erichson, et al.
University of Washington

Matrix decompositions are fundamental tools in the area of applied mathematics, statistical computing, and machine learning. In particular, low-rank matrix decompositions are vital, and widely used for data analysis, dimensionality reduction, and data compression. Massive datasets, however, pose a computational challenge for traditional algorithms, placing significant constraints on both memory and processing power. Recently, the powerful concept of randomness has been introduced as a strategy to ease the computational load. The essential idea of probabilistic algorithms is to employ a degree of randomness in order to derive a smaller matrix from a high-dimensional data matrix. The smaller matrix is then used to compute the desired low-rank approximation. Such algorithms are shown to be computationally efficient for approximating matrices with low-rank structure. We present the R package rsvd, and provide a tutorial introduction to randomized matrix decompositions. Specifically, randomized routines for the singular value decomposition, (robust) principal component analysis, interpolative decomposition, and CUR decomposition are discussed. Several examples demonstrate the routines, and show the computational advantage over other methods implemented in R.


page 10

page 18

page 24

page 26


Randomized Dynamic Mode Decomposition

This paper presents a randomized algorithm for computing the near-optima...

Efficient GPU implementation of randomized SVD and its applications

Matrix decompositions are ubiquitous in machine learning, including appl...

CPQR-based randomized algorithms for generalized CUR decompositions

Based on the column pivoted QR decomposition, we propose some randomized...

Unsupervised EHR-based Phenotyping via Matrix and Tensor Decompositions

Computational phenotyping allows for unsupervised discovery of subgroups...

Self-Expressive Decompositions for Matrix Approximation and Clustering

Data-aware methods for dimensionality reduction and matrix decomposition...

Simpler is better: A comparative study of randomized algorithms for computing the CUR decomposition

The CUR decomposition is a technique for low-rank approximation that sel...

Compressed Randomized UTV Decompositions for Low-Rank Approximations and Big Data Applications

Low-rank matrix approximations play a fundamental role in numerical line...

Code Repositories


Randomized Matrix Decompositions using R

view repo


Randomized Tensor Decompositions

view repo


Randomized Dimension Reduction Library

view repo