Deep Network Regularization via Bayesian Inference of Synaptic Connectivity
Harris Partaourides, Sotirios P. Chatzis

TL;DR
This paper introduces a Bayesian inference-based regularization method for deep neural networks that automatically learns network sparsity, eliminating the need for heuristic dropout probabilities and improving generalization.
Contribution
It proposes a hierarchical Bayesian model with Bernoulli-Beta priors for synaptic connectivity, enabling heuristics-free regularization through marginalization.
Findings
Outperforms traditional dropout and DropConnect methods.
Automatically learns optimal network sparsity.
Demonstrates improved generalization on benchmark datasets.
Abstract
Deep neural networks (DNNs) often require good regularizers to generalize well. Currently, state-of-the-art DNN regularization techniques consist in randomly dropping units and/or connections on each iteration of the training algorithm. Dropout and DropConnect are characteristic examples of such regularizers, that are widely popular among practitioners. However, a drawback of such approaches consists in the fact that their postulated probability of random unit/connection omission is a constant that must be heuristically selected based on the obtained performance in some validation set. To alleviate this burden, in this paper we regard the DNN regularization problem from a Bayesian inference perspective: We impose a sparsity-inducing prior over the network synaptic weights, where the sparsity is induced by a set of Bernoulli-distributed binary variables with Beta (hyper-)priors over…
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
MethodsDropConnect · Dropout
