CVJun 18, 2019

A One-step Pruning-recovery Framework for Acceleration of Convolutional Neural Networks

arXiv:1906.07488v12 citations
Originality Incremental advance
AI Analysis

This work addresses the efficiency bottleneck in neural network pruning for researchers and practitioners in computer vision, offering a more streamlined approach, though it is incremental as it builds on existing filter pruning techniques.

The paper tackles the problem of accelerating convolutional neural networks by proposing a one-step pruning-recovery framework that reduces tedious layer-by-layer processes, achieving higher accuracy with less computational cost on VGG-16 and ResNet-50 using ImageNet, with less accuracy drop under the same or fewer FLOPs compared to state-of-the-art methods.

Acceleration of convolutional neural network has received increasing attention during the past several years. Among various acceleration techniques, filter pruning has its inherent merit by effectively reducing the number of convolution filters. However, most filter pruning methods resort to tedious and time-consuming layer-by-layer pruning-recovery strategy to avoid a significant drop of accuracy. In this paper, we present an efficient filter pruning framework to solve this problem. Our method accelerates the network in one-step pruning-recovery manner with a novel optimization objective function, which achieves higher accuracy with much less cost compared with existing pruning methods. Furthermore, our method allows network compression with global filter pruning. Given a global pruning rate, it can adaptively determine the pruning rate for each single convolutional layer, while these rates are often set as hyper-parameters in previous approaches. Evaluated on VGG-16 and ResNet-50 using ImageNet, our approach outperforms several state-of-the-art methods with less accuracy drop under the same and even much fewer floating-point operations (FLOPs).

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes