Cited by 82Advanced Neural Network ApplicationsAdvanced Memory and Neural ComputingDomain Adaptation and Few-Shot Learning

Network Sketching: Exploiting Binary Structure in Deep CNNs

Open access
Guo, Yiwen, Yao, Anbang, Zhao, Hao, Chen, Yurong·2017·2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)

Abstract

Convolutional neural networks (CNNs) with deep architectures have substantially advanced the state-of-the-art in computer vision tasks. However, deep networks are typically resource-intensive and thus difficult to be deployed on mobile devices. Recently, CNNs with binary weights have shown compelling efficiency to the community, whereas the accuracy of such models is usually unsatisfactory in practice. In this paper, we introduce network sketching as a novel technique of pursuing binary-weight CNNs, targeting at more faithful inference and better trade-off for practical applications. Our basic idea is to exploit binary structure directly in pre-trained filter banks and to produce binary-weight models via tensor expansion. The whole process can be treated as a coarse-to-fine model approximation, akin to the pencil drawing steps of outlining and shading. To further speedup the generated models, namely the sketches, we also propose an associative implementation of binary tensor convolutions. Experimental results demonstrate that a proper sketch of AlexNet (or ResNet) outperforms the existing binary-weight models by large margins on the ImageNet large scale classification task, while the committed memory for network parameters only exceeds a little.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/cvpr.2017.430

Cites

35 of 35 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

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?

  • Non-uniform quantization can set quantization points according to the distribution, ensuring the overall quantization error is small.

    “Non-uniform quantization [10] can be used to solve the problem. It can set the quantization points according to the distribution, ensuring the overall quantization error is small.”

    From PTQ4ViT: Post-Training Quantization for Vision Transformers with Twin Uniform Quantization (2022) · cites this paper as [10]

    Section 3.1.1 (page unavailable) says the network-sketching method selects binary bases and scale factors to minimize reconstruction error. It does not say that non-uniform quantization sets quantization points according to a distribution; Section 2 instead describes sketching as distinct from quantization-based methods. (LLM, conf=0.82)

    Experimental — accuracy not yet measured

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

4 of the 39 references couldn’t be matched to a known paper.

Cited by

Sorted by citations

Authors
Guo, Y., Yao, A., Zhao, H., & Chen, Y.
Affiliations
Intel (United States) (US)
Venue
2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)
Publisher
IEEE
Published
2017-07
Pages
4040-4048
ISSN
1063-6919 (ISSN-L)
OpenAlex
W2963576971
Cited by
81
References
39
Citations by year
2026: 1 · 2025: 1 · 2024: 8 · 2023: 3 · 2022: 12 · 2021: 14 · 2020: 14 · 2019: 20 · 2018: 8
FWCI
3.36
Type
conference paper
Language
en
Open access
Locations
  • IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Neural Network Applications
  • Physical Sciences › Engineering › Electrical and Electronic Engineering › Advanced Memory and Neural Computing
  • Physical Sciences › Computer Science › Artificial Intelligence › Domain Adaptation and Few-Shot Learning
Keywords
filter banks, model compression, mobile deployment, AlexNet, ResNet, ImageNet classification, memory efficiency

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