Self-supervised Feature-Gate Coupling for Dynamic Network Pruning
Mengnan Shi, Chang Liu, Jianbin Jiao, Qixiang Ye

TL;DR
This paper introduces a feature-gate coupling method for dynamic network pruning that aligns feature and gate distributions using self-supervised contrastive learning, improving accuracy and efficiency.
Contribution
It proposes a novel plug-and-play feature-gate coupling approach that enhances dynamic pruning by aligning feature and gate distributions through self-supervised learning.
Findings
Outperforms state-of-the-art methods in accuracy-computation trade-off
Improves baseline pruning approaches significantly
Uses self-supervised contrastive learning for distribution alignment
Abstract
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 -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…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDomain Adaptation and Few-Shot Learning · Advanced Neural Network Applications · Machine Learning and ELM
MethodsPruning · Contrastive Learning
