Cited by 2,647Advanced Neural Network ApplicationsMachine Learning and Data ClassificationDomain Adaptation and Few-Shot Learning

The DOI matches its Crossref record; 57 of the 59 references it cites were found in a registry or an index.

Channel Pruning for Accelerating Very Deep Neural Networks

Open access
He, Yihui, Zhang, Xiangyu, Sun, Jian·2017·2017 IEEE International Conference on Computer Vision (ICCV)

Abstract

In this paper, we introduce a new channel pruning method to accelerate very deep convolutional neural networks. Given a trained CNN model, we propose an iterative two-step algorithm to effectively prune each layer, by a LASSO regression based channel selection and least square reconstruction. We further generalize this algorithm to multi-layer and multi-branch cases. Our method reduces the accumulated error and enhance the compatibility with various architectures. Our pruned VGG-16 achieves the state-of-the-art results by 5× speed-up along with only 0.3% increase of error. More importantly, our method is able to accelerate modern networks like ResNet, Xception and suffers only 1.4%, 1.0% accuracy loss under 2× speedup respectively, which is significant.

Overview

Integrity signals

Registry

Crossref · 10.1109/iccv.2017.155

Cites

57 of 57 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Citations

Cites

Flagged first, then by citations

Show all 59 references

2 of the 59 references couldn’t be matched to a known paper.

Research works printed but not linked: 3

  1. everingham, 0, The PASCAL Visual Object Classes Challenge 2007 (VOC2007) Results
  2. han, 2015, Deep compression Compressing deep neural network with pruning trained quantization and huffman coding, abs 1510 149
  3. han, 2015, Learning both weights and connections for efficient neural network, Advances in neural information processing systems, 1135

Cited by

Sorted by citations

See all 2,647

Metadata

Authors
He, Y., Zhang, X., & Sun, J.
Affiliations
  • Xi'an Jiaotong University (CN)
  • Megvii (China) (CN)
Venue
2017 IEEE International Conference on Computer Vision (ICCV)
Publisher
IEEE
Published
2017-10
Pages
1398-1406
OpenAlex
W2963363373
Cited by
2,647
References
59
Citations by year
2026: 119 · 2025: 182 · 2024: 287 · 2023: 357 · 2022: 402 · 2021: 474 · 2020: 423 · 2019: 279 · 2018: 116 · 2017: 6
FWCI
65.90
Type
conference paper
Language
en
Open access
Locations
  • IEEE/CVF International Conference on Computer Vision (ICCV) (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Neural Network Applications
  • Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Data Classification
  • Physical Sciences › Computer Science › Artificial Intelligence › Domain Adaptation and Few-Shot Learning
Keywords
channel pruning, convolutional neural networks, model compression, LASSO, least-squares reconstruction, multi-branch network, VGG16, ResNet, Xception, inference acceleration

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review