Data Agnostic Filter Gating for Efficient Deep Networks
- URL: http://arxiv.org/abs/2010.15041v1
- Date: Wed, 28 Oct 2020 15:26:40 GMT
- Title: Data Agnostic Filter Gating for Efficient Deep Networks
- Authors: Xiu Su, Shan You, Tao Huang, Hongyan Xu, Fei Wang, Chen Qian,
Changshui Zhang, Chang Xu
- Abstract summary: Current filter pruning methods mainly leverage feature maps to generate important scores for filters and prune those with smaller scores.
In this paper, we propose a data filter pruning method that uses an auxiliary network named Dagger module to induce pruning.
In addition, to help prune filters with certain FLOPs constraints, we leverage an explicit FLOPs-aware regularization to directly promote pruning filters toward target FLOPs.
- Score: 72.4615632234314
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: To deploy a well-trained CNN model on low-end computation edge devices, it is
usually supposed to compress or prune the model under certain computation
budget (e.g., FLOPs). Current filter pruning methods mainly leverage feature
maps to generate important scores for filters and prune those with smaller
scores, which ignores the variance of input batches to the difference in sparse
structure over filters. In this paper, we propose a data agnostic filter
pruning method that uses an auxiliary network named Dagger module to induce
pruning and takes pretrained weights as input to learn the importance of each
filter. In addition, to help prune filters with certain FLOPs constraints, we
leverage an explicit FLOPs-aware regularization to directly promote pruning
filters toward target FLOPs. Extensive experimental results on CIFAR-10 and
ImageNet datasets indicate our superiority to other state-of-the-art filter
pruning methods. For example, our 50\% FLOPs ResNet-50 can achieve 76.1\% Top-1
accuracy on ImageNet dataset, surpassing many other filter pruning methods.
Related papers
- Filter Pruning for Efficient CNNs via Knowledge-driven Differential
Filter Sampler [103.97487121678276]
Filter pruning simultaneously accelerates the computation and reduces the memory overhead of CNNs.
We propose a novel Knowledge-driven Differential Filter Sampler(KDFS) with Masked Filter Modeling(MFM) framework for filter pruning.
arXiv Detail & Related papers (2023-07-01T02:28:41Z) - Efficient CNNs via Passive Filter Pruning [23.661189257759535]
Convolutional neural networks (CNNs) have shown state-of-the-art performance in various applications.
CNNs are resource-hungry due to their requirement of high computational complexity and memory storage.
Recent efforts toward achieving computational efficiency in CNNs involve filter pruning methods.
arXiv Detail & Related papers (2023-04-05T09:19:19Z) - Pruning Networks with Cross-Layer Ranking & k-Reciprocal Nearest Filters [151.2423480789271]
A novel pruning method, termed CLR-RNF, is proposed for filter-level network pruning.
We conduct image classification on CIFAR-10 and ImageNet to demonstrate the superiority of our CLR-RNF over the state-of-the-arts.
arXiv Detail & Related papers (2022-02-15T04:53:24Z) - Batch Normalization Tells You Which Filter is Important [49.903610684578716]
We propose a simple yet effective filter pruning method by evaluating the importance of each filter based on the BN parameters of pre-trained CNNs.
The experimental results on CIFAR-10 and ImageNet demonstrate that the proposed method can achieve outstanding performance.
arXiv Detail & Related papers (2021-12-02T12:04:59Z) - Training Compact CNNs for Image Classification using Dynamic-coded
Filter Fusion [139.71852076031962]
We present a novel filter pruning method, dubbed dynamic-coded filter fusion (DCFF)
We derive compact CNNs in a computation-economical and regularization-free manner for efficient image classification.
Our DCFF derives a compact VGGNet-16 with only 72.77M FLOPs and 1.06M parameters while reaching top-1 accuracy of 93.47%.
arXiv Detail & Related papers (2021-07-14T18:07:38Z) - Deep Model Compression based on the Training History [13.916984628784768]
We propose a novel History Based Filter Pruning (HBFP) method that utilizes network training history for filter pruning.
The proposed pruning method outperforms the state-of-the-art in terms of FLOPs reduction (floating-point operations) by 97.98%, 83.42%, 78.43%, and 74.95% for LeNet-5, VGG-16, ResNet-56, and ResNet-110 models, respectively.
arXiv Detail & Related papers (2021-01-30T06:04:21Z) - To Filter Prune, or to Layer Prune, That Is The Question [13.450136532402226]
We show the limitation of filter pruning methods in terms of latency reduction.
We present a set of layer pruning methods based on different criteria that achieve higher latency reduction than filter pruning methods on similar accuracy.
LayerPrune also outperforms handcrafted architectures such as Shufflenet, MobileNet, MNASNet and ResNet18 by 7.3%, 4.6%, 2.8% and 0.5% respectively on similar latency budget on ImageNet dataset.
arXiv Detail & Related papers (2020-07-11T02:51:40Z) - Dependency Aware Filter Pruning [74.69495455411987]
Pruning a proportion of unimportant filters is an efficient way to mitigate the inference cost.
Previous work prunes filters according to their weight norms or the corresponding batch-norm scaling factors.
We propose a novel mechanism to dynamically control the sparsity-inducing regularization so as to achieve the desired sparsity.
arXiv Detail & Related papers (2020-05-06T07:41:22Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.