GDP: Stabilized Neural Network Pruning via Gates with Differentiable Polarization
Yi Guo, Huan Yuan, Jianchao Tan, Zhangyang Wang, Sen Yang, Ji Liu

TL;DR
This paper introduces GDP, a differentiable polarization-based gating method for neural network pruning that effectively removes channels without disrupting training, achieving state-of-the-art results on multiple benchmarks.
Contribution
GDP provides a novel, principled approach to channel pruning by using differentiable polarization to smoothly identify and remove unimportant channels during training.
Findings
Achieves state-of-the-art pruning performance on CIFAR-10 and ImageNet.
Maintains or improves performance on Pascal VOC segmentation with significant FLOPs reduction.
Abstract
Model compression techniques are recently gaining explosive attention for obtaining efficient AI models for various real-time applications. Channel pruning is one important compression strategy and is widely used in slimming various DNNs. Previous gate-based or importance-based pruning methods aim to remove channels whose importance is smallest. However, it remains unclear what criteria the channel importance should be measured on, leading to various channel selection heuristics. Some other sampling-based pruning methods deploy sampling strategies to train sub-nets, which often causes the training instability and the compressed model's degraded performance. In view of the research gaps, we present a new module named Gates with Differentiable Polarization (GDP), inspired by principled optimization ideas. GDP can be plugged before convolutional layers without bells and whistles, to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSpeech Recognition and Synthesis · Underwater Acoustics Research · Speech and Audio Processing
MethodsPruning · Convolution
