CVLGOct 4, 2018

SNIP: Single-shot Network Pruning based on Connection Sensitivity

arXiv:1810.02340v21461 citations
Originality Highly original
AI Analysis

This method reduces space and time complexity for neural networks by eliminating the need for pretraining and complex pruning schedules, making it broadly applicable across various architectures.

The paper tackles the problem of pruning large neural networks by introducing a single-shot pruning method at initialization based on connection sensitivity, achieving extremely sparse networks with virtually the same accuracy as the reference network on MNIST, CIFAR-10, and Tiny-ImageNet tasks.

Pruning large neural networks while maintaining their performance is often desirable due to the reduced space and time complexity. In existing methods, pruning is done within an iterative optimization procedure with either heuristically designed pruning schedules or additional hyperparameters, undermining their utility. In this work, we present a new approach that prunes a given network once at initialization prior to training. To achieve this, we introduce a saliency criterion based on connection sensitivity that identifies structurally important connections in the network for the given task. This eliminates the need for both pretraining and the complex pruning schedule while making it robust to architecture variations. After pruning, the sparse network is trained in the standard way. Our method obtains extremely sparse networks with virtually the same accuracy as the reference network on the MNIST, CIFAR-10, and Tiny-ImageNet classification tasks and is broadly applicable to various architectures including convolutional, residual and recurrent networks. Unlike existing methods, our approach enables us to demonstrate that the retained connections are indeed relevant to the given task.

Code Implementations8 repos

Data from Papers with Code (CC-BY-SA-4.0)

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes