Return
Self-supervised feature-gate coupling for dynamic network pruning
DOI:10.1016/j.patcog.2024.110594.png)
Abstract
En 中文
Gating modules have been widely explored in dynamic network pruning (DNP) to reduce the run-time computational cost of deep neural networks while keeping the features representative. 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 that consists of two steps carried out in an iterative self -supervised manner. In the first step, FGC utilizes the k -Nearest Neighbor algorithm in the feature space to explore instance neighborhood relationships, which are treated as self -supervisory signals. In the second step, FGC exploits contrastive self -supervised learning (CSL) to regularize gating modules, 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 state-of-the-art methods with a better accuracy -computation trade-off. Code is publicly available at github.com/smn2010/FGC-PR.
Keywords:
Contrastive self-supervised learning (CSL)
Dynamic network pruning (DNP)
Feature-gate coupling
Instance neighborhood relationship
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.6
Papers:
1.3W
Citations:
4.5W

