Electrostatic Force Regularization for Neural Structured Pruning
Not on the map. Why?
Abstract (arXiv)
The demand for deploying deep convolutional neural networks (DCNNs) on resource-constrained devices for real-time applications remains substantial. However, existing state-of-the-art structured pruning methods often involve intricate implementations, require modifications to the original network architectures, and necessitate an extensive fine-tuning phase. To overcome these challenges, we propose a novel method that, for the first time, incorporates the concepts of charge and electrostatic force from physics into the training process of DCNNs. The magnitude of this force is directly proportional to the product of the charges of the convolution filter and the source filter, and inversely proportional to the square of the distance between them. We applied this electrostatic-like force to the convolution filters, either attracting filters with opposite charges toward non-zero weights or repelling filters with like charges toward zero weights. Consequently, filters subject to repulsive forces have their weights reduced to zero, enabling their removal, while the attractive forces preserve filters with significant weights that retain information. Unlike conventional methods, our approach is straightforward to implement, does not require any architectural modifications, and simultaneously optimizes weights and ranks filter importance, all without the need for extensive fine-tuning. We validated the efficacy of our method on modern DCNN architectures using the MNIST, CIFAR, and ImageNet datasets, achieving competitive performance compared to existing structured pruning approaches.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 27 of its 38 references that are in the map. First posted on arXiv 17 Nov 2024.
Builds on
27 of 38 references.
References · 27
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
- 2016Pruning Filters for Efficient ConvNetscited by 1,129
- 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 802
- 2017Channel Pruning for Accelerating Very Deep Neural Networkscited by 697
- 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 627
- 2018Rethinking the Value of Network Pruningcited by 595
- 2019Importance Estimation for Neural Network Pruningcited by 531
- 2019Rigging the Lottery: Making All Tickets Winnerscited by 491
- 2020Picking Winning Tickets Before Training by Preserving Gradient Flowcited by 467
- 2018AMC: AutoML for Model Compression and Acceleration on Mobile Devicescited by 375
- 2018Filter Pruning via Geometric Median for Deep Convolutional Neural Networks Accelerationcited by 365
- 2018Soft Filter Pruning for Accelerating Deep Convolutional Neural Networkscited by 313
15 more
- 2019EigenDamage: Structured Pruning in the Kronecker-Factored Eigenbasiscited by 98
- 2020Neural Pruning via Growing Regularizationcited by 97
- 2020Channel Pruning via Automatic Structure Searchcited by 84
- 2019Centripetal SGD for Pruning Very Deep Convolutional Networks with Complicated Structurecited by 76
- 2020Progressive Skeletonization: Trimming more fat from a network at initializationcited by 64
- 2022Advancing Model Pruning via Bi-level Optimizationcited by 55
- 2020Discrimination-aware Network Pruning for Deep Model Compressioncited by 50
- 2023Efficient Joint Optimization of Layer-Adaptive Weight Pruning in Deep Neural Networkscited by 15
- 2023Accelerating Deep Neural Networks via Semi-Structured Activation Sparsitycited by 10
- 2024Finding Lottery Tickets in Vision Models via Data-driven Spectral Foresight Pruningcited by 10
- 2022Complexity-Driven CNN Compression for Resource-constrained Edge AIcited by 8
- 2020Gradual Channel Pruning while Training using Feature Relevance Scores for Convolutional Neural Networkscited by 6
- 2023WHC: Weighted Hybrid Criterion for Filter Pruning on Convolutional Neural Networkscited by 6
- 2024OrthCaps: An Orthogonal CapsNet with Sparse Attention Routing and Pruningcited by 5
- 2024UniPTS: A Unified Framework for Proficient Post-Training Sparsitycited by 3
Built on by
Citing papers per year: 2024: 1; 2025: 1.
2 papers.