TL;DR
This paper introduces Hybrid ISTA, a novel framework that combines pre-computed and learned parameters in unfolded ISTA algorithms using free-form DNNs, ensuring convergence and improving performance in inverse problems.
Contribution
It presents the first convergence-guaranteed framework for integrating arbitrary DNN architectures into ISTA-based algorithms for linear inverse problems.
Findings
Hybrid ISTA reduces reconstruction error in sparse recovery.
The framework guarantees linear convergence with free-form DNNs.
Experimental results show improved convergence rate and accuracy.
Abstract
It is promising to solve linear inverse problems by unfolding iterative algorithms (e.g., iterative shrinkage thresholding algorithm (ISTA)) as deep neural networks (DNNs) with learnable parameters. However, existing ISTA-based unfolded algorithms restrict the network architectures for iterative updates with the partial weight coupling structure to guarantee convergence. In this paper, we propose hybrid ISTA to unfold ISTA with both pre-computed and learned parameters by incorporating free-form DNNs (i.e., DNNs with arbitrary feasible and reasonable network architectures), while ensuring theoretical convergence. We first develop HCISTA to improve the efficiency and flexibility of classical ISTA (with pre-computed parameters) without compromising the convergence rate in theory. Furthermore, the DNN-based hybrid algorithm is generalized to popular variants of learned ISTA, dubbed HLISTA,…
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.
