A BP-based algorithm for performing Bayesian inference in large perceptron-type networks

17Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2004.

Cite

CITATION STYLE

APA

Kabashima, Y., & Uda, S. (2004). A BP-based algorithm for performing Bayesian inference in large perceptron-type networks. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 3244, pp. 479–493). Springer Verlag. https://doi.org/10.1007/978-3-540-30215-5_36

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free