paper-with-me

Papers

Recursions Are All You Need: Towards Efficient Deep Unfolding Networks

2023-05-09 · Rawwad Alhejaili, Motaz Alfarraj, Hamzah Luqman, Ali Al-Shaikhi

The use of deep unfolding networks in compressive sensing (CS) has seen wide success as they provide both simplicity and interpretability. However, since most deep unfolding networks are iterative, this incurs significant redundancies in the network. In this work, we propose a novel recursion-based framework to enhance the efficiency of deep unfolding models. First, recursions are used to effectively eliminate the redundancies in deep unfolding networks. Secondly, we randomize the number of recursions during training to decrease the overall training time. Finally, to effectively utilize the power of recursions, we introduce a learnable unit to modulate the features of the model based on both the total number of iterations and the current iteration index. To evaluate the proposed framework, we apply it to both ISTA-Net+ and COAST. Extensive testing shows that our proposed framework allows the network to cut down as much as 75% of its learnable parameters while mostly maintaining its performance, and at the same time, it cuts around 21% and 42% from the training time for ISTA-Net+ and COAST respectively. Moreover, when presented with a limited training dataset, the recursive models match or even outperform their respective non-recursive baseline. Codes and pretrained models are available at https://github.com/Rawwad-Alhejaili/Recursions-Are-All-You-Need .

📄 PDF Abstract BibTeX arXiv:2305.05505

Code (1)

rawwad-alhejaili/recursions-are-all-you-need 공식 구현 pytorch

Tasks

AllCompressive Sensing

Similar Papers 제목 키워드 기반

Kalman Recursions Aggregated Online

2020-02-26 · Eric Adjakossa, Yannig Goude, Olivier Wintenberger

In this article, we aim at improving the prediction of expert aggregation by using the underlying properties of the models that provide expert predictions. We restrict ourselves to the case where expert predictions come …

State Space Models

Vector Transport Free Riemannian LBFGS for Optimization on Symmetric Positive Definite Matrix Manifolds

2021-08-25 · Reza Godaz, Benyamin Ghojogh, Reshad Hosseini, Reza Monsefi 외

This work concentrates on optimization on Riemannian manifolds. The Limited-memory Broyden-Fletcher-Goldfarb-Shanno (LBFGS) algorithm is a commonly used quasi-Newton method for numerical optimization in Euclidean spaces.…

Riemannian optimizationStochastic Optimization

SlowFast-SCI: Slow-Fast Deep Unfolding Learning for Spectral Compressive Imaging

2025-09-20 · Haijin Zeng, Xuan Lu, Yurong Zhang, Qiangqiang Shen 외 arxiv

Humans learn in two complementary ways: a slow, cumulative process that builds broad, general knowledge, and a fast, on-the-fly process that captures specific experiences. Existing deep-unfolding methods for spectral com…

Spectral ReconstructionTest-time AdaptationGeneral Knowledge

Robust Data-Driven Dynamic Programming

2013-12-01 · NeurIPS 2013 12 · Grani Adiwena Hanasusanto, Daniel Kuhn

In stochastic optimal control the distribution of the exogenous noise is typically unknown and must be inferred from limited data before dynamic programming (DP)-based solution schemes can be applied. If the conditional …

Gradient Flow Algorithms for Density Propagation in Stochastic Systems

2019-08-01 · Kenneth F. Caluya, Abhishek Halder

We develop a new computational framework to solve the partial differential equations (PDEs) governing the flow of the joint probability density functions (PDFs) in continuous-time stochastic nonlinear systems. The need f…