mlsanityData to 7 Oct 2026

Gate Decorator: Global Filter Pruning Method for Accelerating Deep Convolutional Neural Networks

arXiv 1909.08174 ↗First posted 18 Sep 2019cs.CV cs.LG eess.IVcited by 118

Not on the map. Why?

Abstract (arXiv)

Filter pruning is one of the most effective ways to accelerate and compress convolutional neural networks (CNNs). In this work, we propose a global filter pruning algorithm called Gate Decorator, which transforms a vanilla CNN module by multiplying its output by the channel-wise scaling factors, i.e. gate. When the scaling factor is set to zero, it is equivalent to removing the corresponding filter. We use Taylor expansion to estimate the change in the loss function caused by setting the scaling factor to zero and use the estimation for the global filter importance ranking. Then we prune the network by removing those unimportant filters. After pruning, we merge all the scaling factors into its original module, so no special operations or structures are introduced. Moreover, we propose an iterative pruning framework called Tick-Tock to improve pruning accuracy. The extensive experiments demonstrate the effectiveness of our approaches. For example, we achieve the state-of-the-art pruning ratio on ResNet-56 by reducing 70% FLOPs without noticeable loss in accuracy. For ResNet-50 on ImageNet, our pruned model with 40% FLOPs reduction outperforms the baseline model by 0.31% in top-1 accuracy. Various datasets are used, including CIFAR-10, CIFAR-100, CUB-200, ImageNet ILSVRC-12 and PASCAL VOC 2011. Code is available at github.com/youzhonghui/gate-decorator-pruning

Key facts. Cited by 118 papers in the map (data through 7 Oct 2026). First posted on arXiv 18 Sep 2019.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 17; 2022: 22; 2023: 24; 2024: 26; 2025: 20; 2026: 9.

118 papers.

Sort:

By area:

  1. 2023DepGraph: Towards Any Structural Pruningcited by 202
  2. 2023A Survey on Deep Neural Network Pruning-Taxonomy, Comparison, Analysis, and Recommendationscited by 200
  3. 2023Structural Pruning for Diffusion Modelscited by 193
  4. 2021Group Fisher Pruning for Practical Network Compressioncited by 130
  5. 2023Structured Pruning for Deep Convolutional Neural Networks: A surveycited by 122
  6. 2021Only Train Once: A One-Shot Neural Network Training And Pruning Frameworkcited by 70
  7. 2024A Survey on Transformer Compressioncited by 44
  8. 2022Structural Pruning via Latency-Saliency Knapsackcited by 40
  9. 2022CHEX: CHannel EXploration for CNN Model Compressioncited by 36
  10. 2023Dynamic Sparse Training with Structured Sparsitycited by 36
  11. 2023OTOV2: Automatic, Generic, User-Friendlycited by 32
  12. 2021GDP: Stabilized Neural Network Pruning via Gates with Differentiable Polarizationcited by 29
38 more
  1. 2021Locally Free Weight Sharing for Network Width Searchcited by 27
  2. 2021Network Pruning That Matters: A Case Study on Retraining Variantscited by 25
  3. 2022DBQ-SSD: Dynamic Ball Query for Efficient 3D Object Detectioncited by 25
  4. 2021TransTailor: Pruning the Pre-trained Model for Improved Transfer Learningcited by 24
  5. 2023Dynamic Grained Encoder for Vision Transformerscited by 24
  6. 2021BCNet: Searching for Network Width with Bilaterally Coupled Networkcited by 23
  7. 2022Winning the Lottery Ahead of Time: Efficient Early Network Pruningcited by 21
  8. 2023SlimSAM: 0.1% Data Makes Segment Anything Slimcited by 20
  9. 2024Auto-Train-Once: Controller Network Guided Automatic Network Pruning from Scratchcited by 20
  10. 2023Dynamic Sparsity Is Channel-Level Sparsity Learnercited by 17
  11. 2023NNSplitter: An Active Defense Solution for DNN Model via Automated Weight Obfuscationcited by 15
  12. 2022Attentive Fine-Grained Structured Sparsity for Image Restorationcited by 12
  13. 2022Soft Masking for Cost-Constrained Channel Pruningcited by 12
  14. 2024AMD: Automatic Multi-step Distillation of Large-scale Vision Modelscited by 12
  15. 2023Automatic Attention Pruning: Improving and Automating Model Pruning using Attentionscited by 11
  16. 2023DynaMask: Dynamic Mask Selection for Instance Segmentationcited by 10
  17. 2023Class-Aware Pruning for Efficient Neural Networkscited by 9
  18. 2021HALP: Hardware-Aware Latency Pruningcited by 8
  19. 2024Structurally Prune Anything: Any Architecture, Any Framework, Any Timecited by 8
  20. 2022LilNetX: Lightweight Networks with EXtreme Model Compression and Structured Sparsificationcited by 7
  21. 2024AFter: Attention-based Fusion Router for RGBT Trackingcited by 7
  22. 2021CATRO: Channel Pruning via Class-Aware Trace Ratio Optimizationcited by 6
  23. 2022Developmental Plasticity-inspired Adaptive Pruning for Deep Spiking and Artificial Neural Networkscited by 6
  24. 2023OTOv3: Automatic Architecture-Agnostic Neural Network Training and Compression from Structured Pruning to Erasing Operatorscited by 6
  25. 2022Ensemble Knowledge Guided Sub-network Search and Fine-tuning for Filter Pruningcited by 5
  26. 2022Sauron U-Net: Simple automated redundancy elimination in medical image segmentation via filter pruningcited by 5
  27. 2023Dynamic Structure Pruning for Compressing CNNscited by 5
  28. 2023CFDP: Common Frequency Domain Pruningcited by 5
  29. 2024Maxwell's Demon at Work: Efficient Pruning by Leveraging Saturation of Neuronscited by 5
  30. 2025On Accelerating Edge AI: Optimizing Resource-Constrained Environmentscited by 5
  31. 2021AdaptCL: Efficient Collaborative Learning with Dynamic and Adaptive Pruningcited by 4
  32. 2021Automatic Neural Network Pruning that Efficiently Preserves the Model Accuracycited by 4
  33. 2022Auto-Compressing Subset Pruning for Semantic Image Segmentationcited by 4
  34. 2022Searching for Network Width with Bilaterally Coupled Networkcited by 4
  35. 2022Boosting Pruned Networks with Linear Over-parameterizationcited by 4
  36. 2022Network Pruning via Feature Shift Minimizationcited by 4
  37. 2022A Fair Loss Function for Network Pruningcited by 4
  38. 2023Influence Function Based Second-Order Channel Pruning-Evaluating True Loss Changes For Pruning Is Possible Without Retrainingcited by 4

50 most cited of 118 All 118 (JSON)