Two New Approaches to Compressed Sensing Exhibiting Both Robust Sparse Recovery and the Grouping Effect

10/30/2014
by   Mehmet Eren Ahsen, et al.
0

In this paper we introduce a new optimization formulation for sparse regression and compressed sensing, called CLOT (Combined L-One and Two), wherein the regularizer is a convex combination of the ℓ_1- and ℓ_2-norms. This formulation differs from the Elastic Net (EN) formulation, in which the regularizer is a convex combination of the ℓ_1- and ℓ_2-norm squared. It is shown that, in the context of compressed sensing, the EN formulation does not achieve robust recovery of sparse vectors, whereas the new CLOT formulation achieves robust recovery. Also, like EN but unlike LASSO, the CLOT formulation achieves the grouping effect, wherein coefficients of highly correlated columns of the measurement (or design) matrix are assigned roughly comparable values. It is already known LASSO does not have the grouping effect. Therefore the CLOT formulation combines the best features of both LASSO (robust sparse recovery) and EN (grouping effect). The CLOT formulation is a special case of another one called SGL (Sparse Group LASSO) which was introduced into the literature previously, but without any analysis of either the grouping effect or robust sparse recovery. It is shown here that SGL achieves robust sparse recovery, and also achieves a version of the grouping effect in that coefficients of highly correlated columns belonging to the same group of the measurement (or design) matrix are assigned roughly comparable values.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/19/2016

Tight Performance Bounds for Compressed Sensing With Group Sparsity

Compressed sensing refers to the recovery of a high-dimensional but spar...
research
06/19/2015

Enhanced Lasso Recovery on Graph

This work aims at recovering signals that are sparse on graphs. Compress...
research
09/14/2013

Optimized projections for compressed sensing via rank-constrained nearest correlation matrix

Optimizing the acquisition matrix is useful for compressed sensing of si...
research
12/29/2015

Error Bounds for Compressed Sensing Algorithms With Group Sparsity: A Unified Approach

In compressed sensing, in order to recover a sparse or nearly sparse vec...
research
12/27/2019

Derandomized compressed sensing with nonuniform guarantees for ℓ_1 recovery

We extend the techniques of Hügel, Rauhut and Strohmer (Found. Comput. M...
research
02/07/2020

Jointly Sparse Signal Recovery via Deep Auto-Encoder and Parallel Coordinate Descent Unrolling

In this paper, utilizing techniques in compressed sensing, parallel opti...
research
10/29/2018

Parameter instability regimes for sparse proximal denoising programs

Compressed sensing theory explains why Lasso programs recover structured...

Please sign up or login with your details

Forgot password? Click here to reset