Cited by 220Advanced Neural Network ApplicationsDomain Adaptation and Few-Shot LearningMachine Learning and Data Classification

CLIP-Q: Deep Network Compression Learning by In-parallel Pruning-Quantization

Tung, Frederick, Mori, Greg·2018·2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition

Abstract

Deep neural networks enable state-of-the-art accuracy on visual recognition tasks such as image classification and object detection. However, modern deep networks contain millions of learned weights; a more efficient utilization of computation resources would assist in a variety of deployment scenarios, from embedded platforms with resource constraints to computing clusters running ensembles of networks. In this paper, we combine network pruning and weight quantization in a single learning framework that performs pruning and quantization jointly, and in parallel with fine-tuning. This allows us to take advantage of the complementary nature of pruning and quantization and to recover from premature pruning errors, which is not possible with current two-stage approaches. Our proposed CLIP-Q method (Compression Learning by In-Parallel Pruning-Quantization) compresses AlexNet by 51-fold, GoogLeNet by 10-fold, and ResNet-50 by 15-fold, while preserving the uncompressed network accuracies on ImageNet.

Integrity signals

Registry

Crossref · 10.1109/cvpr.2018.00821

Cites

9 of 9 references verified0 citation errors · 0 not checkable

Statistics

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

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Mixed-precision quantization can address this by using different bit precision for each layer.

    “It is possible to address this with mixed-precision quantization [51,82,102,162,187,199,211,239,246,249,263,282,286].”

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Tung, F., & Mori, G.
Affiliations
Simon Fraser University (CA)
Venue
2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition
Publisher
IEEE
Published
2018-06
Pages
7873-7882
ISSN
1063-6919 (ISSN-L)
OpenAlex
W2799197246
Cited by
220
References
9
Citations by year
2026: 5 · 2025: 22 · 2024: 27 · 2023: 21 · 2022: 29 · 2021: 48 · 2020: 41 · 2019: 24 · 2018: 3
FWCI
8.74
Type
conference paper
Language
en
Open access
closed
Locations
IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings (publishedVersion)
Funders
Agence Nationale de la Recherche (ANR-15-CE23-0029)
Topics
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Neural Network Applications
  • Physical Sciences › Computer Science › Artificial Intelligence › Domain Adaptation and Few-Shot Learning
  • Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Data Classification
Keywords
neural network compression, network pruning, weight quantization, fine-tuning, AlexNet, GoogLeNet, ResNet50, ImageNet, embedded deployment

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