mlsanityData to 14 Oct 2026

Prune-Quantize-Distill: An Ordered Pipeline for Efficient Neural Network Compression

arXiv 2604.04988 ↗First posted 5 Apr 2026cs.LG cs.AI cs.CLcited by 1

Not on the map. Why?

Abstract (arXiv)

Modern deployment often requires trading accuracy for efficiency under tight CPU and memory constraints, yet common compression proxies such as parameter count or FLOPs do not reliably predict wall-clock inference time. In particular, unstructured sparsity can reduce model storage while failing to accelerate (and sometimes slightly slowing down) standard CPU execution due to irregular memory access and sparse kernel overhead. Motivated by this gap between compression and acceleration, we study a practical, ordered pipeline that targets measured latency by combining three widely used techniques: unstructured pruning, INT8 quantization-aware training (QAT), and knowledge distillation (KD). Empirically, INT8 QAT provides the dominant runtime benefit, while pruning mainly acts as a capacity-reduction pre-conditioner that improves the robustness of subsequent low-precision optimization; KD, applied last, recovers accuracy within the already constrained sparse INT8 regime without changing the deployment form. We evaluate on CIFAR-10/100 using three backbones (ResNet-18, WRN-28-10, and VGG-16-BN). Across all settings, the ordered pipeline achieves a stronger accuracy-size-latency frontier than any single technique alone, reaching 0.99-1.42 ms CPU latency with competitive accuracy and compact checkpoints. Controlled ordering ablations with a fixed 20/40/40 epoch allocation further confirm that stage order is consequential, with the proposed ordering generally performing best among the tested permutations. Overall, our results provide a simple guideline for edge deployment: evaluate compression choices in the joint accuracy-size-latency space using measured runtime, rather than proxy metrics alone.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 12 of its 16 references that are in the map. First posted on arXiv 5 Apr 2026.

Builds on

12 of 16 references.

References · 12

  1. 2015Distilling the Knowledge in a Neural Networkcited by 10,324
  2. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
  3. 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 812
  4. 2019Once-for-All: Train One Network and Specialize it for Efficient Deploymentcited by 787
  5. 2019Contrastive Representation Distillationcited by 748
  6. 2019Learned Step Size Quantizationcited by 628
  7. 2016DoReFa-Net: Training Low Bitwidth Convolutional Neural Networks with Low Bitwidth Gradientscited by 569
  8. 2021Pruning and Quantization for Deep Neural Network Acceleration: A Surveycited by 263
  9. 2017Incremental Network Quantization: Towards Lossless CNNs with Low-Precision Weightscited by 217
  10. 2023A Survey on Deep Neural Network Pruning-Taxonomy, Comparison, Analysis, and Recommendationscited by 202
  11. 2021PQK: Model Compression via Pruning, Quantization, and Knowledge Distillationcited by 21
  12. 2022Boosting Pruned Networks with Linear Over-parameterizationcited by 4

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.

Similar, not cited

Close in wording, no citation either way

  1. 2023Towards Optimal Compression: Joint Pruning and Quantization
  2. 2021Ps and Qs: Quantization-aware pruning for efficient low latency neural network inference
  3. 2023Hardware-Aware DNN Compression via Diverse Pruning and Mixed-Precision Quantization
  4. 2022Towards Hardware-Specific Automatic Compression of Neural Networks
  5. 2023End-to-End Neural Network Compression via fracℓ1ℓ2 Regularized Latency Surrogates
  6. 2025Constrained Edge AI Deployment: Fine-Tuning vs Distillation for LLM Compression
  7. 2025Theoretical Compression Bounds for Wide Multilayer Perceptrons
  8. 2025Integrating Pruning with Quantization for Efficient Deep Neural Networks Compression