Abstract
We look at probabilistic first-order formalisms where the domain objects are known. In these formalisms, the standard approach for inference is lifted variable elimination. To benefit from the advantages of the junction tree algorithm for inference in the first-order setting, we transfer the idea of lifting to the junction tree algorithm.
Our lifted junction tree algorithm aims at reducing computations by introducing first-order junction trees that compactly represent symmetries. First experiments show that we speed up the computation time compared to the propositional version. When querying for multiple marginals, the lifted junction tree algorithm performs better than using lifted VE to infer each marginal individually.
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
Similar content being viewed by others
References
Ahmadi, B., Kersting, K., Mladenov, M., Natarajan, S.: Exploiting symmetries for scaling loopy belief propagation and relational training. Mach. Learn. 92, 91–132 (2013). Kluwer Academic Publishers, Hingham
Braun, T.: Lifted junction tree algorithm. Technical report, Universität zu Lübeck (2016)
de Salvo Braz, R.: Lifted first-order probabilistic inference. Ph.D. thesis, University of Illinois at Urbana-Champaign (2007)
Van den Broeck, G.: Lifted inference and learning in statistical relational models. Ph.D. thesis, KU Leuven (2013)
Chavira, M., Darwiche, A.: Compiling bayesian networks using variable elimination. In: Proceedings of the 20th International Joint Conference on Artificial Intelligence. Morgan Kaufman, San Francisco (2007)
Darwiche, A.: Recursive Conditioning. Artif. Intell. 2, 4–41 (2001). Elsevier Science Publishers, Essex
Darwiche, A.: Modeling and Reasoning with Bayesian Networks. Cambridge University Press, Cambridge (2009)
Gogate, V., Domingos, P.: Exploiting logical structure in lifted probabilistic inference. In: Working Note of the Workshop on Statistical Relational Artificial Intelligence at the 24th Conference on Artificial Intelligence. The AAAI Press, Menlo Park (2010)
Jensen, F.V., Lauritzen, S.L., Oleson, K.G.: Bayesian updating in recursive graphical models by local computations. Comput. Stat. Q. 4, 269–282 (1990). Physica-Verlag, Vienna
Milch, B., Zettlemoyer, L.S., Kersting, K., Haimes, M., Pack Kaelbling, L.: Lifted probabilistic inference with counting formulas. In: Proceedings of the 23rd Conference on Artificial Intelligence, pp. 1062–1068. The AAAI Press, Menlo Park (2008)
Milch, B., Li, L.: Bayesian Logic Programming Language. https://bayesianlogic.github.io
Poole, D.: First-order probabilistic inference. In: Proceedings of the 18th International Joint Conference on Artificial Intelligence, pp. 985–991. Morgan Kaufman Publishers Inc., San Francisco (2003)
Shafer, G.R., Shenoy, P.P.: Probability propagation. Ann. Math. Artif. Intell. 2, 327–351 (1989). Springer, Heidelberg
Singla, P., Domingos, P.: Lifted first-order belief propagation. In: Proceedings of the 23rd Conference on Artificial Intelligence, pp. 1094–1099. The AAAI Press, Menlo Park (2008)
Singla, P., Nath, A., Domingos, P.: Approximate lifted belief propagation. In: Working Note of the Workshop on Statistical Relational Artificial Intelligence at the 24th Conference on Artificial Intelligence. The AAAI Press, Menlo Park (2010)
Singla, P., Nath, A., Domingos, P.: Approximate lifting techniques for belief propagation. In: Proceedings of the 28th Conference on Artificial Intelligence, pp. 2497–2504. The AAAI Press, Menlo Park (2014)
Taghipour, N.: Lifted probabilistic inference by variable elimination. Ph.D. thesis, KU Leuven (2013)
Taghipour, N.: GC-FOVE. https://dtai.cs.kuleuven.be/software/gcfove
Zhang, N.L., Poole, D.: A simple approach to bayesian network computations. In: Proceedings of the 10th Canadian Conference on Artificial Intelligence, pp. 171–178. Morgan Kaufman Publishers, San Francisco (1994)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this paper
Cite this paper
Braun, T., Möller, R. (2016). Lifted Junction Tree Algorithm. In: Friedrich, G., Helmert, M., Wotawa, F. (eds) KI 2016: Advances in Artificial Intelligence. KI 2016. Lecture Notes in Computer Science(), vol 9904. Springer, Cham. https://doi.org/10.1007/978-3-319-46073-4_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-46073-4_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-46072-7
Online ISBN: 978-3-319-46073-4
eBook Packages: Computer ScienceComputer Science (R0)