A Generalized CUR decomposition for matrix pairs

by   Perfect Y. Gidisu, et al.

We propose a generalized CUR (GCUR) decomposition for matrix pairs (A, B). Given matrices A and B with the same number of columns, such a decomposition provides low-rank approximations of both matrices simultaneously, in terms of some of their rows and columns. We obtain the indices for selecting the subset of rows and columns of the original matrices using the discrete empirical interpolation method (DEIM) on the generalized singular vectors. When B is square and nonsingular, there are close connections between the GCUR of (A, B) and the DEIM-induced CUR of AB^-1. When B is the identity, the GCUR decomposition of A coincides with the DEIM-induced CUR decomposition of A. We also show a similar connection between the GCUR of (A, B) and the CUR of AB^+ for a nonsquare but full-rank matrix B, where B^+ denotes the Moore–Penrose pseudoinverse of B. While a CUR decomposition acts on one data set, a GCUR factorization jointly decomposes two data sets. The algorithm may be suitable for applications where one is interested in extracting the most discriminative features from one data set relative to another data set. In numerical experiments, we demonstrate the advantages of the new method over the standard CUR approximation; for recovering data perturbed with colored noise and subgroup discovery.


page 1

page 2

page 3

page 4


RSVD-CUR Decomposition for Matrix Triplets

We propose a restricted SVD based CUR (RSVD-CUR) decomposition for matri...

Randomized GCUR decompositions

By exploiting the random sampling techniques, this paper derives an effi...

Two step recovery of jointly sparse and low-rank matrices: theoretical guarantees

We introduce a two step algorithm with theoretical guarantees to recover...

Efficient Algorithms for Constructing an Interpolative Decomposition

Low-rank approximations are essential in modern data science. The interp...

Hadamard Matrices, Quaternions, and the Pearson Chi-square Statistic

We present a symbolic decomposition of the Pearson chi-square statistic ...

An efficient, memory-saving approach for the Loewner framework

The Loewner framework is one of the most successful data-driven model or...

A random algorithm for low-rank decomposition of large-scale matrices with missing entries

A Random SubMatrix method (RSM) is proposed to calculate the low-rank de...

Please sign up or login with your details

Forgot password? Click here to reset