Lifting Factor Graphs with Some Unknown Factors for New Individuals
Not on the map. Why?
Abstract (arXiv)
Lifting exploits symmetries in probabilistic graphical models by using a representative for indistinguishable objects, allowing to carry out query answering more efficiently while maintaining exact answers. In this paper, we investigate how lifting enables us to perform probabilistic inference for factor graphs containing unknown factors, i.e., factors whose underlying function of potential mappings is unknown. We present the Lifting Factor Graphs with Some Unknown Factors (LIFAGU) algorithm to identify indistinguishable subgraphs in a factor graph containing unknown factors, thereby enabling the transfer of known potentials to unknown potentials to ensure a well-defined semantics of the model and allow for (lifted) probabilistic inference. We further extend LIFAGU to incorporate additional background knowledge about groups of factors belonging to the same individual object. By incorporating such background knowledge, LIFAGU is able to further reduce the ambiguity of possible transfers of known potentials to unknown potentials.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 7 of its 23 references that are in the map. First posted on arXiv 5 Apr 2025.
Builds on
7 of 23 references.
References · 7
- 2014Tractability through Exchangeability: A New Perspective on Efficient Probabilistic Inferencecited by 23
- 2014Lifted Variable Elimination: Decoupling the Operators from the Constraint Languagecited by 19
- 2023Colour Passing Revisited: Lifted Model Construction with Commutative Factorscited by 11
- 2019Taming Reasoning in Temporal Probabilistic Relational Modelscited by 7
- 2024Efficient Detection of Exchangeable Factors in Factor Graphscited by 7
- 2024Lifted Causal Inference in Relational Domainscited by 7
- 2024Efficient Detection of Commutative Factors in Factor Graphscited by 6
Built on by
Not cited yet.