Accuracy and Stability of CUR decompositions with Oversampling

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Park, Taejun, Nakatsukasa, Yuji
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866915218094817280
author Park, Taejun
Nakatsukasa, Yuji
author_facet Park, Taejun
Nakatsukasa, Yuji
contents This work investigates the accuracy and numerical stability of CUR decompositions with oversampling. The CUR decomposition approximates a matrix using a subset of columns and rows of the matrix. When the number of columns and the rows are the same, the CUR decomposition can become unstable and less accurate due to the presence of the matrix inverse in the core matrix. Nevertheless, we demonstrate that the CUR decomposition can be implemented in a numerical stable manner and illustrate that oversampling, which increases either the number of columns or rows in the CUR decomposition, can enhance its accuracy and stability. Additionally, this work devises an algorithm for oversampling motivated by the theory of the CUR decomposition and the cosine-sine decomposition, whose competitiveness is illustrated through experiments.
format Preprint
id arxiv_https___arxiv_org_abs_2405_06375
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Accuracy and Stability of CUR decompositions with Oversampling
Park, Taejun
Nakatsukasa, Yuji
Numerical Analysis
15A23, 65F55, 65G50
This work investigates the accuracy and numerical stability of CUR decompositions with oversampling. The CUR decomposition approximates a matrix using a subset of columns and rows of the matrix. When the number of columns and the rows are the same, the CUR decomposition can become unstable and less accurate due to the presence of the matrix inverse in the core matrix. Nevertheless, we demonstrate that the CUR decomposition can be implemented in a numerical stable manner and illustrate that oversampling, which increases either the number of columns or rows in the CUR decomposition, can enhance its accuracy and stability. Additionally, this work devises an algorithm for oversampling motivated by the theory of the CUR decomposition and the cosine-sine decomposition, whose competitiveness is illustrated through experiments.
title Accuracy and Stability of CUR decompositions with Oversampling
topic Numerical Analysis
15A23, 65F55, 65G50
url https://arxiv.org/abs/2405.06375