pith. sign in

arxiv: 1811.08390 · v2 · pith:CB4MYUJQnew · submitted 2018-11-20 · 💻 cs.CV · cs.LG

Structured Pruning for Efficient ConvNets via Incremental Regularization

classification 💻 cs.CV cs.LG
keywords pruningregularizationcnnsdifferenteffectivenessfactorsmethodsparameter
0
0 comments X
read the original abstract

Parameter pruning is a promising approach for CNN compression and acceleration by eliminating redundant model parameters with tolerable performance loss. Despite its effectiveness, existing regularization-based parameter pruning methods usually drive weights towards zero with large and constant regularization factors, which neglects the fact that the expressiveness of CNNs is fragile and needs a more gentle way of regularization for the networks to adapt during pruning. To solve this problem, we propose a new regularization-based pruning method (named IncReg) to incrementally assign different regularization factors to different weight groups based on their relative importance, whose effectiveness is proved on popular CNNs compared with state-of-the-art methods.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.