mlsanityData to 7 Oct 2026

Filter Distillation for Network Compression

arXiv 1807.10585 ↗First posted 20 Jul 2018cs.CVcited by 17

Not on the map. Why?

Abstract (arXiv)

In this paper we introduce Principal Filter Analysis (PFA), an easy to use and effective method for neural network compression. PFA exploits the correlation between filter responses within network layers to recommend a smaller network that maintain as much as possible the accuracy of the full model. We propose two algorithms: the first allows users to target compression to specific network property, such as number of trainable variable (footprint), and produces a compressed model that satisfies the requested property while preserving the maximum amount of spectral energy in the responses of each layer, while the second is a parameter-free heuristic that selects the compression used at each layer by trying to mimic an ideal set of uncorrelated responses. Since PFA compresses networks based on the correlation of their responses we show in our experiments that it gains the additional flexibility of adapting each architecture to a specific domain while compressing. PFA is evaluated against several architectures and datasets, and shows considerable compression rates without compromising accuracy, e.g., for VGG-16 on CIFAR-10, CIFAR-100 and ImageNet, PFA achieves a compression rate of 8x, 3x, and 1.4x with an accuracy gain of 0.4%, 1.4% points, and 2.4% respectively. Our tests show that PFA is competitive with state-of-the-art approaches while removing adoption barriers thanks to its practical implementation, intuitive philosophy and ease of use.

Key facts. Cited by 17 papers in the map (data through 7 Oct 2026). First posted on arXiv 20 Jul 2018.

Builds on

No reference list yet.

Built on by

Cited by year

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

17 papers.

Sort:

  1. 2022The Combinatorial Brain Surgeon: Pruning Weights That Cancel One Another in Neural Networkscited by 41
  2. 2021Scaling Up Exact Neural Network Compression by ReLU Stabilitycited by 19
  3. 2024Greedy Output Approximation: Towards Efficient Structured Pruning for LLMs Without Retrainingcited by 8
  4. 2021Toward Compact Deep Neural Networks via Energy-Aware Pruningcited by 6
  5. 2022Sauron U-Net: Simple automated redundancy elimination in medical image segmentation via filter pruningcited by 5
  6. 2024Revealing the Utilized Rank of Subspaces of Learning in Neural Networkscited by 4
  7. 2024Compress and Compare: Interactively Evaluating Efficiency and Behavior Across ML Model Compression Experimentscited by 4
  8. 2022Receding Neuron Importances for Structured Pruningcited by 3
  9. 2023Breaking through Deterministic Barriers: Randomized Pruning Mask Generation and Selectioncited by 3
  10. 2023Filter Pruning based on Information Capacity and Independencecited by 2
  11. 2021i-SpaSP: Structured Neural Pruning via Sparse Signal Recoverycited by 1
  12. 2022Supervised Robustness-preserving Data-free Neural Network Pruningcited by 1
5 more
  1. 2021Designing the Architecture of a Convolutional Neural Network Automatically for Diabetic Retinopathy Diagnosiscited by 0
  2. 2022Neural Network Compression via Effective Filter Analysis and Hierarchical Pruningcited by 0
  3. 2023Neural Language Model Pruning for Automatic Speech Recognitioncited by 0
  4. 2024Robustness to distribution shifts of compressed networks for edge devicescited by 0
  5. 2024Subspace Node Pruningcited by 0