Sparsely-Connected Neural Networks: Towards Efficient VLSI Implementation of Deep Neural Networks
Not on the map. Why?
Abstract (arXiv)
Recently deep neural networks have received considerable attention due to their ability to extract and represent high-level abstractions in data sets. Deep neural networks such as fully-connected and convolutional neural networks have shown excellent performance on a wide range of recognition and classification tasks. However, their hardware implementations currently suffer from large silicon area and high power consumption due to the their high degree of complexity. The power/energy consumption of neural networks is dominated by memory accesses, the majority of which occur in fully-connected networks. In fact, they contain most of the deep neural network parameters. In this paper, we propose sparsely-connected networks, by showing that the number of connections in fully-connected networks can be reduced by up to 90% while improving the accuracy performance on three popular datasets (MNIST, CIFAR10 and SVHN). We then propose an efficient hardware architecture based on linear-feedback shift registers to reduce the memory requirements of the proposed sparsely-connected networks. The proposed architecture can save up to 90% of memory compared to the conventional implementations of fully-connected neural networks. Moreover, implementation results show up to 84% reduction in the energy consumption of a single neuron of the proposed sparsely-connected networks compared to a single neuron of fully-connected neural networks.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). First posted on arXiv 4 Nov 2016.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 1; 2023: 2; 2024: 0; 2025: 1.
6 papers.
- 2023Training Deep Boltzmann Networks with Sparse Ising Machinescited by 23
- 2021Deep learning via message passing algorithms based on belief propagationcited by 12
- 2022Boosting Robustness Verification of Semantic Feature Neighborhoodscited by 4
- 2021Learning Gradual Argumentation Frameworks using Genetic Algorithmscited by 0
- 2023D-Score: A Synapse-Inspired Approach for Filter Pruningcited by 0
- 2025A Topological Improvement of the Overall Performance of Sparse Evolutionary Training: Motif-Based Structural Optimization of Sparse MLPs Projectcited by 0
- 2025A Topological Improvement of the Overall Performance of Sparse Evolutionary Training: Motif-Based Structural Optimization of Sparse MLPs Project10 Jun 2025
- 2023D-Score: A Synapse-Inspired Approach for Filter Pruning8 Aug 2023
- 2023Training Deep Boltzmann Networks with Sparse Ising Machines19 Mar 2023
- 2022Boosting Robustness Verification of Semantic Feature Neighborhoods12 Sep 2022
- 2021Deep learning via message passing algorithms based on belief propagation27 Oct 2021
- 2021Learning Gradual Argumentation Frameworks using Genetic Algorithms25 Jun 2021