Alexander T Ihler, Natalia Flerova, Rina Dechter, and Lars Otten. Join-graph based cost-shifting schemes. In Uncertainty in Artificial Intelligence, 2012.
Kalev Kask, Bobak Pezeshki, Filjor Broka, Alexander Ihler, and Rina Dechter. Scaling up and/or abstraction sampling. In International Joint Conference on Artificial Intelligence, pages 4266-4274, 2020.
Craig Kelly, Somdeb Sarkhel, and Deepak Venugopal. Adaptive Rao-Blackwellisation in Gibbs sampling for probabilistic graphical models. In Artificial Intelligence and Statistics, pages 2907-2915. PMLR, 2019.
Uffe Kjaerulff. Reduction of computational complexity in Bayesian networks through removal of weak dependences. In Uncertainty in Artificial Intelligence, page 374-382, San Francisco, CA, USA, 1994.
Steffen L Lauritzen and David J Spiegelhalter. Local computations with probabilities on graphical structures and their application to expert systems. Journal of the Royal Statistical Society: Series B (Methodological), 50(2):157-194, 1988.
Peng Lin, Martin Neil, and Norman Fenton. Improved high dimensional discrete Bayesian network inference using triplet region construction. Journal of Artificial Intelligence Research, 69:231-295, 2020.
Qiang Liu and Alexander Ihler. Bounding the partition function using holder's inequality. In International Conference on Machine Learning, pages 849-856, 2011.
Qi Lou, Rina Dechter, and Alexander Ihler. Anytime anyspace and/or search for bounding the partition function. In AAAI Conference on Artificial Intelligence, volume 31, 2017a.
Qi Lou, Rina Dechter, and Alexander T Ihler. Dynamic importance sampling for anytime bounds of the partition function. Advances in Neural Information Processing Systems, 30, 2017b.
Qi Lou, Rina Dechter, and Alexander Ihler. Interleave variational optimization with Monte Carlo sampling: A tale of two approximate inference paradigms. In AAAI Conference on Artificial Intelligence, volume 33, pages 7900-7907, 2019.
Radu Marinescu. Merlin. https://github.com/radum2275/merlin/, 2016. Accessed: 2021-10-15.
Radu Marinescu, Junkyu Lee, Rina Dechter, and Alexander Ihler. AND/OR search for marginal map. Journal of Artificial Intelligence Research, 63:875-921, 2018.
Radu Marinescu, Akihiro Kishimoto, Adi Botea, Rina Dechter, and Alexander Ihler. Anytime recursive best-first search for bounding marginal map. In Proceedings of the AAAI Conference on Artificial Intelligence, pages 7924-7932, 2019.
Robert Mateescu, Kalev Kask, Vibhav Gogate, and Rina Dechter. Join-graph propagation algorithms. Journal of Artificial Intelligence Research, 37:279-328, 2010.
Joris M. Mooij. libDAI: A free and open source C++ library for discrete approximate inference in graphical models. Journal of Machine Learning Research, 11:2169-2173, August 2010.
Joris M. Mooij. libDAI - A free/open source C++ library for discrete approximate inference. https://github.com/dbtsai/libDAI/, 2012. Accessed: 2021-10-15.
Joris M. Mooij and Hilbert J. Kappen. Loop corrections for approximate inference on factor graphs. Journal of Machine Learning Research, 8(40):1113-1143, 2007.
Kevin P. Murphy, Yair Weiss, and Michael I. Jordan. Loopy belief propagation for approximate inference: An empirical study. In Uncertainty in Artificial Intelligence, pages 467-475, 1999.
Kevin Patrick Murphy. Dynamic Bayesian networks: Representation, inference and learning, dissertation. PhD thesis, UC Berkeley, Dept. Comp. Sci, 1, 2002.