mlsanityData to 14 Oct 2026

Pruning Filter in Filter

arXiv 2009.14410 ↗First posted 30 Sep 2020cs.CVcited by 47

Not on the map. Why?

Abstract (arXiv)

Pruning has become a very powerful and effective technique to compress and accelerate modern neural networks. Existing pruning methods can be grouped into two categories: filter pruning (FP) and weight pruning (WP). FP wins at hardware compatibility but loses at the compression ratio compared with WP. To converge the strength of both methods, we propose to prune the filter in the filter. Specifically, we treat a filter F ∈ ℝC× K× K as K × K stripes, i.e., 1× 1 filters ∈ ℝC, then by pruning the stripes instead of the whole filter, we can achieve finer granularity than traditional FP while being hardware friendly. We term our method as SWP (Stripe-Wise Pruning). SWP is implemented by introducing a novel learnable matrix called Filter Skeleton, whose values reflect the shape of each filter. As some recent work has shown that the pruned architecture is more crucial than the inherited important weights, we argue that the architecture of a single filter, i.e., the shape, also matters. Through extensive experiments, we demonstrate that SWP is more effective compared to the previous FP-based methods and achieves the state-of-art pruning ratio on CIFAR-10 and ImageNet datasets without obvious accuracy drop. Code is available at https://github.com/fxmeng/Pruning-Filter-in-Filter

Key facts. Cited by 47 papers in the map (data through 14 Oct 2026). First posted on arXiv 30 Sep 2020.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 8; 2022: 3; 2023: 17; 2024: 8; 2025: 8; 2026: 3.

47 papers.

Sort:

By area:

  1. 2023A Survey on Deep Neural Network Pruning-Taxonomy, Comparison, Analysis, and Recommendationscited by 202
  2. 2023Structured Pruning for Deep Convolutional Neural Networks: A surveycited by 122
  3. 2021Only Train Once: A One-Shot Neural Network Training And Pruning Frameworkcited by 70
  4. 2022Training-free Transformer Architecture Searchcited by 33
  5. 2023OTOV2: Automatic, Generic, User-Friendlycited by 32
  6. 2024STBLLM: Breaking the 1-Bit Barrier with Structured Binary LLMscited by 31
  7. 2024SGLP: A Similarity Guided Fast Layer Partition Pruning for Compressing Large Deep Modelscited by 25
  8. 2021RED : Looking for Redundancies for Data-Free Structured Compression of Deep Neural Networkscited by 19
  9. 2021RED++ : Data-Free Pruning of Deep Neural Networks via Input Splitting and Output Mergingcited by 19
  10. 2024A Generic Layer Pruning Method for Signal Modulation Recognition Deep Learning Modelscited by 18
  11. 2025Automatic Joint Structured Pruning and Quantization for Efficient Neural Network Training and Compressioncited by 14
  12. 2023Bi-directional Masks for Efficient N:M Sparse Trainingcited by 13
35 more
  1. 2023CP3: Channel Pruning Plug-in for Point-based Networkscited by 10
  2. 2023Differentiable Transportation Pruningcited by 10
  3. 2024An Effective Information Theoretic Framework for Channel Pruningcited by 7
  4. 2023OTOv3: Automatic Architecture-Agnostic Neural Network Training and Compression from Structured Pruning to Erasing Operatorscited by 6
  5. 2021Training Compact CNNs for Image Classification using Dynamic-coded Filter Fusioncited by 5
  6. 2023Dynamic Structure Pruning for Compressing CNNscited by 5
  7. 2023Parameter and Computation Efficient Transfer Learning for Vision-Language Pre-trained Modelscited by 5
  8. 2025On Accelerating Edge AI: Optimizing Resource-Constrained Environmentscited by 5
  9. 2021Automatic Neural Network Pruning that Efficiently Preserves the Model Accuracycited by 4
  10. 2024DTMM: Deploying TinyML Models on Extremely Weak IoT Devices with Pruningcited by 4
  11. 2024HESSO: Towards Automatic Efficient and User Friendly Any Neural Network Training and Pruningcited by 4
  12. 2025FedRTS: Federated Robust Pruning via Combinatorial Thompson Samplingcited by 4
  13. 2025FCOS: A Two-Stage Recoverable Model Pruning Framework for Automatic Modulation Recognitioncited by 4
  14. 2023Learning Task-preferred Inference Routes for Gradient De-conflict in Multi-output DNNscited by 3
  15. 2023Less is More -- Towards parsimonious multi-task models using structured sparsitycited by 2
  16. 2021SMOF: Squeezing More Out of Filters Yields Hardware-Friendly CNN Pruningcited by 1
  17. 2021RGP: Neural Network Pruning through Its Regular Graph Structurecited by 1
  18. 2021Learning Pruned Structure and Weights Simultaneously from Scratch: an Attention based Approachcited by 1
  19. 2023Spatial Re-parameterization for N:M Sparsitycited by 1
  20. 2023A Proximal Algorithm for Network Slimmingcited by 1
  21. 2023SUBP: Soft Uniform Block Pruning for 1xN Sparse CNNs Multithreading Accelerationcited by 1
  22. 2025Hardware-Aware DNN Compression for Homogeneous Edge Devicescited by 1
  23. 2025Structured Pruning and Quantization for Learned Image Compressioncited by 1
  24. 2022Hyperparameter Optimization with Neural Network Pruningcited by 0
  25. 2022A pruning method based on the dissimilarity of angle among channels and filterscited by 0
  26. 2023Beta-Rank: A Robust Convolutional Filter Pruning Method For Imbalanced Medical Image Analysiscited by 0
  27. 2023Network Pruning Spacescited by 0
  28. 2023MGAS: Multi-Granularity Architecture Search for Trade-Off Between Model Effectiveness and Efficiencycited by 0
  29. 2024Robustness to distribution shifts of compressed networks for edge devicescited by 0
  30. 2024Not All Attention is Needed: Parameter and Computation Efficient Transfer Learning for Multi-modal Large Language Modelscited by 0
  31. 2025Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learningcited by 0
  32. 2025Can abstract concepts from LLM improve SLM performance?cited by 0
  33. 2026Bias In, Bias Out? Finding Unbiased Subnetworks in Vanilla Modelscited by 0
  34. 2026Neural Network Compression by Approximate Differential Equivalencecited by 0
  35. 2026Are the High-weight Neurons the Important Ones in Image Classification Neural Networks?cited by 0