Optimal Sample Complexity for Stable Matrix Recovery

12/05/2017
by   Yanjun Li, et al.
0

Tremendous efforts have been made to study the theoretical and algorithmic aspects of sparse recovery and low-rank matrix recovery. This paper fills a theoretical gap in matrix recovery: the optimal sample complexity for stable recovery without constants or log factors. We treat sparsity, low-rankness, and potentially other parsimonious structures within the same framework: constraint sets that have small covering numbers or Minkowski dimensions. We consider three types of random measurement matrices (unstructured, rank-1, and symmetric rank-1 matrices), following probability distributions that satisfy some mild conditions. In all these cases, we prove a fundamental result -- the recovery of matrices with parsimonious structures, using an optimal (or near optimal) number of measurements, is stable with high probability.

READ FULL TEXT
06/28/2018

Matrix Recovery from Rank-One Projection Measurements via Nonconvex Minimization

In this paper, we consider the matrix recovery from rank-one projection ...
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...
05/12/2022

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

We consider the problem of recovering an n_1 × n_2 low-rank matrix with ...
04/06/2020

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...
02/10/2017

A New Rank Constraint on Multi-view Fundamental Matrices, and its Application to Camera Location Recovery

Accurate estimation of camera matrices is an important step in structure...
04/12/2016

Structured Matrix Recovery via the Generalized Dantzig Selector

In recent years, structured matrix recovery problems have gained conside...
09/12/2019

Learning Graphs from Linear Measurements: Fundamental Trade-offs and Applications

We consider a specific graph learning task: reconstructing a symmetric m...