计算机科学
卷积神经网络
人工智能
推论
修剪
反向传播
分类器(UML)
机器学习
模式识别(心理学)
人工神经网络
农学
生物
作者
Pavlo Molchanov,Stephen Tyree,Tero Karras,Timo Aila,Jan Kautz
出处
期刊:Cornell University - arXiv
日期:2016-01-01
被引量:1136
标识
DOI:10.48550/arxiv.1611.06440
摘要
We propose a new formulation for pruning convolutional kernels in neural networks to enable efficient inference. We interleave greedy criteria-based pruning with fine-tuning by backpropagation - a computationally efficient procedure that maintains good generalization in the pruned network. We propose a new criterion based on Taylor expansion that approximates the change in the cost function induced by pruning network parameters. We focus on transfer learning, where large pretrained networks are adapted to specialized tasks. The proposed criterion demonstrates superior performance compared to other criteria, e.g. the norm of kernel weights or feature map activation, for pruning large CNNs after adaptation to fine-grained classification tasks (Birds-200 and Flowers-102) relaying only on the first order gradient information. We also show that pruning can lead to more than 10x theoretical (5x practical) reduction in adapted 3D-convolutional filters with a small drop in accuracy in a recurrent gesture classifier. Finally, we show results for the large-scale ImageNet dataset to emphasize the flexibility of our approach.
科研通智能强力驱动
Strongly Powered by AbleSci AI