Pith. sign in

REVIEW 1 cited by

Towards Efficient Training for Neural Network Quantization

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 1912.10207 v1 pith:JB3VSR4O submitted 2019-12-21 cs.CV

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

Quantization reduces computation costs of neural networks but suffers from performance degeneration. Is this accuracy drop due to the reduced capacity, or inefficient training during the quantization procedure? After looking into the gradient propagation process of neural networks by viewing the weights and intermediate activations as random variables, we discover two critical rules for efficient training. Recent quantization approaches violates the two rules and results in degenerated convergence. To deal with this problem, we propose a simple yet effective technique, named scale-adjusted training (SAT), to comply with the discovered rules and facilitates efficient training. We also analyze the quantization error introduced in calculating the gradient in the popular parameterized clipping activation (PACT) technique. Through SAT together with gradient-calibrated PACT, quantized models obtain comparable or even better performance than their full-precision counterparts, achieving state-of-the-art accuracy with consistent improvement over previous quantization methods on a wide spectrum of models including MobileNet-V1/V2 and PreResNet-50.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Nearly Lossless Adaptive Bit Switching

    cs.CV 2025-02 conditional novelty 5.0 of 10

    Double Rounding derives lower-bit neural network weights from a stored 8-bit integer model, achieving accuracy comparable to state-of-the-art multi-precision quantization on ImageNet.

Pith tools