mlsanityData to 14 Oct 2026

Characterizing Sparse Connectivity Patterns in Neural Networks

arXiv 1711.02131 ↗First posted 6 Nov 2017cs.LG cs.CVcited by 2

Not on the map. Why?

Abstract (arXiv)

We propose a novel way of reducing the number of parameters in the storage-hungry fully connected layers of a neural network by using pre-defined sparsity, where the majority of connections are absent prior to starting training. Our results indicate that convolutional neural networks can operate without any loss of accuracy at less than half percent classification layer connection density, or less than 5 percent overall network connection density. We also investigate the effects of pre-defining the sparsity of networks with only fully connected layers. Based on our sparsifying technique, we introduce the `scatter' metric to characterize the quality of a particular connection pattern. As proof of concept, we show results on CIFAR, MNIST and a new dataset on classifying Morse code symbols, which highlights some interesting trends and limits of sparse connection patterns.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). First posted on arXiv 6 Nov 2017.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 2.

2 papers.