Low-Rank Matrix Recovery from Row-and-Column Affine Measurements

by   Avishai Wagner, et al.
Hebrew University of Jerusalem

We propose and study a row-and-column affine measurement scheme for low-rank matrix recovery. Each measurement is a linear combination of elements in one row or one column of a matrix X. This setting arises naturally in applications from different domains. However, current algorithms developed for standard matrix recovery problems do not perform well in our case, hence the need for developing new algorithms and theory for our problem. We propose a simple algorithm for the problem based on Singular Value Decomposition (SVD) and least-squares (LS), which we term . We prove that (a simplified version of) our algorithm can recover X exactly with the minimum possible number of measurements in the noiseless case. In the general noisy case, we prove performance guarantees on the reconstruction accuracy under the Frobenius norm. In simulations, our row-and-column design and algorithm show improved speed, and comparable and in some cases better accuracy compared to standard measurements designs and algorithms. Our theoretical and experimental results suggest that the proposed row-and-column affine measurements scheme, together with our recovery algorithm, may provide a powerful framework for affine matrix reconstruction.


page 1

page 2

page 3

page 4


Low-Rank Matrix and Tensor Completion via Adaptive Sampling

We study low rank matrix and tensor completion and propose novel algorit...

Blind Image Deblurring Using Row-Column Sparse Representations

Blind image deblurring is a particularly challenging inverse problem whe...

Subspace Estimation from Unbalanced and Incomplete Data Matrices: ℓ_2,∞ Statistical Guarantees

This paper is concerned with estimating the column space of an unknown l...

Flexible Low-Rank Statistical Modeling with Side Information

We propose a general framework for reduced-rank modeling of matrix-value...

A Greedy Algorithm for Matrix Recovery with Subspace Prior Information

Matrix recovery is the problem of recovering a low-rank matrix from a fe...

Jointly Clustering Rows and Columns of Binary Matrices: Algorithms and Trade-offs

In standard clustering problems, data points are represented by vectors,...

TARM: A Turbo-type Algorithm for Affine Rank Minimization

The affine rank minimization (ARM) problem arises in many real-world app...

Code Repositories


A MATLAB software for SVLS algorithm

view repo

Please sign up or login with your details

Forgot password? Click here to reset