A BP-Based Algorithm for Performing Bayesian Inference in Large Perceptron-Type Networks
Abstract
Although the Bayesian approach provides optimal performance for many inference problems, the computation cost is sometimes impractical. We herein develop a practical algorithm by which to approximate Bayesian inference in large single-layer feed-forward networks (perceptrons) based on belief propagation (BP). Although direct application of BP to the inference problem remains computationally difficult, by introducing methods and concepts from statistical mechanics that are related to the central limit theorem and the law of large numbers, the proposed BP-based algorithm exhibits nearly optimal performance in a practical time scale for ideal large networks. In order to demonstrate the practical significance of the proposed algorithm, an application to a problem that arises in a mobile communications system is also presented.
Cite
Text
Kabashima and Uda. "A BP-Based Algorithm for Performing Bayesian Inference in Large Perceptron-Type Networks." International Conference on Algorithmic Learning Theory, 2004. doi:10.1007/978-3-540-30215-5_36Markdown
[Kabashima and Uda. "A BP-Based Algorithm for Performing Bayesian Inference in Large Perceptron-Type Networks." International Conference on Algorithmic Learning Theory, 2004.](https://mlanthology.org/alt/2004/kabashima2004alt-bpbased/) doi:10.1007/978-3-540-30215-5_36BibTeX
@inproceedings{kabashima2004alt-bpbased,
title = {{A BP-Based Algorithm for Performing Bayesian Inference in Large Perceptron-Type Networks}},
author = {Kabashima, Yoshiyuki and Uda, Shinsuke},
booktitle = {International Conference on Algorithmic Learning Theory},
year = {2004},
pages = {479-493},
doi = {10.1007/978-3-540-30215-5_36},
url = {https://mlanthology.org/alt/2004/kabashima2004alt-bpbased/}
}