Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published January 23, 2015 | Submitted
Report Open

Simple Bounds for Noisy Linear Inverse Problems with Exact Side Information

Abstract

This paper considers the linear inverse problem where we wish to estimate a structured signal x_0 from its corrupted observations. When the problem is ill-posed, it is natural to associate a convex function f(·) with the structure of the signal. For example, ℓ_1 norm can be used for sparse signals. To carry out the estimation, we consider two well-known convex programs: 1) Second order cone program (SOCP), and, 2) Lasso. Assuming Gaussian measurements, we show that, if precise information about the value f(x_0) or the ℓ_2-norm of the noise is available, one can do a particularly good job at estimation. In particular, the reconstruction error becomes proportional to the "sparsity" of the signal rather than to the ambient dimension of the noise vector. We connect our results to the existing literature and provide a discussion on their relation to the standard least-squares problem. Our error bounds are non-asymptotic and sharp, they apply to arbitrary convex functions and do not assume any distribution on the noise.

Additional Information

This work was supported in part by the National Science Foundation under grants CCF-0729203, CNS-0932428 and CIF-1018927, by the Office of Naval Research under the MURI grant N00014-08-1-0747, and by a grant from Qualcomm Inc.

Attached Files

Submitted - Simple_Bounds_for_Noisy_Linear_Inverse_Problems_with_Exact_Side_Information.pdf

Files

Simple_Bounds_for_Noisy_Linear_Inverse_Problems_with_Exact_Side_Information.pdf

Additional details

Created:
August 19, 2023
Modified:
March 5, 2024