Group Sparse Recovery via the Penalty: Theory and Algorithm
arXiv:1601.04174 · doi:10.1109/TSP.2016.2630028
Abstract
In this work we propose and analyze a novel approach for group sparse recovery. It is based on regularized least squares with an penalty, which penalizes the number of nonzero groups. One distinct feature of the approach is that it has the built-in decorrelation mechanism within each group, and thus can handle challenging strong inner-group correlation. We provide a complete analysis of the regularized model, e.g., existence of a global minimizer, invariance property, support recovery, and properties of block coordinatewise minimizers. Further, the regularized problem admits an efficient primal dual active set algorithm with a provable finite-step global convergence. At each iteration, it involves solving a least-squares problem on the active set only, and exhibits a fast local convergence, which makes the method extremely efficient for recovering group sparse signals. Extensive numerical experiments are presented to illustrate salient features of the model and the efficiency and accuracy of the algorithm. A comparative study indicates its competitiveness with existing approaches.
arXiv comment15 pp, to appear at IEEE Transactions on Signal Processing
References in corpus (15)
- Compressed Sensing of Block-Sparse Signals: Uncertainty Relations and Efficient Recovery
- Model-Based Compressive Sensing
- From Theory to Practice: Sub-Nyquist Sampling of Sparse Wideband Analog Signals
- A Selective Review of Group Selection in High-Dimensional Models
- Group descent algorithms for nonconvex penalized linear and logistic regression models with grouped predictors
- Smoothing proximal gradient method for general structured sparse regression
- Certifying the restricted isometry property is hard
- Block-Sparse Recovery via Convex Optimization
- Correlated variables in regression: clustering and sparse estimation
- Some sharp performance bounds for least squares regression with regularization
- Near-Oracle Performance of Greedy Block-Sparse Estimation Techniques from Noisy Measurements
- The Linearized Inverse Problem in Multifrequency Electrical Impedance Tomography
- A Primal Dual Active Set Algorithm with Continuation for Compressed Sensing
- Conditioning of Random Block Subdictionaries with Applications to Block-Sparse Recovery and Regression
- Error Bounds for Compressed Sensing Algorithms With Group Sparsity: A Unified Approach