Learning Cluster Structured Sparsity by Reweighting

Abstract

Recently, the paradigm of unfolding iterative algorithms into finite-length feed-forward neural networks has achieved a great success in the area of sparse recovery. Benefit from available training data, the learned networks have achieved state-of-the-art performance in respect of both speed and accuracy. However, the structure behind sparsity, imposing constraint on the support of sparse signals, is often an essential prior knowledge but seldom considered in the existing networks. In this paper, we aim at bridging this gap. Specifically, exploiting the iterative reweighted ${\ell }_1$ minimization (IRL1) algorithm, we propose to learn the cluster structured sparsity (CSS) by rewegihting adaptively. In particular, we first unfold the Reweighted Iterative Shrinkage Algorithm (RwISTA) into an end-to-end trainable deep architecture termed as RW-LISTA. Then instead of the element-wise reweighting, the global and local reweighting manner are proposed for the cluster structured sparse learning. Numerical experiments further show the superiority of our algorithm against both classical algorithms and learning-based networks on different tasks.

References in corpus (7)

• Adam: A Method for Stochastic Optimization
• Message Passing Algorithms for Compressed Sensing
• Sparse Signal Recovery with Temporally Correlated Source Vectors Using Sparse Bayesian Learning
• Extension of SBL Algorithms for the Recovery of Block Sparse Signals with Intra-Block Correlation
• Trainable ISTA for Sparse Signal Recovery
• Theoretical Linear Convergence of Unfolded ISTA and its Practical Weights and Thresholds
• Two-Dimensional Pattern-Coupled Sparse Bayesian Learning via Generalized Approximate Message Passing