Network Pruning via Feature Shift Minimization

Yuanzhi Duan, Yue Zhou, Peng He, Qiang Liu, Shukai Duan +1 more
7/6/2022
cs.CV

Official code: lscgx/FSM (5 stars, last commit 2022-10-04).

Abstract

Channel pruning is widely used to reduce the complexity of deep network models. Recent pruning methods usually identify which parts of the network to discard by proposing a channel importance criterion. However, recent studies have shown that these criteria do not work well in all conditions. In this paper, we propose a novel Feature Shift Minimization (FSM) method to compress CNN models, which evaluates the feature shift by converging the information of both features and filters. Specifically, we first investigate the compression efficiency with some prevalent methods in different layer-depths and then propose the feature shift concept. Then, we introduce an approximation method to estimate the magnitude of the feature shift, since it is difficult to compute it directly. Besides, we present a distribution-optimization algorithm to compensate for the accuracy loss and improve the network compression efficiency. The proposed method yields state-of-the-art performance on various benchmark networks and datasets, verified by extensive experiments. Our codes are available at: https://github.com/lscgx/FSM.

View on arXivView PDF

Code Implementations(1)

lscgx/FSMOfficial100%

The official code for our ACCV2022 poster paper: Network Pruning via Feature Shift Minimization.

50Shell, PythonMar 17, 20224 years ago
network-pruning

Similar Papers

Cite this paper

@article{duan2022network,
  title  = {Network Pruning via Feature Shift Minimization},
  author = {Yuanzhi Duan and Yue Zhou and Peng He and Qiang Liu and Shukai Duan and Xiaofang Hu},
  year   = {2022},
  eprint = {2207.02632},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2207.02632v2}
}

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/2207.02632.svg)](https://codeofpaper.com/paper/2207.02632)

Discussion