Abstract
Belief propagation (BP) algorithm has been becoming increasingly a popular method for probabilistic inference on general graphical models. When networks have loops, it may not converge and, even if converges, beliefs, i.e., the result of the algorithm, may not be equal to exact marginal probabilities. When networks have loops, the algorithm is called Loopy BP (LBP). Tatikonda and Jordan applied Gibbs measures theory to LBP algorithm and derived a sufficient convergence condition. In this paper, we utilize Gibbs measure theory to investigate the discrepancy between a marginal probability and the corresponding belief. Consequently, in particular, we obtain an error bound if the algorithm converges under a certain condition. It is a general result for the accuracy of the algorithm. We also perform numerical experiments to see the effectiveness of the result.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Frey, B.J.: Graphical Models for Pattern Classification, Data Compression and Channel Coding. MIT press, Cambridge (1998)
Georgii, H.-O.: Gibbs Measures and Phase Transitions. Walter de Gruyter, Berlin, New York (1988)
Jensen, F.: An Introduction to Bayesian Networks. UCL Press, London (1996)
McEliece, R.J., MacKay, D.J.C., Cheng, J.F.: Turbo Decoding as an Instance of Pearl’s “Belief Propagation” Algorithm. IEEE Journal on Selected Areas in Communication 16(2), 140–152 (1998)
Murphy, K.P., Weiss, Y., Jordan, M.I.: Loopy belief propagation for approximate inference: an empirical study. In: Proc. of the 15th Conf. on Unc. in Art. Int., pp. 467–475. Morgan Kaufmann, San Francisco (1999)
Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, San Francisco (1988)
Taga, N., Mase, S.: On the Convergence of Loopy Belief Propagation Algorithm for Different Update Rules. IEICE transactions on Fundamentals of Electronics, Communications and Computer Sciences E89-(2), 575–582 (2006)
Tatikonda, S.C., Jordan, M.I.: Loopy Belief Propagation and Gibbs Measures. In: Proc. of the 18th Conf. on Unc. in Art. Int., pp. 493–500. Morgan Kaufmann, San Francisco (2002)
Weiss, Y.: Correctness of Local Probability Propagation in Graphical Models with Loops. Neur. Comp. 12, 1–41 (2000)
Weiss, Y., Freeman, W.T.: Correctness of Belief Propagation in Gaussian Graphical Models of Arbitrary Topology. Neur. Comp. 12, 2173–2200 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Taga, N., Mase, S. (2006). Error Bounds Between Marginal Probabilities and Beliefs of Loopy Belief Propagation Algorithm. In: Gelbukh, A., Reyes-Garcia, C.A. (eds) MICAI 2006: Advances in Artificial Intelligence. MICAI 2006. Lecture Notes in Computer Science(), vol 4293. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11925231_18
Download citation
DOI: https://doi.org/10.1007/11925231_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-49026-5
Online ISBN: 978-3-540-49058-6
eBook Packages: Computer ScienceComputer Science (R0)