Taxonomy and Evaluation of Structured Compression of Convolutional Neural Networks
Not on the map. Why?
Abstract (arXiv)
The success of deep neural networks in many real-world applications is leading to new challenges in building more efficient architectures. One effective way of making networks more efficient is neural network compression. We provide an overview of existing neural network compression methods that can be used to make neural networks more efficient by changing the architecture of the network. First, we introduce a new way to categorize all published compression methods, based on the amount of data and compute needed to make the methods work in practice. These are three 'levels of compression solutions'. Second, we provide a taxonomy of tensor factorization based and probabilistic compression methods. Finally, we perform an extensive evaluation of different compression techniques from the literature for models trained on ImageNet. We show that SVD and probabilistic compression or pruning methods are complementary and give the best results of all the considered methods. We also provide practical ways to combine them.
Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). First posted on arXiv 20 Dec 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 4; 2022: 2; 2023: 2; 2024: 4.
12 papers.
- 2021A Survey of Quantization Methods for Efficient Neural Network Inferencecited by 798
- 2021Overfitting for Fun and Profit: Instance-Adaptive Data Compressioncited by 38
- 2024AlphaPruning: Using Heavy-Tailed Self Regularization Theory for Improved Layer-wise Pruning of Large Language Modelscited by 35
- 2021Skip-Convolutions for Efficient Video Processingcited by 32
- 2022Data-Efficient Structured Pruning via Submodular Optimizationcited by 22
- 2021Instance-Adaptive Video Compression: Improving Neural Codecs by Training on the Test Setcited by 18
- 2024Mask in the Mirror: Implicit Sparsificationcited by 12
- 2024Bayesian-LoRA: LoRA based Parameter Efficient Fine-Tuning using Optimal Quantization levels and Rank Values trough Differentiable Bayesian Gatescited by 8
- 2022Canonical convolutional neural networkscited by 3
- 2023Neural Network Reduction with Guided Regularizerscited by 0
- 2023Vision Transformers for Mobile Applications: A Short Surveycited by 0
- 2024A Greedy Hierarchical Approach to Whole-Network Filter-Pruning in CNNscited by 0
- 2024AlphaPruning: Using Heavy-Tailed Self Regularization Theory for Improved Layer-wise Pruning of Large Language Models14 Oct 2024
- 2024A Greedy Hierarchical Approach to Whole-Network Filter-Pruning in CNNs22 Aug 2024
- 2024Mask in the Mirror: Implicit Sparsification19 Aug 2024
- 2024Bayesian-LoRA: LoRA based Parameter Efficient Fine-Tuning using Optimal Quantization levels and Rank Values trough Differentiable Bayesian Gates18 Jun 2024
- 2023Vision Transformers for Mobile Applications: A Short Survey30 May 2023
- 2023Neural Network Reduction with Guided Regularizers29 May 2023
- 2022Canonical convolutional neural networks3 Jun 2022
- 2022Data-Efficient Structured Pruning via Submodular Optimization9 Mar 2022
- 2021Instance-Adaptive Video Compression: Improving Neural Codecs by Training on the Test Set19 Nov 2021
- 2021Skip-Convolutions for Efficient Video Processing23 Apr 2021
- 2021A Survey of Quantization Methods for Efficient Neural Network Inference25 Mar 2021
- 2021Overfitting for Fun and Profit: Instance-Adaptive Data Compression21 Jan 2021