mlsanityData to 7 Oct 2026

Knapsack Pruning with Inner Distillation

arXiv 2002.08258 ↗First posted 19 Feb 2020cs.LG stat.MLcited by 20

Not on the map. Why?

Abstract (arXiv)

Neural network pruning reduces the computational cost of an over-parameterized network to improve its efficiency. Popular methods vary from ℓ1-norm sparsification to Neural Architecture Search (NAS). In this work, we propose a novel pruning method that optimizes the final accuracy of the pruned network and distills knowledge from the over-parameterized parent network's inner layers. To enable this approach, we formulate the network pruning as a Knapsack Problem which optimizes the trade-off between the importance of neurons and their associated computational cost. Then we prune the network channels while maintaining the high-level structure of the network. The pruned network is fine-tuned under the supervision of the parent network using its inner network knowledge, a technique we refer to as the Inner Knowledge Distillation. Our method leads to state-of-the-art pruning results on ImageNet, CIFAR-10 and CIFAR-100 using ResNet backbones. To prune complex network structures such as convolutions with skip-links and depth-wise convolutions, we propose a block grouping approach to cope with these structures. Through this we produce compact architectures with the same FLOPs as EfficientNet-B0 and MobileNetV3 but with higher accuracy, by 1% and 0.3% respectively on ImageNet, and faster runtime on GPU.

Key facts. Cited by 20 papers in the map (data through 7 Oct 2026). First posted on arXiv 19 Feb 2020.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 4; 2022: 5; 2023: 7; 2024: 4.

20 papers.

Sort:

  1. 2022A Fast Post-Training Pruning Framework for Transformerscited by 161
  2. 2022Structural Pruning via Latency-Saliency Knapsackcited by 40
  3. 2023What Can We Learn From The Selective Prediction And Uncertainty Estimation Performance Of 523 Imagenet Classifierscited by 35
  4. 2022SPDY: Accurate Pruning with Speedup Guaranteescited by 34
  5. 2021HardCoRe-NAS: Hard Constrained diffeRentiable Neural Architecture Searchcited by 20
  6. 2023Coaching a Teachable Studentcited by 17
  7. 2024Hierarchical Selective Classificationcited by 7
  8. 2024LayerMerge: Neural Network Depth Compression through Layer Pruning and Mergingcited by 7
  9. 2021Compact and Optimal Deep Learning with Recurrent Parameter Generatorscited by 5
  10. 2023Pruning Compact ConvNets for Efficient Inferencecited by 2
  11. 2024Enhanced Sparsification via Stimulative Trainingcited by 2
  12. 2021Measure Twice, Cut Once: Quantifying Bias and Fairness in Deep Neural Networkscited by 1
8 more
  1. 2022Which models are innately best at uncertainty estimation?cited by 1
  2. 2022L-GreCo: Layerwise-Adaptive Gradient Compression for Efficient and Accurate Deep Learningcited by 1
  3. 2023Efficient Latency-Aware CNN Depth Compression via Two-Stage Dynamic Programmingcited by 1
  4. 2023Securing Neural Networks with Knapsack Optimizationcited by 1
  5. 2023Supervised Domain Adaptation for Recognizing Retinal Diseases from Wide-Field Fundus Imagescited by 1
  6. 2024Convolutional Prompting for Broad-Domain Retinal Vessel Segmentationcited by 1
  7. 2021Exploiting Features with Split-and-Share Modulecited by 0
  8. 2023Learning Sparse Neural Networks with Identity Layerscited by 0