Progressive Skeletonization: Trimming more fat from a network at initialization
Pau de Jorge, Amartya Sanyal, Harkirat S. Behl, Philip H.S. Torr,, Gregory Rogez, Puneet K. Dokania

TL;DR
This paper introduces a new method called FORCE for network skeletonization at initialization, enabling extremely high pruning levels (up to 99.5%) while maintaining trainability and performance, surpassing existing approaches especially at high sparsity.
Contribution
The paper proposes the FORCE objective and two approximation procedures that improve network pruning at initialization, allowing for higher sparsity levels without performance degradation.
Findings
FORCE achieves up to 99.5% pruning while preserving trainability.
Compared to existing methods, FORCE performs better at high sparsity levels.
Empirical results demonstrate the effectiveness of the proposed approach.
Abstract
Recent studies have shown that skeletonization (pruning parameters) of networks \textit{at initialization} provides all the practical benefits of sparsity both at inference and training time, while only marginally degrading their performance. However, we observe that beyond a certain level of sparsity (approx ), these approaches fail to preserve the network performance, and to our surprise, in many cases perform even worse than trivial random pruning. To this end, we propose an objective to find a skeletonized network with maximum {\em foresight connection sensitivity} (FORCE) whereby the trainability, in terms of connection sensitivity, of a pruned network is taken into consideration. We then propose two approximate procedures to maximize our objective (1) Iterative SNIP: allows parameters that were unimportant at earlier stages of skeletonization to become important at later…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
Taxonomy
TopicsAdvanced Neural Network Applications · Adversarial Robustness in Machine Learning · Domain Adaptation and Few-Shot Learning
MethodsPruning
