Domain-adaptive deep network compression
Not on the map. Why?
Abstract (arXiv)
Deep Neural Networks trained on large datasets can be easily transferred to new domains with far fewer labeled examples by a process called fine-tuning. This has the advantage that representations learned in the large source domain can be exploited on smaller target domains. However, networks designed to be optimal for the source task are often prohibitively large for the target task. In this work we address the compression of networks after domain transfer. We focus on compression algorithms based on low-rank matrix decomposition. Existing methods base compression solely on learned network weights and ignore the statistics of network activations. We show that domain transfer leads to large shifts in network activations and that it is desirable to take this into account when compressing. We demonstrate that considering activation statistics when compressing weights leads to a rank-constrained regression problem with a closed-form solution. Because our method takes into account the target domain, it can more optimally remove the redundancy in the weights. Experiments show that our Domain Adaptive Low Rank (DALR) method significantly outperforms existing low-rank compression techniques. With our approach, the fc6 layer of VGG19 can be compressed more than 4x more than using truncated SVD alone -- with only a minor or no loss in accuracy. When applied to domain-transferred networks it allows for compression down to only 5-20% of the original number of parameters with only a minor drop in performance.
Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). First posted on arXiv 4 Sep 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 5; 2022: 1; 2023: 1; 2024: 0; 2025: 2.
9 papers.
- 2022Is Complexity Required for Neural Network Pruning? A Case Study on Global Magnitude Pruningcited by 13
- 2021Model Pruning Based on Quantified Similarity of Feature Mapscited by 6
- 2021A Domain-Oblivious Approach for Learning Concise Representations of Filtered Topological Spaces for Clusteringcited by 2
- 2021Efficient Visual Recognition with Deep Neural Networks: A Survey on Recent Advances and New Directionscited by 2
- 2023Are Visual Recognition Models Robust to Image Compression?cited by 2
- 2021FFConv: Fast Factorized Convolutional Neural Network Inference on Encrypted Datacited by 1
- 2021A Highly Effective Low-Rank Compression of Deep Neural Networks with Modified Beam-Search and Modified Stable Rankcited by 1
- 2025BackSlash: Rate Constrained Optimized Training of Large Language Modelscited by 1
- 2025A Brief Review for Compression and Transfer Learning Techniques in DeepFake Detectioncited by 1
- 2025A Brief Review for Compression and Transfer Learning Techniques in DeepFake Detection29 Apr 2025
- 2025BackSlash: Rate Constrained Optimized Training of Large Language Models23 Apr 2025
- 2023Are Visual Recognition Models Robust to Image Compression?10 Apr 2023
- 2022Is Complexity Required for Neural Network Pruning? A Case Study on Global Magnitude Pruning29 Sep 2022
- 2021A Highly Effective Low-Rank Compression of Deep Neural Networks with Modified Beam-Search and Modified Stable Rank30 Nov 2021
- 2021Efficient Visual Recognition with Deep Neural Networks: A Survey on Recent Advances and New Directions30 Aug 2021
- 2021A Domain-Oblivious Approach for Learning Concise Representations of Filtered Topological Spaces for Clustering25 May 2021
- 2021Model Pruning Based on Quantified Similarity of Feature Maps13 May 2021
- 2021FFConv: Fast Factorized Convolutional Neural Network Inference on Encrypted Data6 Feb 2021