Signal Recovery under Cumulative Coherence

06/28/2018
by   Peng Li, et al.
0

This paper considers signal recovery in the framework of cumulative coherence. First, we show that the Lasso estimator and the Dantzig selector exhibit similar behavior under the cumulative coherence. Then we estimate the approximation equivalence between the Lasso and the Dantzig selector by calculating prediction loss difference under the condition of cumulative coherence. And we also prove that the cumulative coherence implies the restricted eigenvalue condition. Last, we illustrate the advantages of cumulative coherence condition for three class matrices, in terms of the recovery performance of sparse signals via extensive numerical experiments.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/05/2009

On the conditions used to prove oracle results for the Lasso

Oracle inequalities and variable selection properties for the Lasso in l...
research
10/17/2012

Mixture model for designs in high dimensional regression and the LASSO

The LASSO is a recent technique for variable selection in the regression...
research
06/19/2015

Enhanced Lasso Recovery on Graph

This work aims at recovering signals that are sparse on graphs. Compress...
research
08/29/2017

Improved Support Recovery Guarantees for the Group Lasso With Applications to Structural Health Monitoring

This paper considers the problem of estimating an unknown high dimension...
research
04/25/2019

Sensing Matrix Design and Sparse Recovery on the Sphere and the Rotation Group

In this paper, the goal is to design random or regular samples on the sp...
research
04/04/2011

Block-Sparse Recovery via Convex Optimization

Given a dictionary that consists of multiple blocks and a signal that li...
research
03/11/2021

Improved Coherence Index-Based Bound in Compressive Sensing

Within the Compressive Sensing (CS) paradigm, sparse signals can be reco...

Please sign up or login with your details

Forgot password? Click here to reset