Learned Interpretable Residual Extragradient ISTA for Sparse Coding

Abstract

Recently, the study on learned iterative shrinkage thresholding algorithm (LISTA) has attracted increasing attentions. A large number of experiments as well as some theories have proved the high efficiency of LISTA for solving sparse coding problems. However, existing LISTA methods are all serial connection. To address this issue, we propose a novel extragradient based LISTA (ELISTA), which has a residual structure and theoretical guarantees. In particular, our algorithm can also provide the interpretability for Res-Net to a certain extent. From a theoretical perspective, we prove that our method attains linear convergence. In practice, extensive empirical results verify the advantages of our method.

Accepted for presentation at the ICML Workshop on Theoretic Foundation, Criticism, and Application Trend of Explainable AI

References in corpus (6)

• Learning Phrase Representations using RNN Encoder-Decoder for Statistical Machine Translation
• Gated Feedback Recurrent Neural Networks
• Deep Unfolding: Model-Based Inspiration of Novel Deep Architectures
• One Network to Solve Them All --- Solving Linear Inverse Problems using Deep Projection Models
• Differentiable Linearized ADMM
• From Bayesian Sparsity to Gated Recurrent Nets