Efficient Detection of Commutative Factors in Factor Graphs (2407.16280v1)
Abstract: Lifted probabilistic inference exploits symmetries in probabilistic graphical models to allow for tractable probabilistic inference with respect to domain sizes. To exploit symmetries in, e.g., factor graphs, it is crucial to identify commutative factors, i.e., factors having symmetries within themselves due to their arguments being exchangeable. The current state of the art to check whether a factor is commutative with respect to a subset of its arguments iterates over all possible subsets of the factor's arguments, i.e., $O(2n)$ iterations for a factor with $n$ arguments in the worst case. In this paper, we efficiently solve the problem of detecting commutative factors in a factor graph. In particular, we introduce the detection of commutative factors (DECOR) algorithm, which allows us to drastically reduce the computational effort for checking whether a factor is commutative in practice. We prove that DECOR efficiently identifies restrictions to drastically reduce the number of required iterations and validate the efficiency of DECOR in our empirical evaluation.
- Exploiting Symmetries for Scaling Loopy Belief Propagation and Relational Training. Machine Learning, 92:91–132, 2013.
- T. Braun and R. Möller. Parameterised Queries and Lifted Query Answering. In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (IJCAI-2018), pages 4980–4986. IJCAI Organization, 2018.
- Lifted First-Order Probabilistic Inference. In Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence (IJCAI-2005), pages 1319–1325. Morgan Kaufmann Publishers Inc., 2005.
- MPE and Partial Inversion in Lifted Probabilistic Variable Elimination. In Proceedings of the Twenty-First National Conference on Artificial Intelligence (AAAI-2006), pages 1123–1130. AAAI Press, 2006.
- Factor Graphs and Algorithms. In Proceedings of the Thirty-Fifth Annual Allerton Conference on Communication, Control, and Computing, pages 666–680. Allerton House, 1997.
- Counting Belief Propagation. In Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence (UAI-2009), pages 277–284. AUAI Press, 2009.
- J. Kisyński and D. Poole. Constraint Processing in Lifted Probabilistic Inference. In Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence (UAI-2009), pages 293–302. AUAI Press, 2009.
- Factor Graphs and the Sum-Product Algorithm. IEEE Transactions on Information Theory, 47:498–519, 2001.
- Colour Passing Revisited: Lifted Model Construction with Commutative Factors. In Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence (AAAI-2024), pages 20500–20507. AAAI Press, 2024a.
- Efficient Detection of Exchangeable Factors in Factor Graphs. In Proceedings of the Thirty-Seventh International Florida Artificial Intelligence Research Society Conference (FLAIRS-2024). Florida Online Journals, 2024b.
- Lifted Probabilistic Inference with Counting Formulas. In Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence (AAAI-2008), pages 1062–1068. AAAI Press, 2008.
- Tractability through Exchangeability: A New Perspective on Efficient Probabilistic Inference. In Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence (AAAI-2014), pages 2467–2475. AAAI Press, 2014.
- D. Poole. First-Order Probabilistic Inference. In Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence (IJCAI-2003), pages 985–991. Morgan Kaufmann Publishers Inc., 2003.
- P. Singla and P. Domingos. Lifted First-Order Belief Propagation. In Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence (AAAI-2008), pages 1094–1099. AAAI Press, 2008.
- Lifted Variable Elimination: Decoupling the Operators from the Constraint Language. Journal of Artificial Intelligence Research, 47:393–439, 2013.
- B. Weisfeiler and A. A. Leman. The Reduction of a Graph to Canonical Form and the Algebra which Appears Therein. NTI, Series, 2:12–16, 1968. English translation by Grigory Ryabov available at https://www.iti.zcu.cz/wl2018/pdf/wl_paper_translation.pdf.