TL;DR
This paper introduces Learned Greedy Method (LGM), a neural network architecture based on unfolding the Orthogonal Matching Pursuit algorithm, enhancing interpretability and flexibility for sparse coding tasks.
Contribution
It presents the first unfolded and learned version of OMP, enabling dynamic layers and adaptive stopping, advancing neural network interpretability in sparse coding.
Findings
LGM achieves competitive sparse coding performance.
The architecture adapts to varying input complexities.
LGM demonstrates improved interpretability over black-box models.
Abstract
The fields of signal and image processing have been deeply influenced by the introduction of deep neural networks. These are successfully deployed in a wide range of real-world applications, obtaining state of the art results and surpassing well-known and well-established classical methods. Despite their impressive success, the architectures used in many of these neural networks come with no clear justification. As such, these are usually treated as "black box" machines that lack any kind of interpretability. A constructive remedy to this drawback is a systematic design of such networks by unfolding well-understood iterative algorithms. A popular representative of this approach is the Iterative Shrinkage-Thresholding Algorithm (ISTA) and its learned version -- LISTA, aiming for the sparse representations of the processed signals. In this paper we revisit this sparse coding task and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
