The reviewed record of science sign in
Pith

arxiv: 2207.02632 · v2 · pith:UC66P6EE · submitted 2022-07-06 · cs.CV

Network Pruning via Feature Shift Minimization

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:UC66P6EErecord.jsonopen to challenge →

classification cs.CV
keywords featureshiftnetworkmethodpruningchannelcompressionefficiency
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.