Pith. sign in

REVIEW 4 cited by

BSQ: Exploring Bit-Level Sparsity for Mixed-Precision 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 2102.10462 v1 pith:CXRMH4KG submitted 2021-02-20 cs.LG cs.CV

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

Mixed-precision quantization can potentially achieve the optimal tradeoff between performance and compression rate of deep neural networks, and thus, have been widely investigated. However, it lacks a systematic method to determine the exact quantization scheme. Previous methods either examine only a small manually-designed search space or utilize a cumbersome neural architecture search to explore the vast search space. These approaches cannot lead to an optimal quantization scheme efficiently. This work proposes bit-level sparsity quantization (BSQ) to tackle the mixed-precision quantization from a new angle of inducing bit-level sparsity. We consider each bit of quantized weights as an independent trainable variable and introduce a differentiable bit-sparsity regularizer. BSQ can induce all-zero bits across a group of weight elements and realize the dynamic precision reduction, leading to a mixed-precision quantization scheme of the original model. Our method enables the exploration of the full mixed-precision space with a single gradient-based optimization process, with only one hyperparameter to tradeoff the performance and compression. BSQ achieves both higher accuracy and higher bit reduction on various model architectures on the CIFAR-10 and ImageNet datasets comparing to previous methods.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 4 Pith papers

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

  1. TASQ: Temporal-Adaptive Bit Sparsification Quantization for Diffusion Models

    cs.CV 2026-08 conditional novelty 7.0 of 10

    A temporal-spatial LSB mask over one shared weight buffer lets diffusion models use lower bit precision in less sensitive denoising stages, cutting compute by 25-50% on bit-serial hardware with no loss in image quality.

  2. MSQ: Memory-Efficient Bit Sparsification Quantization

    cs.LG 2025-07 conditional novelty 6.0 of 10

    MSQ computes and prunes least significant bits of weights directly from the full-precision parameters, cutting training memory and time for mixed-precision quantization compared with bit-splitting methods.

  3. LowRA: Accurate and Efficient LoRA Fine-Tuning of LLMs under 2 Bits

    cs.LG 2025-02 conditional novelty 6.0 of 10

    LowRA enables LoRA fine-tuning with base weights at 1.15 to 4 bits per parameter, outperforming QLoRA and LoftQ at equal bit widths and matching their accuracy at lower bit widths.

  4. Principled Approximation Methods for Efficient and Scalable Deep Learning

    cs.LG 2025-08 conditional novelty 3.0 of 10

    A thesis that synthesizes the author's published work on continuous approximations to discrete deep learning problems, with experiments showing efficiency gains, but offering little new beyond the author's prior papers.

Pith tools