mlsanityData to 7 Oct 2026

Convolution-Weight-Distribution Assumption: Rethinking the Criteria of Channel Pruning

arXiv 2004.11627 ↗First posted 24 Apr 2020cs.LG cs.CV stat.MLcited by 29

Not on the map. Why?

Abstract (arXiv)

Channel pruning is a popular technique for compressing convolutional neural networks (CNNs), where various pruning criteria have been proposed to remove the redundant filters. From our comprehensive experiments, we found two blind spots in the study of pruning criteria: (1) Similarity: There are some strong similarities among several primary pruning criteria that are widely cited and compared. According to these criteria, the ranks of filters'Importance Score are almost identical, resulting in similar pruned structures. (2) Applicability: The filters'Importance Score measured by some pruning criteria are too close to distinguish the network redundancy well. In this paper, we analyze these two blind spots on different types of pruning criteria with layer-wise pruning or global pruning. The analyses are based on the empirical experiments and our assumption (Convolutional Weight Distribution Assumption) that the well-trained convolutional filters each layer approximately follow a Gaussian-alike distribution. This assumption has been verified through systematic and extensive statistical tests.

Key facts. Cited by 29 papers in the map (data through 7 Oct 2026). First posted on arXiv 24 Apr 2020.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 1; 2022: 11; 2023: 6; 2024: 7; 2025: 2; 2026: 2.

29 papers.

Sort:

By area:

  1. 2022Revisiting Random Channel Pruning for Neural Network Compressioncited by 50
  2. 2021A Bayesian Federated Learning Framework with Online Laplace Approximationcited by 41
  3. 2023ScaleLong: Towards More Stable Training of Diffusion Model via Scaling Network Long Skip Connectioncited by 25
  4. 2022On Fast Simulation of Dynamical System with Neural Vector Enhanced Numerical Solvercited by 9
  5. 2023Understanding Self-attention Mechanism via Dynamical System Perspectivecited by 9
  6. 2022The Lottery Ticket Hypothesis for Self-attention in Convolutional Neural Networkcited by 7
  7. 2024Is Oracle Pruning the True Oracle?cited by 7
  8. 2025MiniLongBench: The Low-cost Long Context Understanding Benchmark for Large Language Modelscited by 7
  9. 2022Weight Expansion: A New Perspective on Dropout and Generalizationcited by 6
  10. 2024Mirror Gradient: Towards Robust Multimodal Recommender Systems via Exploring Flat Local Minimacited by 6
  11. 2024Effective Layer Pruning Through Similarity Metric Perspectivecited by 6
  12. 2022MUDGUARD: Taming Malicious Majorities in Federated Learning using Privacy-Preserving Byzantine-Robust Clusteringcited by 5
17 more
  1. 2022Switchable Self-attention Modulecited by 4
  2. 2022Entropy Induced Pruning Framework for Convolutional Neural Networkscited by 3
  3. 2022Mix-Pooling Strategy for Attention Mechanismcited by 3
  4. 2023Resource Constrained Model Compression via Minimax Optimization for Spiking Neural Networkscited by 3
  5. 2024BGDB: Bernoulli-Gaussian Decision Block with Improved Denoising Diffusion Probabilistic Modelscited by 3
  6. 2023ASR: Attention-alike Structural Re-parameterizationcited by 2
  7. 2026Sensitivity-Guided Framework for Pruned and Quantized Reservoir Computing Acceleratorscited by 2
  8. 2022Attention Round for Post-Training Quantizationcited by 1
  9. 2022Efficient Climate Simulation via Machine Learning Methodcited by 1
  10. 2023Towards Deep Network Steganography: From Networks to Networkscited by 1
  11. 2024Generative adversarial learning with optimal input dimension and its adaptive generator architecturecited by 1
  12. 2024DeepVigor+: Scalable and Accurate Semi-Analytical Fault Resilience Analysis for Deep Neural Networkcited by 1
  13. 2022CWP: Instance complexity weighted channel-wise soft masks for network pruningcited by 0
  14. 2023SparseByteNN: A Novel Mobile Inference Acceleration Framework Based on Fine-Grained Group Sparsitycited by 0
  15. 2024Layer Pruning with Consensus: A Triple-Win Solutioncited by 0
  16. 2025Exploring and Reshaping the Weight Distribution in LLMcited by 0
  17. 2026RecycleLoRA: Rank-Revealing QR-Based Dual-LoRA Subspace Adaptation for Domain Generalized Semantic Segmentationcited by 0