Elimination-compensation pruning for fully-connected neural networks

TL;DR

This paper introduces a novel pruning method for fully-connected neural networks that compensates for weight removal by perturbing adjacent biases, improving sparsity without sacrificing performance.

Contribution

The work proposes a new pruning technique that considers bias perturbation for weight importance, enhancing network compression while maintaining accuracy.

Findings

The method outperforms popular pruning strategies in various scenarios.

Analytical expressions enable efficient importance computation.

Numerical experiments validate the approach's effectiveness.

Abstract

The unmatched ability of Deep Neural Networks in capturing complex patterns in large and noisy datasets is often associated with their large hypothesis space, and consequently to the vast amount of parameters that characterize model architectures. Pruning techniques affirmed themselves as valid tools to extract sparse representations of neural networks parameters, carefully balancing between compression and preservation of information. However, a fundamental assumption behind pruning is that expendable weights should have small impact on the error of the network, while highly important weights should tend to have a larger influence on the inference. We argue that this idea could be generalized; what if a weight is not simply removed but also compensated with a perturbation of the adjacent bias, which does not contribute to the network sparsity? Our work introduces a novel pruning method in which the importance measure of each weight is computed considering the output behavior after an optimal perturbation of its adjacent bias, efficiently computable by automatic differentiation. These perturbations can be then applied directly after the removal of each weight, independently of each other. After deriving analytical expressions for the aforementioned quantities, numerical experiments are conducted to benchmark this technique against some of the most popular pruning strategies, demonstrating an intrinsic efficiency of the proposed approach in very diverse machine learning scenarios. Finally, our findings are discussed and the theoretical implications of our results are presented.