Data-Independent Structured Pruning of Neural Networks via Coresets.

Journal: IEEE transactions on neural networks and learning systems
Published Date:

Abstract

Model compression is crucial for the deployment of neural networks on devices with limited computational and memory resources. Many different methods show comparable accuracy of the compressed model and similar compression rates. However, the majority of the compression methods are based on heuristics and offer no worst case guarantees on the tradeoff between the compression rate and the approximation error for an arbitrarily new sample. We propose the first efficient structured pruning algorithm with a provable tradeoff between its compression rate and the approximation error for any future test sample. Our method is based on the coreset framework, and it approximates the output of a layer of neurons/filters by a coreset of neurons/filters in the previous layer and discards the rest. We apply this framework in a layer-by-layer fashion from the bottom to the top. Unlike previous works, our coreset is data-independent, meaning that it provably guarantees the accuracy of the function for any input [Formula: see text], including an adversarial one.

Authors

  • Ben Mussay
  • Dan Feldman
    The Robotics and Big Data Lab, Department of Computer Science, University of Haifa, Haifa 3498838, Israel.
  • Samson Zhou
  • Vladimir Braverman
  • Margarita Osadchy
    Department of Computer Science, Jacobs Building, University of Haifa, 199 Aba Houshi Road, Mount Carmel, Haifa, Israel 3498838.