Efficient Model-Based Deep Learning via Network Pruning and Fine-Tuning

Chicago Y. Park, Weijie Gan, Zihao Zou, Yuyang Hu, Zhixin Sun +1 more
11/3/2023
eess.IVcs.CV

Official code: wustl-cig/MBDL_Pruning (0 stars, last commit 2025-03-03).

Abstract

Model-based deep learning (MBDL) is a powerful methodology for designing deep models to solve imaging inverse problems. MBDL networks can be seen as iterative algorithms that estimate the desired image using a physical measurement model and a learned image prior specified using a convolutional neural net (CNNs). The iterative nature of MBDL networks increases the test-time computational complexity, which limits their applicability in certain large-scale applications. Here we make two contributions to address this issue: First, we show how structured pruning can be adopted to reduce the number of parameters in MBDL networks. Second, we present three methods to fine-tune the pruned MBDL networks to mitigate potential performance loss. Each fine-tuning strategy has a unique benefit that depends on the presence of a pre-trained model and a high-quality ground truth. We show that our pruning and fine-tuning approach can accelerate image reconstruction using popular deep equilibrium learning (DEQ) and deep unfolding (DU) methods by 50% and 32%, respectively, with nearly no performance loss. This work thus offers a step forward for solving inverse problems by showing the potential of pruning to improve the scalability of MBDL. Code is available at https://github.com/wustl-cig/MBDL_Pruning .

View on arXivView PDF

Code Implementations(1)

00Shell, PythonFeb 18, 20251 years ago

Similar Papers

Cite this paper

@article{park2023efficient,
  title  = {Efficient Model-Based Deep Learning via Network Pruning and Fine-Tuning},
  author = {Chicago Y. Park and Weijie Gan and Zihao Zou and Yuyang Hu and Zhixin Sun and Ulugbek S. Kamilov},
  year   = {2023},
  eprint = {2311.02003},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2311.02003v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2311.02003.svg)](https://codeofpaper.com/paper/2311.02003)

Discussion