Upper Bounds on the Error of Sparse Vector and Low-Rank Matrix Recovery

Abstract

Suppose that a solution $\tilde{\mathbf{x}}$ to an underdetermined linear system $\mathbf{b}=\mathbf{Ax}$ is given. $\tilde{\mathbf{x}}$ is approximately sparse meaning that it has a few large components compared to other small entries. However, the total number of nonzero components of $\tilde{\mathbf{x}}$ is large enough to violate any condition for the uniqueness of the sparsest solution. On the other hand, if only the dominant components are considered, then it will satisfy the uniqueness conditions. One intuitively expects that $\tilde{\mathbf{x}}$ should not be far from the true sparse solution ${\mathbf{x}}_0$. We show that this intuition is the case by providing an upper bound on $\Vert \tilde{\mathbf{x}}-{\mathbf{x}}_0\Vert$ which is a function of the magnitudes of small components of $\tilde{\mathbf{x}}$ but independent from ${\mathbf{x}}_0$. This result is extended to the case that $\mathbf{b}$ is perturbed by noise. Additionally, we generalize the upper bounds to the low-rank matrix recovery problem.

Submitted to Elsevier Signal Processing