Study of Compressed Randomized UTV Decompositions for Low-Rank Matrix Approximations in Data Science

06/08/2019
by   M. Kaloorazi, et al.
0

In this work, a novel rank-revealing matrix decomposition algorithm termed Compressed Randomized UTV (CoR-UTV) decomposition along with a CoR-UTV variant aided by the power method technique is proposed. CoR-UTV computes an approximation to a low-rank input matrix by making use of random sampling schemes. Given a large and dense matrix of size m× n with numerical rank k, where k ≪min{m,n}, CoR-UTV requires a few passes over the data, and runs in O(mnk) floating-point operations. Furthermore, CoR-UTV can exploit modern computational platforms and can be optimized for maximum efficiency. CoR-UTV is also applied for solving robust principal component analysis problems. Simulations show that CoR-UTV outperform existing approaches.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/15/2018

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

Low-rank matrix approximations play a fundamental role in numerical line...
research
05/14/2021

Efficient Algorithms for Constructing an Interpolative Decomposition

Low-rank approximations are essential in modern data science. The interp...
research
06/21/2023

Randomized algorithms for low-rank matrix approximation: Design, analysis, and applications

This survey explores modern approaches for computing low-rank approximat...
research
11/21/2018

Randomized Rank-Revealing UZV Decomposition for Low-Rank Approximation of Matrices

Low-rank matrix approximation plays an increasingly important role in si...
research
05/28/2020

Joint Reconstruction and Low-Rank Decomposition for Dynamic Inverse Problems

A primary interest in dynamic inverse problems is to identify the underl...
research
08/14/2022

Virgo: Scalable Unsupervised Classification of Cosmological Shock Waves

Cosmological shock waves are essential to understanding the formation of...
research
08/19/2022

Near-optimal fitting of ellipsoids to random points

Given independent standard Gaussian points v_1, …, v_n in dimension d, f...

Please sign up or login with your details

Forgot password? Click here to reset