Papers › Learning Efficient Convolutional Networks through Network Slimming

Learning Efficient Convolutional Networks through Network Slimming

22 Aug 2017ICCV 2017 10arXiv:1708.06519archive 2025-07-28

Zhuang Liu, Jianguo Li, Zhiqiang Shen, Gao Huang, Shoumeng Yan, Chang-Shui Zhang

The deployment of deep convolutional neural networks (CNNs) in many real world applications is largely hindered by their high computational cost. In this paper, we propose a novel learning scheme for CNNs to simultaneously 1) reduce the model size; 2) decrease the run-time memory footprint; and 3) lower the number of computing operations, without compromising accuracy. This is achieved by enforcing channel-level sparsity in the network in a simple but effective way. Different from many existing approaches, the proposed method directly applies to modern CNN architectures, introduces minimum overhead to the training process, and requires no special software/hardware accelerators for the resulting models. We call our approach network slimming, which takes wide and large networks as input models, but during training insignificant channels are automatically identified and pruned afterwards, yielding thin and compact models with comparable accuracy. We empirically demonstrate the effectiveness of our approach with several state-of-the-art CNN models, including VGGNet, ResNet and DenseNet, on various image classification datasets. For VGGNet, a multi-pass version of network slimming gives a 20x reduction in model size and a 5x reduction in computing operations.

PaperPDFConference PDFCode

In Syntology View this paper on Syntology, its page in Syntology's graph. That page lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

liuzhuang13/slimming officialmentioned in paperpytorchMITSyntology: not harvested report
Eric-mingjie/network-slimming officialpytorchSyntology: not harvested report
DDGRCF/yolov5_Chinese mentioned on GitHubpytorchSyntology: not harvested report
DDGRCF/yolov5_pruning mentioned on GitHubpytorchSyntology: not harvested report
EstherBear/implementation-of-network-slimming mentioned on GitHubSyntology: not harvested report
VainF/Torch-Pruning mentioned on GitHubpytorchMITSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to DepGraph: Towards Any Structural Pruning (arXiv:2301.12900; that paper's own run record: 7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 1 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified); nothing checks that they implement this paper's method. report
ZJCV/NetworkSlimming mentioned on GitHubpytorchSyntology: not harvested report
chumingqian/Model_Compression_For_YOLOV3-V4 mentioned on GitHubpytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Distilling the Knowledge in a Neural Network (arXiv:1503.02531; that paper's own run record: 23 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 6 honoured, 0 violated, 8 with no contract checked; 9 where Syntology's instrument failed) · 14 unverified); nothing checks that they implement this paper's method. report
midasklr/yolov5prune mentioned on GitHubpytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Pruning Filters for Efficient ConvNets (arXiv:1608.08710; that paper's own run record: 23 ran (of which 4 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 1 violated, 7 with no contract checked; 14 where Syntology's instrument failed) · 13 unverified); nothing checks that they implement this paper's method. report
mvpzhangqiu/yolov5prune mentioned on GitHubpytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Pruning Filters for Efficient ConvNets (arXiv:1608.08710; that paper's own run record: 23 ran (of which 4 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 1 violated, 7 with no contract checked; 14 where Syntology's instrument failed) · 13 unverified); nothing checks that they implement this paper's method. report
polarizationpruning/PolarizationPruning mentioned on GitHubpytorchSyntology: not harvested report
alibaba/esim-response-selection tfApache-2.0Syntology: not harvested report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

A paper named beside a repository with no sample linked to this paper is shown with that paper's own run record, not this paper's: “ran” means executed on a synthesized input, not that the code is correct, and “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Papers are listed in arXiv-id order, at most three per repository.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

Image ClassificationNeural Architecture Searchimage-classification

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

1x1 ConvolutionAverage PoolingBatch NormalizationBottleneck Residual BlockConcatenated Skip ConnectionConvolutionDense BlockDense ConnectionsDropoutGlobal Average PoolingKaiming InitializationMax PoolingReLUResidual BlockResidual ConnectionSoftmax

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections