Name
Abstract | ||
|---|---|---|
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 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. |
Year | Venue | Field |
|---|---|---|
2017 | international conference on learning representations | Kernel (linear algebra),Pattern recognition,Convolutional neural network,Computer science,Principal variation search,Artificial intelligence,Pruning (decision trees),Backpropagation,Artificial neural network,Classifier (linguistics),Machine learning,Pruning |
DocType | Citations | PageRank |
Conference | 58 | 1.28 |
References | Authors | |
17 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pavlo O. Molchanov | 1 | 198 | 11.96 |
| Stephen Tyree | 2 | 548 | 38.32 |
| Tero Karras | 3 | 860 | 28.82 |
| Timo Aila | 4 | 1518 | 61.57 |
| Jan Kautz | 5 | 3615 | 198.77 |