Eric-mingjie/rethinking-network-pruning 排名第 10,122，此处有 8 个同类条目；o19s/elasticsearch-learning-to-rank 排名第 10,106。

Rethinking the Value of Network Pruning This repository contains the code for reproducing the results, and trained ImageNet models, in the following paper: Rethinking the Value of Network Pruning. [[arXiv]]( [[OpenReview]]( Zhuang Liu\*, Mingjie Sun\*, Tinghui Zhou, Gao Huang, Trevor Darrell (\* equal contribution). Also Best Paper Award at NIPS 2018 Workshop on Compact Deep Neural Networks. Several pruning methods' implementations contained in this repo can also be readily used for other research purposes. Paper Summary Fig 1: A typical three

-stage network pruning pipeline. Our paper shows that for **structured** pruning, **training the pruned model from scratch can almost always achieve comparable or higher level of accuracy than the model obtained from the typical "training, pruning and fine-tuning" (Fig. We conclude that for those pruning methods: 1. Training a large, over-parameterized model is often not necessary to obtain an efficient final model. Learned “important” weights of the large model are typically not useful for the small pruned model

. The pruned architecture itself, rather than a set of inherited “important” weights, is more crucial to the efficiency in the final model, which suggests that in some cases pruning can be useful as an architecture search paradigm. Our results suggest the need for more careful baseline evaluations in future research on structured pruning methods. Fig 2: Difference between predefined and automatically discovered target architectures, in channel pruning. The pruning ratio x is user-specified, while a, b, c, d are

determined by the pruning algorithm. Unstructured sparse pruning can also be viewed as automatic. Our finding has different implications for predefined and automatic methods: for a predefined method, it is possible to skip the traditional "training, pruning and fine-tuning" pipeline and directly train the pruned model; for automatic methods, the pruning can be seen as a form of architecture learning. We also compare with the "Lottery Ticket Hypothesis" (Frankle & Carbin 2019), and find that with optimal learning rate, the

"winning ticket" initialization as used in Frankle & Carbin (2019) does not bring improvement over random initialization. For more details please refer to our paper. Implementation We evaluated the following seven pruning methods. Regression based feature reconstruction 4. Unstructured weight-level pruning The first six is structured while the last one is unstructured (or sparse). For CIFAR, our code is based on pytorch-classification and network-slimming. For ImageNet, we use the official Pytorch ImageNet training code. The instructions and models

are in each subfolder. For experiments on The Lottery Ticket Hypothesis, please refer to the folder cifar/lottery-ticket. Contact Feel free to discuss papers/code with us through issues/emails! com Citation If you use our code in your research, please cite: