Lifting Factor Graphs with Some Unknown Factors for New Individuals

Abstract

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.

Resources for this Paper

Paper URL

BibTeX Citation

@article{Luttermann2025a,
    author    = {Malte Luttermann and Ralf Möller and Marcel Gehrke},
    title     = {{Lifting Factor Graphs with Some Unknown Factors for New Individuals}},
    journal   = {International Journal of Approximate Reasoning},
    volume    = {179},
    year      = {2025},
    pages     = {109371},
    publisher = {Elsevier},
}