TAILOR: InTer-feAture distinctIon fiLter fusiOn pRuning
Filter pruning is an effective method for reducing the size of convolutional neural networks without sacrificing performance. Most filter pruning methods prioritize filters with high information content, but fail to consider that filters with low information content might capture essential features....
Gespeichert in:
Veröffentlicht in: | Information sciences 2024-04, Vol.665, p.120229, Article 120229 |
---|---|
Hauptverfasser: | , , , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Filter pruning is an effective method for reducing the size of convolutional neural networks without sacrificing performance. Most filter pruning methods prioritize filters with high information content, but fail to consider that filters with low information content might capture essential features. Moreover, we have discovered that the distinctions among feature maps generated by filters can identify crucial features. Based on this insight, we propose a novel pruning method called inTer-feAture distinctIon fiLter fusiOn pRuning (TAILOR), which fuses the feature distinctions between filters. TAILOR randomly selects multiple filter sets within a convolutional layer and calculates the output feature maps of the next convolutional layer of these sets. Subsequently, an intelligent distinction optimization scheme is proposed to obtain the optimal filter set for filter pruning, which supplants the original convolutional layer. Experimental results indicated that the inter-feature distinctions among filters significantly affect filter pruning. TAILOR outperforms state-of-the-art filter-pruning methods in terms of model prediction accuracy, floating-point operations, and parameter scale. For instance, with VGG-16, TAILOR achieves a 73.89% FLOPs reduction by removing 91.85% of the parameters, while improving accuracy by 0.36% on the CIFAR-10. |
---|---|
ISSN: | 0020-0255 1872-6291 |
DOI: | 10.1016/j.ins.2024.120229 |