Abstract
When Pearl’s algorithm for reasoning with singly connected Bayesian networks is applied to a network with loops, the algorithm is no longer guaranteed to result in exact probabilities. We identify the two types of error that can arise in the probabilities yielded by the algorithm: the cycling error and the convergence error. We then focus on the cycling error and analyse its effect on the decisiveness of the approximations that are computed for the inner nodes of simple loops. More specifically, we detail the factors that induce the cycling error to push the exact probabilities towards over- or underconfident approximations.
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
J. Pearl. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann Publishers, Palo Alto, 1988
G.F. Cooper. The computational complexity of probabilistic inference using Bayesian belief networks. Artificial Intelligence, 42, 393–405, 1990
P. Dagum, M. Luby. Approximate inference in Bayesian networks is NP hard. Artificial Intelligence, 60, 141–153, 1993
K. Murphy, Y. Weiss, M. Jordan. Loopy belief propagation for approximate inference: an empirical study. In K.B. Laskey, H. Prade (editors) Proceedings of the Fifteenth Conference on Uncertainty in Artificial Intelligence. Morgan Kaufmann Publishers, San Francisco, 467–475, 1999
B.J. Frey. Bayesian Networks for Pattern Classification, Data Compression and Channel Coding. MIT Press, 1998
D. Mackay, R.M. Neal. Good codes based on very sparse matrices. In C. Boyd (editor) Cryptography and Coding: 5th SIAM Conference. Lecture Notes in Computer Science, Springer-Verlag, 1025, 100–111, 1995
Y. Weiss. Interpreting images by propagating Bayesian beliefs. In M.C. Mozer, M.I. Jordan, T. Petsche (editors) Advances in Neural Information Processing Systems, 9, 908–915, 1997
Y. Weiss. Correctness of local probability propagation in graphical models with loops. Neural Computation, 12, 1–41, 2000
Y. Weiss, W.T. Freeman. Correctness of belief propagation in Gaussian graphical models of arbitrary topology. Neural Computation, 13, 2173–2200, 2001
J.H. Bolt, L.C. van der Gaag. The convergence error in loopy propagation. Paper presented at the International Conference on Advances in Intelligent Systems: Theory and Applications, in cooperation with the IEEE computer society, Luxembourg, 2004
G. Strang. Linear Algebra and Its Applications..Academic Press, 1980
M.P. Wellman. Fundamental concepts of qualitative probabilistic networks. Artificial Intelligence, 44, 257–303, 1990
M.P. Wellman, M. Henrion. Qualitative intercausal relations, or explaining "explaining away". In KR-91, Principles of Knowledge Representation and Reasoning: Proceedings of the Second International Conference. Morgan Kaufmann Publishers, Menlo Park, California, 535–546, 1991
M.J. Druzdzel. Probabilistic Reasoning in Decision Support Systems: From Computationto Common Sense. PhD thesis, Department of Engineering and Public Policy, Carnegie Mellon University, Pittsburgh, Pennsylvania, 1993
M.J. Druzdzel, M. Henrion. Efficient reasoning in qualitative probabilistic networks. In Proceedings of the Eleventh National Conference on Artificial Intelligence. AAAI Press, Menlo Park, California, 548–553, 1993
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Bolt, J.H., van der Gaag, L.C. (2007). Decisiveness in Loopy Propagation. In: Lucas, P., Gámez, J.A., Salmerón, A. (eds) Advances in Probabilistic Graphical Models. Studies in Fuzziness and Soft Computing, vol 213. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68996-6_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-68996-6_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68994-2
Online ISBN: 978-3-540-68996-6
eBook Packages: EngineeringEngineering (R0)