跳到主要导航 跳到搜索 跳到主要内容

Toward Compact ConvNets via Structure-Sparsity Regularized Filter Pruning

  • Shaohui Lin
  • , Rongrong Ji*
  • , Yuchao Li
  • , Cheng Deng
  • , Xuelong Li
  • *此作品的通讯作者
  • Xiamen University
  • Peng Cheng Laboratory
  • Xidian University
  • Northwestern Polytechnical University Xian

科研成果: 期刊稿件文章同行评审

摘要

The success of convolutional neural networks (CNNs) in computer vision applications has been accompanied by a significant increase of computation and memory costs, which prohibits their usage on resource-limited environments, such as mobile systems or embedded devices. To this end, the research of CNN compression has recently become emerging. In this paper, we propose a novel filter pruning scheme, termed structured sparsity regularization (SSR), to simultaneously speed up the computation and reduce the memory overhead of CNNs, which can be well supported by various off-the-shelf deep learning libraries. Concretely, the proposed scheme incorporates two different regularizers of structured sparsity into the original objective function of filter pruning, which fully coordinates the global output and local pruning operations to adaptively prune filters. We further propose an alternative updating with Lagrange multipliers (AULM) scheme to efficiently solve its optimization. AULM follows the principle of alternating direction method of multipliers (ADMM) and alternates between promoting the structured sparsity of CNNs and optimizing the recognition loss, which leads to a very efficient solver ( 2.5\times to the most recent work that directly solves the group sparsity-based regularization). Moreover, by imposing the structured sparsity, the online inference is extremely memory-light since the number of filters and the output feature maps are simultaneously reduced. The proposed scheme has been deployed to a variety of state-of-the-art CNN structures, including LeNet, AlexNet, VGGNet, ResNet, and GoogLeNet, over different data sets. Quantitative results demonstrate that the proposed scheme achieves superior performance over the state-of-the-art methods. We further demonstrate the proposed compression scheme for the task of transfer learning, including domain adaptation and object detection, which also show exciting performance gains over the state-of-the-art filter pruning methods.

源语言英语
文章编号8689357
页(从-至)574-588
页数15
期刊IEEE Transactions on Neural Networks and Learning Systems
31
2
DOI
出版状态已出版 - 2月 2020
已对外发布

指纹

探究 'Toward Compact ConvNets via Structure-Sparsity Regularized Filter Pruning' 的科研主题。它们共同构成独一无二的指纹。

引用此