An adaptive binary particle swarm optimization for solving multi-objective convolutional filter pruning problem

In recent years, deep convolutional neural networks (DCNN) have evolved significantly in order to demonstrate remarkable performance in various computer vision tasks. However, their excess storage requirements and heavy computational burden restrict their scope of application, particularly on embedd...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:The Journal of supercomputing 2023-08, Vol.79 (12), p.13287-13306
Hauptverfasser: Sawant, Shrutika S., Erick, F. X., Göb, St, Holzer, Nina, Lang, Elmar W., Götz, Theresa
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In recent years, deep convolutional neural networks (DCNN) have evolved significantly in order to demonstrate remarkable performance in various computer vision tasks. However, their excess storage requirements and heavy computational burden restrict their scope of application, particularly on embedded platforms. This problem has motivated the research community to investigate effective approaches that can reduce computational burden without compromising its performance. Filter pruning is one of the popular ways to reduce the computational burden, where weak or unimportant convolutional filters are eliminated. In this paper, we propose a novel approach for filter pruning based on an adaptive multi-objective particle swarm optimization (AMPSO) to compress and accelerate DCNN. The proposed approach searches for an optimal solution while maintaining the trade-off between network’s performance and computational cost. Extensive experiments on TernausNet and U-Net for high-resolution aerial image segmentation tasks demonstrate the superiority of AMPSO in finding a compact network model.
ISSN:0920-8542
1573-0484
DOI:10.1007/s11227-023-05150-1