Data-Independent Structured Pruning of Neural Networks via Coresets
By Ben Mussay, Dan Feldman, Samson Zhou, Vladimir Braverman, Margarita Osadchy. 2020
28 citations recorded by the source corpus.
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 $x\in \mathbb {R}^{d}$ , including an adversarial one.
Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition, Efficiency & Compression
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Simon Lacoste-Julien
- Marwa El Halabi
- Suraj Srinivas
- Peter Richtárik
- Francis R. Bach
- Fabian Pedregosa
- Martin Jaggi
- Gauthier Gidel
In Computer Vision and Pattern Recognition
- Simon Lacoste-Julien
- Marwa El Halabi
- Suraj Srinivas
- Peter Richtárik
- Ivan Laptev
- Jonathan Frankle
- Michael Carbin
- Gauthier Gidel
In Efficiency & Compression
Citations in the corpus
- Data-Efficient Structured Pruning via Submodular Optimization (2022, methodology): “Some works prune neurons/channels individually based on some importance score [He et al., 2014, Li et al., 2017, Liebenwein et al., 2020, Mussay et al., 2020, 2021, Molchanov et al., 2017, Srinivas and Babu, 2015].”
- A Survey on Deep Neural Network Pruning: Taxonomy, Comparison, Analysis, and Recommendations (2023, unknown): “Most of the existing pruning works ([46, 50, 71]) belong to data-driven methods, and only a few methods ([39, 60, 158, 159]) are data-free.”