Pith. sign in

REVIEW 3 cited by

MQBench: Towards Reproducible and Deployable Model Quantization Benchmark

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2111.03759 v2 pith:NOWQXIW7 submitted 2021-11-05 cs.LG cs.CV

classification cs.LGcs.CV
keywords quantizationalgorithmsmodelmqbenchbenchmarkexistingtrainingwork
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Model quantization has emerged as an indispensable technique to accelerate deep learning inference. While researchers continue to push the frontier of quantization algorithms, existing quantization work is often unreproducible and undeployable. This is because researchers do not choose consistent training pipelines and ignore the requirements for hardware deployments. In this work, we propose Model Quantization Benchmark (MQBench), a first attempt to evaluate, analyze, and benchmark the reproducibility and deployability for model quantization algorithms. We choose multiple different platforms for real-world deployments, including CPU, GPU, ASIC, DSP, and evaluate extensive state-of-the-art quantization algorithms under a unified training pipeline. MQBench acts like a bridge to connect the algorithm and the hardware. We conduct a comprehensive analysis and find considerable intuitive or counter-intuitive insights. By aligning the training settings, we find existing algorithms have about the same performance on the conventional academic track. While for the hardware-deployable quantization, there is a huge accuracy gap which remains unsettled. Surprisingly, no existing algorithm wins every challenge in MQBench, and we hope this work could inspire future research directions.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. NeUQI: Near-Optimal Uniform Quantization Parameter Initialization for Low-Bit LLMs

    cs.LG 2025-05 conditional novelty 6.0 of 10

    NeUQI improves low-bit uniform quantization of LLMs by relaxing the integer zero-point constraint and efficiently searching a near-optimal scale, beating existing PTQ baselines at 2-4 bits.

  2. Efficient Tuning Before Low-Bit Post-Training Quantization for Stochastic Gradient Descent-optimized Models

    cs.CV 2026-07 unverdicted novelty 5.5 of 10

    Pre-tuning a full-precision model with quantization-error noise and weight averaging before PTQ consistently improves low-bit (2-4 bit) quantized accuracy across CNN architectures and segmentation.

  3. Progressive Element-wise Gradient Estimation for Neural Network Quantization

    cs.LG 2025-08 conditional novelty 4.0 of 10

    PEGE replaces the straight-through estimator with a curriculum-driven blend of quantized and full-precision weights plus an additive discretization-error correction, reporting small accuracy gains on low-bit CNNs.

Pith tools