SOTAVerified

Sparse Coding with Gated Learned ISTA

2020-05-01ICLR 2020Code Available1· sign in to hype

Kailun Wu, Yiwen Guo, Ziang Li, Chang-Shui Zhang

Code Available — Be the first to reproduce this paper.

Reproduce

Code

Abstract

In this paper, we study the learned iterative shrinkage thresholding algorithm (LISTA) for solving sparse coding problems. Following assumptions made by prior works, we first discover that the code components in its estimations may be lower than expected, i.e., require gains, and to address this problem, a gated mechanism amenable to theoretical analysis is then introduced. Specific design of the gates is inspired by convergence analyses of the mechanism and hence its effectiveness can be formally guaranteed. In addition to the gain gates, we further introduce overshoot gates for compensating insufficient step size in LISTA. Extensive empirical results confirm our theoretical findings and verify the effectiveness of our method.

Reproductions