Channel Pruning for Accelerating DNN

Approach

Given a trained CNN model, we propose an iterative two-step algorithm to effectively prune each layer, by a LASSO regression based channel selection and least square reconstruction. We alternatively take two steps. Further, we approximate the network layer-by-layer, with accumulated error accounted.

Formally, to prune a feature map with c channels, we consider applying n×c×k_h×k_w convolutional filters W on N×c×k_h×k_w input volumes X sampled from this feature map, which produces N×n output matrix Y. Here, N is the number of samples, n is the number of output channels.

To prune the input channels from c to desired c0 , while minimizing reconstruction error, we formulate our problem as follow:


Now we solve this problem in two folds. First, we fix W, solve for channel selection. Second, we fix Β, solve W to reconstruct error.


We alternatively optimize (i) and (ii). In the beginning, W is initialized from the trained model, λ= 0, namely no penalty, and ||B|| = c. We gradually increase λ. For each change of λ, we iterate these two steps until ||B|| is stable.

Experiment

References:
Channel Pruning for Accelerating Very Deep Neural Networks, Yihui He, 2017, ICCV

最后编辑于
©著作权归作者所有,转载或内容合作请联系作者
【社区内容提示】社区部分内容疑似由AI辅助生成,浏览时请结合常识与多方信息审慎甄别。
平台声明:文章内容(如有图片或视频亦包括在内)由作者上传并发布,文章内容仅代表作者本人观点,简书系信息发布平台,仅提供信息存储服务。

相关阅读更多精彩内容

友情链接更多精彩内容