Deep learning via message passing algorithms based on belief propagation
arXiv:2110.14583 · doi:10.1088/2632-2153/ac7d3b
Abstract
Message-passing algorithms based on the Belief Propagation (BP) equations constitute a well-known distributed computational scheme. It is exact on tree-like graphical models and has also proven to be effective in many problems defined on graphs with loops (from inference to optimization, from signal processing to clustering). The BP-based scheme is fundamentally different from stochastic gradient descent (SGD), on which the current success of deep networks is based. In this paper, we present and adapt to mini-batch training on GPUs a family of BP-based message-passing algorithms with a reinforcement field that biases distributions towards locally entropic solutions. These algorithms are capable of training multi-layer neural networks with discrete weights and activations with performance comparable to SGD-inspired heuristics (BinaryNet) and are naturally well-adapted to continual learning. Furthermore, using these algorithms to estimate the marginals of the weights allows us to make approximate Bayesian predictions that have higher accuracy than point-wise solutions.
References in corpus (9)
- Expectation Propagation for approximate Bayesian inference
- Probabilistic Backpropagation for Scalable Learning of Bayesian Neural Networks
- Fantastic Generalization Measures and Where to Find Them
- Efficient supervised learning in networks with binary synapses
- Mean-field message-passing equations in the Hopfield model and its generalizations
- Sparsely-Connected Neural Networks: Towards Efficient VLSI Implementation of Deep Neural Networks
- How Do Adam and Training Strategies Help BNNs Optimization?
- Perturbative construction of mean-field equations in extensive-rank matrix factorization and denoising
- Belief Propagation Neural Networks
Cited by in corpus (5)
- Perturbative construction of mean-field equations in extensive-rank matrix factorization and denoising
- Phase transitions in the mini-batch size for sparse and dense two-layer neural networks
- FlatNAS: optimizing Flatness in Neural Architecture Search for Out-of-Distribution Robustness
- Architecture-Aware Minimization (AM): How to Find Flat Minima in Neural Architecture Search
- Training Multi-Layer Binary Neural Networks With Local Binary Error Signals