Pith. sign in

Gradient $\ell_1$ Regularization for Quantization Robustness

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

We analyze the effect of quantizing weights and activations of neural networks on their loss and derive a simple regularization scheme that improves robustness against post-training quantization. By training quantization-ready networks, our approach enables storing a single set of weights that can be quantized on-demand to different bit-widths as energy and memory requirements of the application change. Unlike quantization-aware training using the straight-through estimator that only targets a specific bit-width and requires access to training data and pipeline, our regularization-based method paves the way for "on the fly'' post-training quantization to various bit-widths. We show that by modeling quantization as a $\ell_\infty$-bounded perturbation, the first-order term in the loss expansion can be regularized using the $\ell_1$-norm of gradients. We experimentally validate the effectiveness of our regularization scheme on different architectures on CIFAR-10 and ImageNet datasets.

citation-role summary

background 1

citation-polarity summary

fields

cs.CV 1

years

2025 1

verdicts

CONDITIONAL 1

roles

background 1

polarities

unclear 1

representative citing papers

Nearly Lossless Adaptive Bit Switching

cs.CV · 2025-02-03 · conditional · novelty 5.0

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.

citing papers explorer

Showing 1 of 1 citing paper.

  • Nearly Lossless Adaptive Bit Switching cs.CV · 2025-02-03 · conditional · none · ref 34 · internal anchor

    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.