mlsanityData to 7 Oct 2026

Learned ISTA with Error-based Thresholding for Adaptive Sparse Coding

arXiv 2112.10985 ↗First posted 21 Dec 2021cs.LG cs.CVcited by 2

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 5 of its 21 references that are in the map. First posted on arXiv 21 Dec 2021.

Builds on

5 of 21 references.

References · 5

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2018Theoretical Linear Convergence of Unfolded ISTA and its Practical Weights and Thresholdscited by 83
  3. 2016Maximal Sparsity with Deep Networks?cited by 29
  4. 2019Learning step sizes for unfolded sparse codingcited by 29
  5. 2020Ada-LISTA: Learned Solvers Adaptive to Varying Modelscited by 22

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 1; 2023: 0; 2024: 0; 2025: 0; 2026: 1.

2 papers.