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

12/05/2014
by   Sampurna Biswas, et al.
0

We introduce a two step algorithm with theoretical guarantees to recover a jointly sparse and low-rank matrix from undersampled measurements of its columns. The algorithm first estimates the row subspace of the matrix using a set of common measurements of the columns. In the second step, the subspace aware recovery of the matrix is solved using a simple least square algorithm. The results are verified in the context of recovering CINE data from undersampled measurements; we obtain good recovery when the sampling conditions are satisfied.

READ FULL TEXT
research
06/02/2022

Robust recovery of low-rank matrices and low-tubal-rank tensors from noisy sketches

A common approach for compressing large-scale data is through matrix ske...
research
12/05/2014

Subspace based low rank and joint sparse matrix recovery

We consider the recovery of a low rank and jointly sparse matrix from un...
research
07/01/2014

Identifying Outliers in Large Matrices via Randomized Adaptive Compressive Sampling

This paper examines the problem of locating outlier columns in a large, ...
research
07/31/2019

SketchyCoreSVD: SketchySVD from Random Subsampling of the Data Matrix

We present a method called SketchyCoreSVD to compute the near-optimal ra...
research
03/03/2021

Riemannian thresholding methods for row-sparse and low-rank matrix recovery

In this paper, we present modifications of the iterative hard thresholdi...
research
07/07/2021

A Generalized CUR decomposition for matrix pairs

We propose a generalized CUR (GCUR) decomposition for matrix pairs (A, B...
research
01/03/2018

Recovery of Noisy Points on Band-limited Surfaces: Kernel Methods Re-explained

We introduce a continuous domain framework for the recovery of points on...

Please sign up or login with your details

Forgot password? Click here to reset