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

12/29/2015
by   M. Eren Ahsen, et al.
0

In compressed sensing, in order to recover a sparse or nearly sparse vector from possibly noisy measurements, the most popular approach is ℓ_1-norm minimization. Upper bounds for the ℓ_2- norm of the error between the true and estimated vectors are given in [1] and reviewed in [2], while bounds for the ℓ_1-norm are given in [3]. When the unknown vector is not conventionally sparse but is "group sparse" instead, a variety of alternatives to the ℓ_1-norm have been proposed in the literature, including the group LASSO, sparse group LASSO, and group LASSO with tree structured overlapping groups. However, no error bounds are available for any of these modified objective functions. In the present paper, a unified approach is presented for deriving upper bounds on the error between the true vector and its approximation, based on the notion of decomposable and γ-decomposable norms. The bounds presented cover all of the norms mentioned above, and also provide a guideline for choosing norms in future to accommodate alternate forms of sparsity.

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
01/26/2014

Near-Ideal Behavior of Compressed Sensing Algorithms

In a recent paper, it is shown that the LASSO algorithm exhibits "near-i...
research
02/21/2022

A wonderful triangle in compressed sensing

In order to determine the sparse approximation function which has a dire...
research
12/21/2019

An error bound for Lasso and Group Lasso in high dimensions

We leverage recent advances in high-dimensional statistics to derive new...
research
10/30/2014

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

In this paper we introduce a new optimization formulation for sparse reg...
research
10/22/2017

An Approach to One-Bit Compressed Sensing Based on Probably Approximately Correct Learning Theory

In this paper, the problem of one-bit compressed sensing (OBCS) is formu...
research
04/06/2012

Fast projections onto mixed-norm balls with applications

Joint sparsity offers powerful structural cues for feature selection, es...

Please sign up or login with your details

Forgot password? Click here to reset