Sketching sparse low-rank matrices with near-optimal sample- and time-complexity

05/12/2022
by   Xiaoqi Liu, et al.
0

We consider the problem of recovering an n_1 × n_2 low-rank matrix with k-sparse singular vectors from a small number of linear measurements (sketch). We propose a sketching scheme and an algorithm that can recover the singular vectors with high probability, with a sample complexity and running time that both depend only on k and not on the ambient dimensions n_1 and n_2. Our sketching operator, based on a scheme for compressed sensing by Li et al. and Bakshi et al., uses a combination of a sparse parity check matrix and a partial DFT matrix. Our main contribution is the design and analysis of a two-stage iterative algorithm which recovers the singular vectors by exploiting the simultaneously sparse and low-rank structure of the matrix. We derive a nonasymptotic bound on the probability of exact recovery. We also show how the scheme can be adapted to tackle matrices that are approximately sparse and low-rank. The theoretical results are validated by numerical simulations.

READ FULL TEXT

page 1

page 2

page 3

page 4

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...
02/28/2021

Sensitivity of low-rank matrix recovery

We characterize the first-order sensitivity of approximately recovering ...
07/18/2020

Compressed sensing of low-rank plus sparse matrices

Expressing a matrix as the sum of a low-rank matrix plus a sparse matrix...
12/05/2017

Optimal Sample Complexity for Stable Matrix Recovery

Tremendous efforts have been made to study the theoretical and algorithm...
04/30/2012

Recovery of Low-Rank Plus Compressed Sparse Matrices with Application to Unveiling Traffic Anomalies

Given the superposition of a low-rank matrix plus the product of a known...
04/10/2022

From graphs to DAGs: a low-complexity model and a scalable algorithm

Learning directed acyclic graphs (DAGs) is long known a critical challen...
02/28/2021

Dynamic Sample Complexity for Exact Sparse Recovery using Sequential Iterative Hard Thresholding

In this paper we consider the problem of exact recovery of a fixed spars...