Recoverability of Group Sparse Signals from Corrupted Measurements via Robust Group Lasso

نویسندگان

  • Xiaohan Wei
  • Qing Ling
  • Zhu Han
چکیده

This paper considers the problem of recovering a group sparse signal matrix Y = [y1, · · · ,yL] from sparsely corrupted measurements M = [A(1)y1, · · · ,A(L)yL] + S, where A(i)’s are known sensing matrices and S is an unknown sparse error matrix. A robust group lasso (RGL) model is proposed to recover Y and S through simultaneously minimizing the l2,1-norm of Y and the l1-norm of S under the measurement constraints. We prove that Y and S can be exactly recovered from the RGL model with a high probability for a very general class of A(i)’s.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sparse Recovery with Coherent Tight Frame via Analysis Dantzig Selector and Analysis LASSO

This article considers recovery of signals that are sparse or approximately sparse in terms of a (possibly) highly overcomplete and coherent tight frame from undersampled data corrupted with additive noise. We show that the properly constrained l1-analysis optimization problem, called analysis Dantzig selector, stably recovers a signal which is nearly sparse in terms of a tight frame provided t...

متن کامل

Exact recoverability from dense corrupted observations via L1 minimization

This paper confirms a surprising phenomenon first observed by Wright et al. [1] [2] under different setting: given m highly corrupted measurements y = AΩ•x + e, where AΩ• is a submatrix whose rows are selected uniformly at random from rows of an orthogonal matrix A and e is an unknown sparse error vector whose nonzero entries may be unbounded, we show that with high probability `1-minimization ...

متن کامل

The Benefit of Group Sparsity

This paper develops a theory for group Lasso using a concept called strong group sparsity. Our result shows that group Lasso is superior to standard Lasso for strongly group-sparse signals. This provides a convincing theoretical justification for using group sparse regularization when the underlying group structure is consistent with the data. Moreover, the theory predicts some limitations of t...

متن کامل

The Bene t of Group Sparsity

This paper develops a theory for group Lasso using a concept called strong group sparsity. Our result shows that group Lasso is superior to standard Lasso for strongly group-sparse signals. This provides a convincing theoretical justi cation for using group sparse regularization when the underlying group structure is consistent with the data. Moreover, the theory predicts some limitations of th...

متن کامل

A totally unimodular view of structured sparsity

In this section, we compare the performance of minimizing the TU relaxation g∗∗ G,G of the proposed Sparse G-group cover (c.f., Section 5.4) in problem (2), which we will call Sparse latent group lasso (SLGL), with Basis pursuit (BP) and Sparse group Lasso (SGL). Recall the SGL criteria is (1 − α) ∑ G∈G √ |G|‖xG‖q + α‖xG‖1, with q = 2 in [3]. We compare also against SGL∞ where we set q = ∞, whi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1509.08490  شماره 

صفحات  -

تاریخ انتشار 2015