Sketching low-rank matrices with a shared column space by convex programming

by   Rakshith S Srinivasa, et al.

In many practical applications including remote sensing, multi-task learning, and multi-spectrum imaging, data are described as a set of matrices sharing a common column space. We consider the joint estimation of such matrices from their noisy linear measurements. We study a convex estimator regularized by a pair of matrix norms. The measurement model corresponds to block-wise sensing and the reconstruction is possible only when the total energy is well distributed over blocks. The first norm, which is the maximum-block-Frobenius norm, favors such a solution. This condition is analogous to the notion of incoherence in matrix completion or column-wise sensing. The second norm, which is a tensor norm on a pair of suitable Banach spaces, induces low-rankness in the solution together with the first norm. We demonstrate that the convex estimator provides a provably near optimal error bound that matches a minimax lower bound up to a logarithmic factor. The convex estimator is cast as a semidefinite program and an efficient ADMM-based algorithm is derived. The empirical behavior of the convex estimator is illustrated using Monte Carlo simulations and recovery performance is compared to existing methods in the literature.


Approximately low-rank recovery from noisy and local measurements by convex program

Low-rank matrix models have been universally useful for numerous applica...

Column ℓ_2,0-norm regularized factorization model of low-rank matrix recovery and its computation

This paper is concerned with the column ℓ_2,0-regularized factorization ...

Convex Reconstruction of Structured Matrix Signals from Random Linear Measurements (I): Theoretical Results

We investigate the problem of reconstructing n-by-n column-wise sparse m...

Recovery of simultaneous low rank and two-way sparse coefficient matrices, a nonconvex approach

We study the problem of recovery of matrices that are simultaneously low...

Low-Rank Matrix Estimation From Rank-One Projections by Unlifted Convex Optimization

We study an estimator with a convex formulation for recovery of low-rank...

Convex Coupled Matrix and Tensor Completion

We propose a set of convex low rank inducing norms for a coupled matrice...

Convex block-sparse linear regression with expanders -- provably

Sparse matrices are favorable objects in machine learning and optimizati...

Please sign up or login with your details

Forgot password? Click here to reset