pith. sign in

arxiv: 1906.02535 · v1 · pith:TNOOF7K3new · submitted 2019-06-06 · 💻 cs.LG · stat.ML

(Pen-) Ultimate DNN Pruning

classification 💻 cs.LG stat.ML
keywords pruningschemewithoutableaccuracyanalysisautomaticallycomponent
0
0 comments X
read the original abstract

DNN pruning reduces memory footprint and computational work of DNN-based solutions to improve performance and energy-efficiency. An effective pruning scheme should be able to systematically remove connections and/or neurons that are unnecessary or redundant, reducing the DNN size without any loss in accuracy. In this paper we show that prior pruning schemes require an extremely time-consuming iterative process that requires retraining the DNN many times to tune the pruning hyperparameters. We propose a DNN pruning scheme based on Principal Component Analysis and relative importance of each neuron's connection that automatically finds the optimized DNN in one shot without requiring hand-tuning of multiple parameters.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.