Title: LEARNING CLUSTER STRUCTURED SPARSITY BY REWEIGHTING

Abstract: Recently, the paradigm of unfolding iterative algorithms into finite-length feedforward 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 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.

1. INTRODUCTION:

Sparsity is an important inherent property that describes the low-dimensionality of signals. Learning the sparse representation of signals or data plays an important role in many applications, such as image restoration (Liu et al., 2018; 2019b) , classification (Wright et al., 2009) , radar detection (Ahmad & Amin, 2013) , medical imaging (Lustig et al., 2007) , or black hole image in astronomy (Honma et al., 2016) . As a fundamental, sparse recovery or sparse representation (SR) has been substantially investigated in the last two decades due to the emergence of Compressive Sensing (CS) (Zhang & Rao, 2011; Yu et al., 2012; Needell & Tropp, 2009; Yu et al., 2015; Daubechies et al., 2004) .

Particularly, the objective of SR is to find a concise representation of a signal using a few atoms from some specified (over-complete) dictionary

y = Ax + (1)

with y ∈ R M the observed measurements corrupted by some noises , x ∈ R N the sparse representation with no more than S nonzero entries (S-sparsity) and A ∈ R M ×N the dictionary (normally M N ). Consequently, the ill-posedness of (1) prohibits a direct solution of x by inverting A. In the last two decades, such ill-posed inversion problem has been exhaustively investigated in the community of signal processing (Becker et al., 2011; Daubechies et al., 2004; Needell & Tropp, 2009) . Many iterative algorithms such as ISTA (Daubechies et al., 2004) , FISTA (Beck & Teboulle, 2009; Becker et al., 2011) , ADMM (Chartrand & Wohlberg, 2013) and AMP (Donoho et al., 2009) have been proposed to solve it, which can be considered as unlearnable approaches since all the parameters are fixed instead of being learned from data.

Recently, inspired by the deep learning techniques, SR problem is instead turn to the data-driven approaches. The seminal work LISTA (Gregor & LeCun, 2010; Sprechmann et al., 2013; Zhang & Ghanem, 2018) and its consecutive variations (Zhou et al., 2018; Moreau & Bruna, 2016; Ito et al., 2019; Sun et al., 2016) have largely improved the SR performance by simply unfolding iterations of existing SR algorithms into limited number of neural network layers, and then training the network through back propagation with huge amount of data. Theoretically (Moreau & Bruna, 2016) and empirically (Gregor & LeCun, 2010; Sprechmann et al., 2013; Zhang & Ghanem, 2018) , the resulted algorithms are with improved accuracy and efficiency comparing to their original counterparts (Giryes et al., 2018) .

On the other hand, the structure behind sparsity, imposing constraint on the support of sparse signals, is an important prior knowledge that can be used to enhance the recovery performance (Wang et al., 2014; Prasad et al., 2015; Liu et al., 2018; Yu et al., 2012) . Specifically, structures often exhibit as a sharing of zero/nonzero pattern for grouped entries (dependent on each other) of sparse signals.

And the cluster structured sparsity (CSS) is one of the most important cases, where the zero/nonzero entries appear in clusters. Since many natural sparse signals tend to have clustered sparse structure, this pattern has been widely exploited in many practical applications such as gene expression analysis (Tibshirani et al., 2005) , and inverse synthetic aperture radar imaging (Lv et al., 2014) . However, to the best of the authors' knowledge, few of the data-driven SR algorithms have been proposed for structured SR problems. Thus, there is an urgent need for the study of a learnable approach to utilize the structure behind sparse signals.

In this paper, we try to bridge this gap with special attention on cluster structured sparse recovery. We aim at tackling this problem with neural networks which are explainable and fully trainable. As discussed above, LISTA provides an exemplar approach to bridge the connection between SR and NN in an explainable manner. To further consider the clustered structure, we exploit the reweighted iterative soft-thresholding algorithm (RwISTA) (Fosson, 2018) as the prototype of our proposed network. Essentially, the weights in RwISTA act as a latent variable that controls the sparsity pattern of corresponding coefficients. Based on this observation, in addition to unfolding RwISTA as a feedforward network, we recast the reweighting process into a parameterized reweighting block that can inference the inherent dependencies between coefficients and thus promote structures. To this end, a one-layer fully connected reweighting block (RW-LISTA-fc) that exploits the global dependencies of all elements is first proposed. And empirically, the adjacency matrix of the FC layer after training with CSS signals reveals local dependence of elements for CSS signals. Consequently, a two-layer convolutional reweighting block (RW-LISTA-conv) is then proposed to capture such dependencies, namely the connection of neighboring coefficients. Through exhaustive numerical experiments, the resulted network RW-LISTA is proven on the superiority over existing methods in solving CSS recovery. Our high-level contribution can be concluded as follows:

• We propose a novel supervised approach for cluster structured sparse recovery. Leverag et al. (2008) propose to reweight the 1 norm. Formally, consider the following problem:

min x∈R N ||y -Ax|| 2 2 + λ N i=1 w i |x i | (2)

where w i corresponds to the weight associated to ith entry of x. To reach a more "democratic" penalization among coefficients, Candes et al. (2008) assign the weight w i = 1 |xi|+ with > 0 a small value. And thus, N i=1 w i |x i | can be seen as a smooth approximation of 0 norm. Through reweighting, different entries are penalized differently. Large weights will discourage nonzero entries in the recovered signal while small weights tend to encourage nonzero entries. Consequently, to improve the estimation, the weights should be determined properly according to the true location of nonzero entries.

In the original paper, Candes et al. (2008) adopts an iterative algorithm (IRL1) that alternates between reconstruction x and redefining the weights, which falls into a general form of majorizationminimization algorithm (a generalization of EM algorithm (Dempster et al., 1977) ). Later, Fosson (2018) proposed a simple variant algorithm called Reweighted Iterative Soft-Threshold Algorithm (RwISTA), which can be formulated as:

EQUATION

where

Γ(•, •) is an element-wise soft-thresholding function defined as [Γ(x, θ)] i = max(|x i |-θ i , 0)• sign(x i ) for i = 1, 2, ..., N .

L is often taken as the largest eigenvalue of A T A, | • | applies elementwisely and ϕ(•) is the reweighting function that takes the magnitude of signal as input. Generally, the reweighting function is usually defined element-wisely as:

EQUATION

where g(•) is a concave, non-decreasing function called merit function. Obviously, if we define g(x) = x, then ϕ(x) = 1, (3) will be reduced to normal ISTA. However, a popular choice is g(x) = log(x + ) with > 0 a pre-defined parameter. In this case, the weights are determined inversely proportional to the magnitudes of the corresponding coefficients as

w i = 1 |xi|+ . Consequently, if any coefficient x (k+1) i

becomes larger, the corresponding weight becomes smaller, and in the next iteration a weaker penalty will be applied. Since nonzero entries are more likely to be identified with greater magnitude, iterative reweighting algorithm introduces a positive feedback that prevents the overshrinkage of nonzero entries while suppressing the magnitude of zero coefficients.

2.2. LEARNED ITERATIVE SOFT-THESHOLDING ALGORITHM WITH REWEIGHTING BLOCK:

Although quite successful, there are some reasons that make RwISTA unsuitable for our problem, namely learning to recover cluster structured sparsity (CSS). First and most importantly, the reweighting function is often defined element-wisely, which ignores the structures behind sparsity. In CSS signals, for example, images of MNIST digits, nonzero entries tend to appear in clusters so that the sparsity pattern of the neighboring coefficients are statistically dependent. But such relationship cannot be captured by the element-wise reweighting manner. Besides, RwISTA can be viewed as a recurrent structure with pre-fixed parameters. However, according to recent successful applications of deep learning in sparse representation, learnable parameters that benefit from huge amount of training data will behave significantly better with respect to both convergence speed and recovery accuracy.

𝑥 (2) 𝑥 (1) 𝑦 𝑥 (0) 𝑤 (0) + 𝐵 (0) 𝐶 (0) 𝜑 (0) 𝑤 (1) + 𝐵 (1)

𝐶 ( 1)

𝜑 ( 1) To address the issues mentioned above, we propose RW-LISTA as shown in Figure 1 , which unfolds RwISTA (3) into a finite-length deep neural network. Formally, the forward pass of RW-LISTA can be formulated as:

𝑥 (𝐾) 𝑥 (𝐾-1) 𝑤 (𝐾-1) + 𝐵 (𝐾-1) 𝐶 (𝐾-1) 𝜑 (𝐾-1)

w (k) ← -ϕ (k) x (k) , x (k+1) ← -Γ B (k) x (k) + C (k) y, θ (k) w (k) (5)

where

B (k) ∈ R N ×N , C (k) ∈ R N ×M and ϕ (k) (•)

denotes the paratermized reweighting block in the kth layer. The model's architecture is illustrated at Fig. 1 . In RwISTA we fix

B (k) = I -1 L A T A, C (k) = 1 L A T and θ (k) = λ

L for all layers. However, now all the parameters in RW-LISTA (including the parameters of the reweighting block ϕ (k) ) are optimized by minimizing the reconstruction error || xx * || 2 2 through back-propagation to fix the distribution of the data. Since weights are able to control the sparsity pattern of the coefficients, what we need to do is to determine the weight properly so that they have small values in nonzero locations and significantly greater values elsewhere. It turns out that for structured sparsity, the magnitude of the entry is not the only clue that can be utilized. The dependencies between coefficients should also be carefully considered. Existing works including Yu et al. (2015; 2012) and Fang et al. (2014; 2016) exploit the neighboring dependencies to tackle the problem of CSS recovery, where if the neighbors of one coefficient appears to be nonzero with great magnitude, then the current coefficient is more likely to be nonzero and thus should be reweighted less. It inspires us to build the reweighting block ϕ with respect to the amplitude of coefficients x. And the objective is to output weights with small values if the corresponding coefficients belong to some clustered blocks, while with large values if the corresponding coefficients are isolated or small in magnitude. The details of reweighting block construction will be discussed in the next section. And Figure 2 illustrates an example of the output of the proposed reweighting block ϕ (after training). 

2.3. BUILDING THE REWEIGHTING BLOCK:

In this section, we discuss the construction of reweighting block. Empirically, we use reversed sigmoid function σ(-x) = 1 1+e x as the activation since it's also the derivative of a concave nondecreasing merit function. Traditionally, reweighting is achieved in an element-wise manner: each coefficient will be passed into a derivative of merit function to determine its own weight. This manner introduces a self-dependence between coefficients, and the corresponding reweighting block can be expressed as:

w (k) ← -σ -t (k) x (k) (6)

with t (k) a temperature parameter. Based on previous analysis, the element-wise manner doesn't capture the dependence between elements. Instead, it utilizes the coefficient's self-magnitude as the only clue for reweighting.

To inference the sparsity pattern of CSS signals, we exploit a global dependencies among coefficients of the signal, illustrated at Figure 3 (c ). Namely, we build the reweighting block with a full-connection (FC) layer:

EQUATION

where the adjacency matrix G ∈ R N ×N . Different from (6), the FC layer gives the reweighting block a global visual field. Each coefficient is connected to all other elements of the signal. Since each coefficient will pass its influence to other elements through the FC layer and the extent of influence or dependence is measured by the adjacency matrix of FC layer, the learned G (k) in ( 7) indicates the general sparsity pattern or structure of the signals.

We visualized the matrix G learned on synthesized CSS signals recovery in Fig 4 (c) (refer the details of the experiment in Section 3.1). The learned matrix is notably great in the diagonal areas, which means each coefficient is highly dependent on its neighbors, but less related to coefficients in a long distance. Generally, it reveals the local dependence of coefficients in CSS signals and is illustrated in Figure 3 (b). Consequently, we further introduce convolutional reweighting block to capture such relationship. In this paper we consider a two-layer convolution:

EQUATION

where

v (k) 1 and v (k)

2 denote the convolution kernels with the same size and ReLU denotes the rectified linear unit defined as max(x, 0) (Nair & Hinton, 2010) . Zero-padding is added to keep the size unchanged. Since the operation of convolution is local receptive and shift-invariant, its naturally suitable for clustered structure sparsity. Moreover, different kernel sizes will give different visual field for the reweighting block. For example, when the kernel size equals to 1, it will be reduced to element-wise connection manner. Finally, stacked convolutional layers will expand the receptive field and also include more non-linearity in our architecture. 

(c) Global Dependence (a) Self-Dependence (b) Local Dependence 𝑥 𝑖-2 𝑤 𝑖-2 𝑥 𝑖-1 𝑥 𝑖 𝑥 𝑖+1 𝑥 𝑖+2 𝑤 𝑖-1 𝑤 𝑖 𝑤 𝑖+1 𝑤 𝑖+1 𝑥 𝑖-2 𝑤 𝑖-2 𝑥 𝑖-1 𝑥 𝑖 𝑥 𝑖+1 𝑥 𝑖+2 𝑤 𝑖-1 𝑤 𝑖 𝑤 𝑖+1 𝑤 𝑖+2 𝑥 𝑖-2 𝑤 𝑖-2 𝑥 𝑖-1 𝑥 𝑖 𝑥 𝑖+1 𝑥 𝑖+2 𝑤 𝑖-1 𝑤 𝑖 𝑤 𝑖+1 𝑤 𝑖+2 (a) Self-Dependence (c) Global Dependence (a) Self-Dependence (b) Local Dependence 𝑥 𝑖-2 𝑤 𝑖-2 𝑥 𝑖-1 𝑥 𝑖 𝑥 𝑖+1 𝑥 𝑖+2 𝑤 𝑖-1 𝑤 𝑖 𝑤 𝑖+1 𝑤 𝑖+1 𝑥 𝑖-2 𝑤 𝑖-2 𝑥 𝑖-1 𝑥 𝑖 𝑥 𝑖+1 𝑥 𝑖+2 𝑤 𝑖-1 𝑤 𝑖 𝑤 𝑖+1 𝑤 𝑖+2 𝑥 𝑖-2 𝑤 𝑖-2 𝑥 𝑖-1 𝑥 𝑖 𝑥 𝑖+1 𝑥 𝑖+2 𝑤 𝑖-1 𝑤 𝑖 𝑤 𝑖+1 𝑤 𝑖+2 (b) Local Dependence (c) Global Dependence (a) Self-Dependence (b) Local Dependence 𝑥 𝑖-2 𝑤 𝑖-2 𝑥 𝑖-1 𝑥 𝑖 𝑥 𝑖+1 𝑥 𝑖+2 𝑤 𝑖-1 𝑤 𝑖 𝑤 𝑖+1 𝑤 𝑖+1 𝑥 𝑖-2 𝑤 𝑖-2 𝑥 𝑖-1 𝑥 𝑖 𝑥 𝑖+1 𝑥 𝑖+2 𝑤 𝑖-1 𝑤 𝑖 𝑤 𝑖+1 𝑤 𝑖+2 𝑥 𝑖-2 𝑤 𝑖-2 𝑥 𝑖-1 𝑥 𝑖 𝑥 𝑖+1 𝑥 𝑖+2 𝑤 𝑖-1 𝑤 𝑖 𝑤 𝑖+1 𝑤 𝑖+2 (c) Global Dependence

3. NUMERICAL EXPERIMENTS:

In this section, the results of Monte Carlo simulation experiments on both synthetic and real data are reported for corroborating the above theoretical analysis of the RW-LISTA algorithm. Our experiments contain four parts. The first three parts are based on synthetic data, in which we compare RW-LISTA with both learning-based algorithms and classical CSS solvers to verify the effectiveness of our algorithm. In the final part we consider a real-world application of RW-LISTA: recovery of MNIST digit images.

If not specifically mentioned, the depth of all architecture is set to 12. The sensing matrix A in ( 1) is randomly generated with each entry independently drawn from a zero-mean Gaussian distribution N (0, 1/M ), and each column is normalized to have unit 2 norm. Additive white Gaussian noise (AWGN) is considered and denoted by , and the signal-to-noise ratio (SNR) in the system is defined as

EQUATION

The following average normalized mean square error (NMSE) is defined to evaluate the RW-LISTA and compare with existing cluster structured sparse (CSS) recovery algorithms

EQUATION

)

where || • || F is the Frobenius norm, and x denotes the recovered CSS vector. Our codes are implemented with Python and MATLAB. Models are built on PyTorch (Paszke et al., 2017) and trained In particular, reweighting with 1 × 3 convolution achieves the best performance. Furthermore, the superiority of RW-LISTA can be further enlarged as the SNR level increases. To get a better sense of the pattern learned through the reweighting blocks, the learned weight matrix G in equation ( 7) from one layer of the reweighting blocks is visualized, as shown in Figure 4 (c). The weight is noticeably great in the diagonal area, i.e., each coefficient is highly connected to its neighbors. This indicates that the RW-LISTA has successfully learned the clustered structure sparsity. Since such a learned matrix assembles the operation of convolution, in the following we choose to use 1 × 3 convolution for the RW-LISTA considering computational cost and recovery performance.

3.2. EFFECTIVENESS OF REWEIGHTING BLOCK:

The next experiment will focus on verifying the effectiveness of the proposed reweighting block. To achieve this goal, we integrate the reweighting block into LISTA and its successors, i.e., LISTA-CP (Chen et al., 2018) , TIED-LISTA as well as ALISTA (Liu et al., 2019a) ), and obtain their reweighted versions: RW-ALISTA-CP, RW-TIED-LISTA, and RW-ALISTA. We also include the result of LISTAs with support selection proposed in Chen et al. (2018) It is clearly observed that the proposed RW-LISTAs with reweighting block achieve significant performance improvement compared to LISTA and its variants, especially under relatively high SNR conditions. This implies that the performance of CSS signal recovery has been certainly improved by adaptively reweighting the coefficients in the thresholding operation of ISTA. It is worthwhile noticing that the role of the reweighting block becomes more obvious when the level of SNR increases. (Yu et al., 2012) , MBCSLBP (Yu et al., 2015) , PCSBL (Fang et al., 2014) , and EBSBL (Zhang & Rao, 2013) . Suppose the sparsity of a N × 1 CSS signal is S, i.e., there are S non-zero elements, which consist of T blocks with random sizes and locations. The results are averaged over 500 independents runs.

The effectiveness and robustness of the RW-LISTA are demonstrated in Figure 6 in terms of the following four aspects: i) Sparsity: Note that from Figure 6 (a) the RW-LISTA outperforms the others by a large margin, which verifies the theoretical analysis in section 2. The reason lies in that the reweighting block is embedded to improve recovery accuracy while maintaining acceptable computational complexity. ii) Noise level: The RW-LISTA is noise-robust and can achieve higher recovery accuracy than those using classical CSS solvers especially in low SNR levels, as shown in Figure 6 (b). Note that the efficient learning via the reweighting block is the key to achieve the desired performance. iii) Number of blocks: The number of blocks changes when keeping the sparsity unchanged. It is seen in Figure 6 (c) that the NMSE curve of RW-LISTA slightly fluctuates as the number of blocks increases, and there is a significant performance improvement when compared with existing algorithms. The results in Figure 6 (a) and (c) indicate that the performance degradation mainly results from the change of sparsity rather than the number of blocks. iv) Number of measurements: The effectiveness of the RW-LISTA in coping with different numbers of measurements is likewise demonstrated in Figure 6 (d) . It is noted that the RW-LISTA gives rise to substantial gain in the NMSE performance for the reason outlined above. Moreover, we find that the curve of the RW-LISTA does not monotonously change with the number of measurements.

As a result, the above features of the RW-LISTA strongly relax the constraints on the sparsity, noise level, blocks and measurements of the CSS signals. The reweighting block is therefore regarded as a unit which is well-matched for LISTA architecture. An illustrative example of image signal recovery on MNIST dataset is given in Figure 7 with a SNR of 5 dB, where the NMSE of each recovered image is annotated for quantitative comparison.

3.4. EXPERIMENTS ON MNIST DIGITS RECOVERY:

The state-of-the-art CluSS, EBSBL, MBCSLBP, PCSBL, and LISTA algorithms are taken as the reference for performance comparison with the proposed RW-LISTA. It is observed that the results in Figure 6 are in accordance with those in Figure 7 , i.e., the RW-LISTA substantially outperforms the others in preserving the cluster property for different image patterns (We choose the numeral images with distinct sparsity and number of blocks). We also note that the reconstructed images by RW-LISTA are very close to the original ones, and this phenomenon can be regarded as a consequence of the use of the reweighting block, which is able to well learn the spatial pattern of hand-written numerals. In contrast, most of state-of-the-art algorithms have the difficulty in recovering the images with real-world spatial structures in such noisy cases largely due to unknown sparse and cluster prior of CSS signals, e.g., cluster locations and the number of clusters.

4. CONCLUSION:

In this paper, we explore a reweighted deep architecture for the recovery of CSS signals. In the proposed reweighting block, we introduce local dependence of coefficients by convolutional layers, and global dependence by FC layers. Moreover, we choose RwISTA and LISTA as the incarnation of our idea and get a novel architecture termed RW-LISTA. In light of the above analysis of experimental results, the conclusion is reached that the proposed algorithm successfully utilizes the clustered structure of signals and outperforms existing algorithms on different tasks. Besides it also gives further insights into the recovery of other types of structured sparsity based on the reweighting mechanism, which is pending in the future work.

:



Figures and Tables:

Figure 1: Architecture of our proposed model RW-LISTA.

Figure 2: An example of input signal and output of the proposed reweighting block ϕ (after training).

Figure 3: (a) Self-dependence introduced in the reweighting block, which corresponds to the element-wise manner. (b) Local dependence introduced in the reweighting block, which is achieved by convolution (illustrated by a 1 × 3 convolution). (c) Global dependence introduced in the reweighting block, which is conducted by a fully connected layers.

Figure 4: (a) Visualization of recovered signals by LISTA and RW-LSITA. (b) The results of different reweighting blocks on synthetic CSS signals, where RwISTA and LISTA are considered for comparison. (c) Visualization of the matrix of one learned reweighting FC layer.

for comparison (termed as LISTA-SS, LISTA-CPSS, TIED-LISTA-SS, and ALISTA-SS). As before, we generate synthetic CSS signals with non-zero elements following Gaussian Distribution under N = 200 and M = 100. The results of NMSE comparison between RW-LISTAs and LISTAs in the case of different noisy conditions are presented in Figure 5 (a)-(d), where all the curves are depicted by running 10000 Monte Carlo trials.

Figure 5: Comparisons of reweighted LISTAs with LISTAs at different SNR levels.

Figure 7: Reconstructed 20 × 20 digit images on MNIST dataset using different recovery algorithms with N = 400, M = 200 and SNR = 5 dB (Rows from up to down: original images, recovered images by RW-LISTA, LISTA, CluSS, EBSBL, MBCSLBP, and PCSBL)

COMPARISON OF RW-LISTA TO CLASSICAL CSS SOLVERS Signal recovery techniques for CSS are various and can be roughly classified into two main categories depending on whether the deep learning is involved. In order to demonstrate the advantage of parameter learning based techniques, synthetic CSS data are generated for evaluating the RW-LISTA in comparison with classical CSS recovery algorithms, including CluSS

Table content: <table><tr><td/><td>-10</td><td/><td/><td/><td/><td/><td/><td/><td>-12</td><td/><td/><td/><td/></tr><tr><td/><td/><td/><td/><td/><td/><td/><td/><td/><td>-13</td><td/><td/><td/><td/></tr><tr><td/><td>-12</td><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/></tr><tr><td/><td/><td/><td/><td/><td/><td/><td/><td/><td>-14</td><td/><td/><td/><td/></tr><tr><td/><td>-14</td><td/><td/><td/><td/><td/><td/><td/><td>-15</td><td/><td/><td/><td/></tr><tr><td>NMSE (dB)</td><td>-20 -18 -16</td><td/><td/><td/><td/><td/><td>CluSS MBCSLBP PCSBL EBSBL LISTA RW-LISTA</td><td>NMSE (dB)</td><td>-18 -17 -16 -19 -20</td><td/><td/><td>CluSS MBCSLBP PCSBL EBSBL LISTA RW-LISTA</td><td/></tr><tr><td/><td>-22</td><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/></tr><tr><td/><td/><td/><td/><td/><td/><td/><td/><td/><td>-21</td><td/><td/><td/><td/></tr><tr><td/><td>-24</td><td/><td/><td/><td/><td/><td/><td/><td>-22</td><td/><td/><td/><td/></tr><tr><td/><td>2</td><td>3</td><td>4</td><td>5</td><td>6</td><td>7</td><td>8</td><td>9</td><td>0.4</td><td>0.45</td><td>0.5</td><td>0.55</td><td>0.6</td><td>0.65</td></tr><tr><td/><td/><td/><td/><td colspan="2">block numbers</td><td/><td/><td/><td/><td/><td>M/N</td><td/><td/></tr><tr><td/><td colspan="7">(c) Number of Block.</td><td/><td/><td colspan="4">(d) Measurement.</td></tr><tr><td colspan="13">Figure 6: Comparisons of RW-LISTA with state-of-the-art CSS solvers.</td><td/></tr><tr><td>3.3</td><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/></tr></table>

Peer review (iclr2020):
An approach is proposed to learn sparse representations while preserving some structures in the data. The idea seems quite nice where we want to learn the structure that induces sparsity instead of simply sparse representations. The idea is to extend a recent algorithm RwISTA by adding reweighting block. The reweighing block changes weights to encode whether coefficients in the model learned by the network are similar or dissimilar to each other. To build the reweighing block convolutional layers are used. The paper is slightly hard to read due to many typos, and hard-to-read sentences. Also, I think a more intuitive explanation of how the reweighting helps preserve structure is needed. Right now it is very difficult to understand (except maybe for experts working on similar problems?) Regarding the experiments, most of them are run with synthetic cases. It seems like the approach is compared with several recent approaches though showing good results. On the MNIST data, results are shown where the images are recovered from the sparse representation. I did not really see any substantial improvements in performance as compared to say LISTA. Maybe I am misunderstanding what is being evaluated in Figure 7. Also I am not sure how it shows that the sparse representation is learning the underlying structure? Maybe some re-writing is needed to make this clearer. I think the paper is interesting but needs some polishing to make it easier to read and perhaps some improved experiments in real datasets.