Cited by 15Advanced Neural Network ApplicationsStochastic Gradient Optimization TechniquesMachine Learning and Data Classification

Jumping through Local Minima: Quantization in the Loss Landscape of Vision Transformers

Open access
Frumkin, Natalia, Gope, Dibakar, Marculescu, Diana·2023·2023 IEEE/CVF International Conference on Computer Vision (ICCV)

Abstract

Quantization scale and bit-width are the most important parameters when considering how to quantize a neural network. Prior work focuses on optimizing quantization scales in a global manner through gradient methods (gradient descent & Hessian analysis). Yet, when applying perturbations to quantization scales, we observe a very jagged, highly non-smooth test loss landscape. In fact, small perturbations in quantization scale can greatly affect accuracy, yielding a 0.5 – 0.8% accuracy boost in 4-bit quantized vision transformers (ViTs). In this regime, gradient methods break down, since they cannot reliably reach local minima. In our work, dubbed Evol-Q, we use evolutionary search to effectively traverse the non-smooth landscape. Additionally, we propose using an infoNCE loss, which not only helps combat overfitting on the small calibration dataset (1, 000 images) but also makes traversing such a highly non-smooth surface easier. Evol-Q improves the top-1 accuracy of a fully quantized ViT-Base by 10.30%, 0.78%, and 0.15% for 3-bit, 4-bit, and 8-bit weight quantization levels. Extensive experiments on a variety of CNN and ViT architectures further demonstrate its robustness in extreme quantization scenarios. Our code is available at https: // github.com/enyac-group/evol-q .

Integrity signals

Registry

Crossref · 10.1109/iccv51070.2023.01557

Cites

28 of 28 references verified0 citation errors · 0 not checkable

Statistics

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

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.

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?

  • Evol-Q employs a contrastive loss mechanism to determine optimal quantization scales, utilizing a block-wise evolutionary search strategy.

    “Evol-Q [52] employs a contrastive loss mechanism, drawing inspiration from self-supervised learning paradigms, to determine optimal quantization scales. This method utilizes a block-wise evolutionary search strategy to iteratively identify the best scales for each layer.”

Cites

Flagged first, then by citations

3 of the 31 references couldn’t be matched to a known paper.

Cited by

Sorted by citations

Authors
Frumkin, N., Gope, D., & Marculescu, D.
Affiliations
  • The University of Texas at Austin (US)
  • Arm Inc.
Venue
2023 IEEE/CVF International Conference on Computer Vision (ICCV)
Publisher
IEEE
Published
2023-10-01
Pages
16932-16942
OpenAlex
W4390871684
Cited by
14
References
31
Citations by year
2026: 5 · 2025: 6 · 2024: 3
FWCI
1.50
Type
conference paper
Language
en
Open access
Locations
  • IEEE/CVF International Conference on Computer Vision (ICCV) (publishedVersion)
  • arXiv (Cornell University) (submittedVersion, cc-by-sa)
  • arXiv (Cornell University)
Funders
  • National Science Foundation (2107085)
  • Cockrell School of Engineering, University of Texas at Austin
Topics
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Neural Network Applications
  • Physical Sciences › Computer Science › Artificial Intelligence › Stochastic Gradient Optimization Techniques
  • Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Data Classification
Keywords
neural network quantization, vision transformer, loss landscape, local minima, evolutionary search, InfoNCE loss, nonsmooth optimization, weight quantization, 4-bit quantization, calibration dataset

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