Multi-weight Nuclear Norm Minimization for Low-rank Matrix Recovery in Presence of Subspace Prior Information

by   Hamideh Sadat Fazael Ardakani, et al.

Weighted nuclear norm minimization has been recently recognized as a technique for reconstruction of a low-rank matrix from compressively sampled measurements when some prior information about the column and row subspaces of the matrix is available. In this work, we study the recovery conditions and the associated recovery guarantees of weighted nuclear norm minimization when multiple weights are allowed. This setup might be used when one has access to prior subspaces forming multiple angles with the column and row subspaces of the ground-truth matrix. While existing works in this field use a single weight to penalize all the angles, we propose a multi-weight problem which is designed to penalize each angle independently using a distinct weight. Specifically, we prove that our proposed multi-weight problem is stable and robust under weaker conditions for the measurement operator than the analogous conditions for single-weight scenario and standard nuclear norm minimization. Moreover, it provides better reconstruction error than the state of the art methods. We illustrate our results with extensive numerical experiments that demonstrate the advantages of allowing multiple weights in the recovery procedure.



There are no comments yet.


page 1

page 2

page 3

page 4


An Optimal Condition of Robust Low-rank Matrices Recovery

In this paper we investigate the reconstruction conditions of nuclear no...

Multi-weight Matrix Completion with Arbitrary Subspace Prior Information

Matrix completion refers to completing a low-rank matrix from a few obse...

A Greedy Algorithm for Matrix Recovery with Subspace Prior Information

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

High-Dimensional Dynamic Systems Identification with Additional Constraints

This note presents a unified analysis of the identification of dynamical...

Optimal Exploitation of Subspace Prior Information in Matrix Sensing

Matrix sensing is the problem of reconstructing a low-rank matrix from a...

Low-rank Matrix Recovery With Unknown Correspondence

We study a matrix recovery problem with unknown correspondence: given th...

Robust recovery of multiple subspaces by geometric l_p minimization

We assume i.i.d. data sampled from a mixture distribution with K compone...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.