Sie befinden Sich nicht im Netzwerk der Universität Paderborn. Der Zugriff auf elektronische Ressourcen ist gegebenenfalls nur via VPN oder Shibboleth (DFN-AAI) möglich. mehr Informationen...
Ergebnis 21 von 24407
2017 IEEE International Conference on Computer Vision (ICCV), 2017, p.2755-2763
2017

Details

Autor(en) / Beteiligte
Titel
Learning Efficient Convolutional Networks through Network Slimming
Ist Teil von
  • 2017 IEEE International Conference on Computer Vision (ICCV), 2017, p.2755-2763
Ort / Verlag
IEEE
Erscheinungsjahr
2017
Link zum Volltext
Quelle
IEEE Xplore
Beschreibungen/Notizen
  • The deployment of deep convolutional neural networks (CNNs) in many real world applications is largely hindered by their high computational cost. In this paper, we propose a novel learning scheme for CNNs to simultaneously 1) reduce the model size; 2) decrease the run-time memory footprint; and 3) lower the number of computing operations, without compromising accuracy. This is achieved by enforcing channel-level sparsity in the network in a simple but effective way. Different from many existing approaches, the proposed method directly applies to modern CNN architectures, introduces minimum overhead to the training process, and requires no special software/hardware accelerators for the resulting models. We call our approach network slimming, which takes wide and large networks as input models, but during training insignificant channels are automatically identified and pruned afterwards, yielding thin and compact models with comparable accuracy. We empirically demonstrate the effectiveness of our approach with several state-of-the-art CNN models, including VGGNet, ResNet and DenseNet, on various image classification datasets. For VGGNet, a multi-pass version of network slimming gives a 20× reduction in model size and a 5× reduction in computing operations.
Sprache
Englisch
Identifikatoren
eISSN: 2380-7504
DOI: 10.1109/ICCV.2017.298
Titel-ID: cdi_ieee_primary_8237560

Weiterführende Literatur

Empfehlungen zum selben Thema automatisch vorgeschlagen von bX