Self-supervised Feature-Gate Coupling for Dynamic Network Pruning
Not on the map. Why?
Abstract (arXiv)
Gating modules have been widely explored in dynamic network pruning to reduce the run-time computational cost of deep neural networks while preserving the representation of features. Despite the substantial progress, existing methods remain ignoring the consistency between feature and gate distributions, which may lead to distortion of gated features. In this paper, we propose a feature-gate coupling (FGC) approach aiming to align distributions of features and gates. FGC is a plug-and-play module, which consists of two steps carried out in an iterative self-supervised manner. In the first step, FGC utilizes the k-Nearest Neighbor method in the feature space to explore instance neighborhood relationships, which are treated as self-supervisory signals. In the second step, FGC exploits contrastive learning to regularize gating modules with generated self-supervisory signals, leading to the alignment of instance neighborhood relationships within the feature and gate spaces. Experimental results validate that the proposed FGC method improves the baseline approach with significant margins, outperforming the state-of-the-arts with better accuracy-computation trade-off. Code is publicly available.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 38 of its 50 references that are in the map. First posted on arXiv 29 Nov 2021.
Builds on
38 of 50 references.
References · 38
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2015Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networkscited by 9,617
- 2018Representation Learning with Contrastive Predictive Codingcited by 7,662
- 2019Momentum Contrast for Unsupervised Visual Representation Learningcited by 7,482
- 2016Feature Pyramid Networks for Object Detectioncited by 5,021
- 2018MobileNetV2: Inverted Residuals and Linear Bottleneckscited by 4,773
- 2016The Cityscapes Dataset for Semantic Urban Scene Understandingcited by 4,427
- 2016Wide Residual Networkscited by 3,057
- 2020Unsupervised Learning of Visual Features by Contrasting Cluster Assignmentscited by 2,845
- 2018UMAP: Uniform Manifold Approximation and Projection for Dimension Reductioncited by 2,841
- 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,708
- 2016Pyramid Scene Parsing Networkcited by 2,472
26 more
- 2018Unsupervised Feature Learning via Non-Parametric Instance-level Discriminationcited by 1,838
- 2019Contrastive Multiview Codingcited by 1,297
- 2018Filter Pruning via Geometric Median for Deep Convolutional Neural Networks Accelerationcited by 365
- 2018Soft Filter Pruning for Accelerating Deep Convolutional Neural Networkscited by 313
- 2020HRank: Filter Pruning using High-Rank Feature Mapcited by 291
- 2019Local Aggregation for Unsupervised Learning of Visual Embeddingscited by 204
- 2017BlockDrop: Dynamic Inference Paths in Residual Networkscited by 185
- 2021Free Lunch for Few-shot Learning: Distribution Calibrationcited by 165
- 2017Convolutional Networks with Adaptive Inference Graphscited by 147
- 2018Dynamic Channel Pruning: Feature Boosting and Suppressioncited by 129
- 2019Provable Filter Pruning for Efficient Neural Networkscited by 98
- 2019Dynamic Convolutions: Exploiting Spatial Sparsity for Faster Inferencecited by 91
- 2020ResRep: Lossless CNN Pruning via Decoupling Remembering and Forgettingcited by 85
- 2018Channel Gating Neural Networkscited by 80
- 2019Unsupervised Deep Learning by Neighbourhood Discoverycited by 78
- 2018AutoPruner: An End-to-End Trainable Filter Pruning Method for Efficient Deep Model Inferencecited by 77
- 2020Group Sparsity: The Hinge Between Filter Pruning and Decomposition for Network Compressioncited by 72
- 2017More is Less: A More Complicated Network with Less Inference Complexitycited by 66
- 2020DHP: Differentiable Meta Pruning via HyperNetworkscited by 57
- 2020Spatially Adaptive Inference with Stochastic Feature Sampling and Interpolationcited by 51
- 2020DSA: More Efficient Budgeted Pruning via Differentiable Sparsity Allocationcited by 47
- 2019Batch-Shaping for Learning Conditional Channel Gated Networkscited by 42
- 2021Fire Together Wire Together: A Dynamic Pruning Approach with Self-Supervised Mask Predictioncited by 24
- 2019Deep Elastic Networks with Model Selection for Multi-Task Learningcited by 20
- 2020Progressive Cluster Purification for Unsupervised Feature Learningcited by 8
- 2021Network Pruning via Resource Reallocationcited by 6
Built on by
Not cited yet.