Network Pruning via Transformable Architecture Search

NeurIPS 2019  ·  Xuanyi Dong, Yi Yang ·

Network pruning reduces the computation costs of an over-parameterized network without performance damage. Prevailing pruning algorithms pre-define the width and depth of the pruned networks, and then transfer parameters from the unpruned network to pruned networks. To break the structure limitation of the pruned networks, we propose to apply neural architecture search to search directly for a network with flexible channel and layer sizes. The number of the channels/layers is learned by minimizing the loss of the pruned networks. The feature map of the pruned network is an aggregation of K feature map fragments (generated by K networks of different sizes), which are sampled based on the probability distribution.The loss can be back-propagated not only to the network weights, but also to the parameterized distribution to explicitly tune the size of the channels/layers. Specifically, we apply channel-wise interpolation to keep the feature map with different channel sizes aligned in the aggregation procedure. The maximum probability for the size in each distribution serves as the width and depth of the pruned network, whose parameters are learned by knowledge transfer, e.g., knowledge distillation, from the original networks. Experiments on CIFAR-10, CIFAR-100 and ImageNet demonstrate the effectiveness of our new perspective of network pruning compared to traditional network pruning algorithms. Various searching and knowledge transfer approaches are conducted to show the effectiveness of the two components. Code is at:

PDF Abstract NeurIPS 2019 PDF NeurIPS 2019 Abstract

Results from the Paper

Task Dataset Model Metric Name Metric Value Global Rank Result Benchmark
Network Pruning CIFAR-10 TAS-pruned ResNet-110 Accuracy 94.33 # 1
GFLOPs 0.119 # 1
Network Pruning CIFAR-100 TAS-pruned ResNet-110 Accuracy 73.16 # 4
GFLOPs 0.12 # 1
Network Pruning ImageNet TAS-pruned ResNet-50 Accuracy 76.20 # 8
GFLOPs 2.3 # 4