Structured Bayesian Compression for Deep Neural Networks Based on The Turbo-VBI Approach
Chengyu Xia, Danny H.K. Tsang, Vincent K.N. Lau

TL;DR
This paper introduces a Bayesian compression method for deep neural networks that promotes regular sparse structures during pruning, leading to improved compression and accuracy.
Contribution
It proposes a novel three-layer hierarchical prior and an efficient Turbo-VBI algorithm for structured neural network pruning.
Findings
Promotes regular sparse structures in pruned networks.
Achieves better compression and accuracy than baseline methods.
Supports more general priors with low computational complexity.
Abstract
With the growth of neural network size, model compression has attracted increasing interest in recent research. As one of the most common techniques, pruning has been studied for a long time. By exploiting the structured sparsity of the neural network, existing methods can prune neurons instead of individual weights. However, in most existing pruning methods, surviving neurons are randomly connected in the neural network without any structure, and the non-zero weights within each neuron are also randomly distributed. Such irregular sparse structure can cause very high control overhead and irregular memory access for the hardware and even increase the neural network computational complexity. In this paper, we propose a three-layer hierarchical prior to promote a more regular sparse structure during pruning. The proposed three-layer hierarchical prior can achieve per-neuron weight-level…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Neural Network Applications · Domain Adaptation and Few-Shot Learning · Machine Learning and Data Classification
MethodsPruning
