CVAIOct 25, 2020

Neuron Merging: Compensating for Pruned Neurons

arXiv:2010.13160v140 citationsHas Code
Originality Incremental advance
AI Analysis

This addresses the problem of maintaining model accuracy after pruning for efficient neural network deployment, though it is incremental as it builds on existing pruning techniques.

The paper tackles the accuracy loss in structured network pruning by proposing neuron merging, a method that compensates for pruned neurons without fine-tuning, achieving 93.16% accuracy on VGG-16 with CIFAR-10 while reducing 64% of parameters.

Network pruning is widely used to lighten and accelerate neural network models. Structured network pruning discards the whole neuron or filter, leading to accuracy loss. In this work, we propose a novel concept of neuron merging applicable to both fully connected layers and convolution layers, which compensates for the information loss due to the pruned neurons/filters. Neuron merging starts with decomposing the original weights into two matrices/tensors. One of them becomes the new weights for the current layer, and the other is what we name a scaling matrix, guiding the combination of neurons. If the activation function is ReLU, the scaling matrix can be absorbed into the next layer under certain conditions, compensating for the removed neurons. We also propose a data-free and inexpensive method to decompose the weights by utilizing the cosine similarity between neurons. Compared to the pruned model with the same topology, our merged model better preserves the output feature map of the original model; thus, it maintains the accuracy after pruning without fine-tuning. We demonstrate the effectiveness of our approach over network pruning for various model architectures and datasets. As an example, for VGG-16 on CIFAR-10, we achieve an accuracy of 93.16% while reducing 64% of total parameters, without any fine-tuning. The code can be found here: https://github.com/friendshipkim/neuron-merging

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes