LGCVDec 21, 2021

Learned ISTA with Error-based Thresholding for Adaptive Sparse Coding

arXiv:2112.10985v22 citations
Originality Incremental advance
AI Analysis

This work addresses a domain-specific issue in sparse coding for signal processing, representing an incremental improvement over existing LISTA methods.

The paper tackles the problem of improving adaptivity and convergence speed in learned ISTA for sparse coding by proposing an error-based thresholding mechanism, which results in faster convergence and higher adaptivity as confirmed by extensive experiments.

Drawing on theoretical insights, we advocate an error-based thresholding (EBT) mechanism for learned ISTA (LISTA), which utilizes a function of the layer-wise reconstruction error to suggest a specific threshold for each observation in the shrinkage function of each layer. We show that the proposed EBT mechanism well disentangles the learnable parameters in the shrinkage functions from the reconstruction errors, endowing the obtained models with improved adaptivity to possible data variations. With rigorous analyses, we further show that the proposed EBT also leads to a faster convergence on the basis of LISTA or its variants, in addition to its higher adaptivity. Extensive experimental results confirm our theoretical analyses and verify the effectiveness of our methods.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes