Towards Compact CNNs via Collaborative Compression
Yuchao Li, Shaohui Lin, Jianzhuang Liu, Qixiang Ye, Mengdi Wang, Fei Chao, Fan Yang, Jincheng Ma, Qi Tian, Rongrong Ji
Abstract
Channel pruning and tensor decomposition have received extensive attention in convolutional neural network compression. However, these two techniques are traditionally deployed in an isolated manner, leading to significant accuracy drop when pursuing high compression rates. In this paper, we propose a Collaborative Compression (CC) scheme, which joints channel pruning and tensor decomposition to compress CNN models by simultaneously learning the model sparsity and low-rankness. Specifically, we first investigate the compression sensitivity of each layer in the network, and then propose a Global Compression Rate Optimization that transforms the decision problem of compression rate into an optimization problem. After that, we propose multi-step heuristic compression to remove redundant compression units step-by-step, which fully considers the effect of the remaining compression space (i.e., unremoved compression units). Our method demonstrates superior performance gains over previous ones on various datasets and backbone architectures. For example, we achieve 52.9% FLOPs reduction by removing 48.4% parameters on ResNet-50 with only a Top-1 accuracy drop of 0.56% on ImageNet 2012.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext c63a575e-c739-4bba-967b-38e796133dd0Cited by top-tier papers16
- NOLA: Compressing LoRA using Linear Combination of Random BasisSoroush Abbasi Koohpayegani, Navaneet K. L., Parsa Nooralinejad, Soheil Kolouri et al.ICLR 2024 · 33 citations
- Automatic Network Pruning via Hilbert-Schmidt Independence Criterion Lasso under Information Bottleneck PrincipleSong Guo, Lei Zhang, Xiawu Zheng, Yan Wang et al.ICCV 2023 · 30 citations
- Structural Alignment for Network Pruning through Partial RegularizationShangqian Gao, Zeyu Zhang, Yanfu Zhang, Feihu Huang et al.ICCV 2023 · 26 citations
- HODEC: Towards Efficient High-Order DEcomposed Convolutional Neural NetworksMiao Yin, Yang Sui, Wanzhao Yang, Xiao Zang et al.CVPR 2022 · 17 citations
- One Less Reason for Filter Pruning: Gaining Free Adversarial Robustness with Structured Grouped Kernel PruningShaochen (Henry) Zhong, Zaichuan You, Jiamu Zhang, Sebastian Zhao et al.NeurIPS 2023 · 13 citations
Builds on2
Related papers
- Towards Efficient Tensor Decomposition-Based DNN Model Compression With Optimization FrameworkMiao Yin, Yang Sui, Siyu Liao, Bo YuanCVPR 2021
- AKECP: Adaptive Knowledge Extraction from Feature Maps for Fast and Efficient Channel PruningHaonan Zhang, Longjun Liu, Hengyi Zhou, Wenxuan Hou et al.ACM MM 2021 · 29 citations
- Compressing Neural Networks: Towards Determining the Optimal Layer-wise DecompositionLucas Liebenwein, Alaa Maalouf, Dan Feldman, Daniela RusNeurIPS 2021 · 60 citations
- Distribution-Aware Tensor Decomposition for Compression of Convolutional Neural NetworksAlper Kalle, Théo Rudkiewicz, Mohamed Ouerfelli, Mohamed TamaazoustiNeurIPS 2025 · 2 citations
- Towards Higher Ranks via Adversarial Weight PruningYuchuan Tian, Hanting Chen, Tianyu Guo, Chao Xu et al.NeurIPS 2023 · 9 citations
