English

Filter Grafting for Deep Neural Networks: Reason, Method, and Cultivation

Machine Learning 2021-01-18 v2 Artificial Intelligence

Abstract

Filter is the key component in modern convolutional neural networks (CNNs). However, since CNNs are usually over-parameterized, a pre-trained network always contain some invalid (unimportant) filters. These filters have relatively small l1l_{1} norm and contribute little to the output (\textbf{Reason}). While filter pruning removes these invalid filters for efficiency consideration, we tend to reactivate them to improve the representation capability of CNNs. In this paper, we introduce filter grafting (\textbf{Method}) to achieve this goal. The activation is processed by grafting external information (weights) into invalid filters. To better perform the grafting, we develop a novel criterion to measure the information of filters and an adaptive weighting strategy to balance the grafted information among networks. After the grafting operation, the network has fewer invalid filters compared with its initial state, enpowering the model with more representation capacity. Meanwhile, since grafting is operated reciprocally on all networks involved, we find that grafting may lose the information of valid filters when improving invalid filters. To gain a universal improvement on both valid and invalid filters, we compensate grafting with distillation (\textbf{Cultivation}) to overcome the drawback of grafting . Extensive experiments are performed on the classification and recognition tasks to show the superiority of our method. Code is available at \textcolor{black}{\emph{https://github.com/fxmeng/filter-grafting}}.

Keywords

Cite

@article{arxiv.2004.12311,
  title  = {Filter Grafting for Deep Neural Networks: Reason, Method, and Cultivation},
  author = {Hao Cheng and Fanxu Meng and Ke Li and Yuting Gao and Guangming Lu and Xing Sun and Rongrong Ji},
  journal= {arXiv preprint arXiv:2004.12311},
  year   = {2021}
}

Comments

arXiv admin note: substantial text overlap with arXiv:2001.05868

R2 v1 2026-06-23T15:06:06.074Z