mlsanityData to 14 Oct 2026

CoDeQ: End-to-End Joint Model Compression with Dead-Zone Quantizer for High-Sparsity and Low-Precision Networks

arXiv 2512.12981 ↗First posted 15 Dec 2025cs.LG stat.MLcited by 2

Not on the map. Why?

Abstract (arXiv)

While joint pruning--quantization is theoretically superior to sequential application, current joint methods rely on auxiliary procedures outside the training loop for finding compression parameters. This reliance adds engineering complexity and hyperparameter tuning, while also lacking a direct data-driven gradient signal, which might result in sub-optimal compression. In this paper, we introduce CoDeQ, a simple, fully differentiable method for joint pruning--quantization. Our approach builds on a key observation: the dead-zone of a scalar quantizer is equivalent to magnitude pruning, and can be used to induce sparsity directly within the quantization operator. Concretely, we parameterize the dead-zone width and learn it via backpropagation, alongside the quantization parameters. This design provides explicit control of sparsity, regularized by a single global hyperparameter, while decoupling sparsity selection from bit-width selection. The result is a method for Compression with Dead-zone Quantizer (CoDeQ) that supports both fixed-precision and mixed-precision quantization (controlled by an optional second hyperparameter). It simultaneously determines the sparsity pattern and quantization parameters in a single end-to-end optimization. Consequently, CoDeQ does not require any auxiliary procedures, making the method architecture-agnostic and straightforward to implement. On ImageNet with ResNet-18, CoDeQ reduces bit operations to ~5% while maintaining close to full precision accuracy in both fixed and mixed-precision regimes.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 13 of its 20 references that are in the map. First posted on arXiv 15 Dec 2025.

Builds on

13 of 20 references.

References · 13

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,329
  3. 2013Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computationcited by 2,079
  4. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,031
  5. 2017Quantization and Training of Neural Networks for Efficient Integer-Arithmetic-Only Inferencecited by 1,593
  6. 2019Learned Step Size Quantizationcited by 628
  7. 2018Quantizing deep convolutional networks for efficient inference: A whitepapercited by 521
  8. 2022TinyViT: Fast Pretraining Distillation for Small Vision Transformerscited by 234
  9. 2016Dynamic Network Surgery for Efficient DNNscited by 233
  10. 2020APQ: Joint Search for Network Architecture, Pruning and Quantization Policycited by 99
  11. 2020Bayesian Bits: Unifying Quantization and Pruningcited by 94
  12. 2020Differentiable Joint Pruning and Quantization for Hardware Efficiencycited by 46
1 more
  1. 2025Automatic Joint Structured Pruning and Quantization for Efficient Neural Network Training and Compressioncited by 14

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 2.

2 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2026Joint Structural Pruning and Mixed-Precision Quantization for LLM Compression
  2. 2026HeRo-Q: A General Framework for Stable Low Bit Quantization via Hessian Conditioning
  3. 2022OPQ: Compressing Deep Neural Networks with One-shot Pruning-Quantization
  4. 2026Few Bits, One Law: Toward W2A4KV2
  5. 2026Soft Quantization: Model Compression Via Weight Coupling
  6. 2023Towards Optimal Compression: Joint Pruning and Quantization
  7. 2026Beyond Outliers: A Data-Free Layer-wise Mixed-Precision Quantization Approach Driven by Numerical and Structural Dual-Sensitivity
  8. 2021Single-path Bit Sharing for Automatic Loss-aware Model Compression