Lifting Factor Graphs with Some Unknown Factors
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 factors whose potentials are unknown. We introduce the Lifting Factor Graphs with Some Unknown Factors (LIFAGU) algorithm to identify symmetric subgraphs in a factor graph containing unknown factors, thereby enabling the transfer of known potentials to unknown potentials to ensure a well-defined semantics and allow for (lifted) probabilistic inference.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 6 of its 23 references that are in the map. First posted on arXiv 3 Jun 2024.
Builds on
6 of 23 references.
References · 6
- 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
Built on by
Citing papers per year: 2024: 1.
1 paper.