Dynamic Collective Intelligence Learning: Finding Efficient Sparse Model via Refined Gradients for Pruned Weights
Not on the map. Why?
Abstract (arXiv)
With the growth of deep neural networks (DNN), the number of DNN parameters has drastically increased. This makes DNN models hard to be deployed on resource-limited embedded systems. To alleviate this problem, dynamic pruning methods have emerged, which try to find diverse sparsity patterns during training by utilizing Straight-Through-Estimator (STE) to approximate gradients of pruned weights. STE can help the pruned weights revive in the process of finding dynamic sparsity patterns. However, using these coarse gradients causes training instability and performance degradation owing to the unreliable gradient signal of the STE approximation. In this work, to tackle this issue, we introduce refined gradients to update the pruned weights by forming dual forwarding paths from two sets (pruned and unpruned) of weights. We propose a novel Dynamic Collective Intelligence Learning (DCIL) which makes use of the learning synergy between the collective intelligence of both weight sets. We verify the usefulness of the refined gradients by showing enhancements in the training stability and the model performance on the CIFAR and ImageNet datasets. DCIL outperforms various previously proposed pruning schemes including other dynamic pruning methods with enhanced stability during training.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 23 of its 29 references that are in the map. First posted on arXiv 10 Sep 2021.
Builds on
23 of 29 references.
References · 23
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2015Distilling the Knowledge in a Neural Networkcited by 10,076
- 2014ImageNet Large Scale Visual Recognition Challengecited by 8,441
- 2016Wide Residual Networkscited by 3,057
- 2013Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computationcited by 2,031
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
- 2017Accurate, Large Minibatch SGD: Training ImageNet in 1 Hourcited by 1,479
- 2016Pruning Filters for Efficient ConvNetscited by 1,129
- 2017Channel Pruning for Accelerating Very Deep Neural Networkscited by 697
- 2017To prune, or not to prune: exploring the efficacy of pruning for model compressioncited by 596
- 2018Rethinking the Value of Network Pruningcited by 595
- 2018Filter Pruning via Geometric Median for Deep Convolutional Neural Networks Accelerationcited by 365
11 more
- 2017Scalable Training of Artificial Neural Networks with Adaptive Sparse Connectivity inspired by Network Sciencecited by 325
- 2018Soft Filter Pruning for Accelerating Deep Convolutional Neural Networkscited by 313
- 2018Paraphrasing Complex Network: Network Compression via Factor Transfercited by 255
- 2020Comparing Rewinding and Fine-tuning in Neural Network Pruningcited by 238
- 2016Dynamic Network Surgery for Efficient DNNscited by 233
- 2019Sparse Networks from Scratch: Faster Training without Losing Performancecited by 210
- 2019Parameter Efficient Training of Deep Convolutional Neural Networks by Dynamic Sparse Reparameterizationcited by 187
- 2020Dynamic Model Pruning with Feedbackcited by 125
- 2017More is Less: A More Complicated Network with Less Inference Complexitycited by 66
- 2017meProp: Sparsified Back Propagation for Accelerated Deep Learning with Reduced Overfittingcited by 34
- 2017Minimal Effort Back Propagation for Convolutional Neural Networkscited by 7
Built on by
Citing papers per year: 2023: 1; 2024: 1; 2025: 2.
4 papers.
- 2023Magnitude Attention-based Dynamic Pruningcited by 5
- 2024Multi-Dimensional Pruning: Joint Channel, Layer and Block Pruning with Latency Constraintcited by 4
- 2025MDP: Multidimensional Vision Model Pruning with Latency Constraintcited by 4
- 2025Advancing Weight and Channel Sparsification with Enhanced Saliencycited by 1
- 2025MDP: Multidimensional Vision Model Pruning with Latency Constraint2 Apr 2025
- 2025Advancing Weight and Channel Sparsification with Enhanced Saliency5 Feb 2025
- 2024Multi-Dimensional Pruning: Joint Channel, Layer and Block Pruning with Latency Constraint17 Jun 2024
- 2023Magnitude Attention-based Dynamic Pruning8 Jun 2023