MLMalte Luttermann

Malte Luttermann

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Malte Luttermann has a total of 7 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Lifting Factor Graphs with Some Unknown Factors for New Individuals

    by Malte Luttermann, Ralf Möller, Marcel Gehrke

    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.

  • Open Access

    Lifted Model Construction without Normalisation: A Vectorised Approach to Exploit Symmetries in Factor Graphs

    by Malte Luttermann, Ralf Möller, Marcel Gehrke

    Lifted probabilistic inference exploits symmetries in a probabilistic model to allow for tractable probabilistic inference with respect to domain sizes of logical variables. We found that the current state-of-the-art algorithm to construct a lifted representation in form of a parametric factor graph misses symmetries between factors that are exchangeable but scaled differently, thereby leading to a less compact representation. In this paper, we propose a generalisation of the advanced colour passing (ACP) algorithm, which is the state of the art to construct a parametric factor graph. Our proposed algorithm allows for potentials of factors to be scaled arbitrarily and efficiently detects more symmetries than the original ACP algorithm. By detecting strictly more symmetries than ACP, our algorithm significantly reduces online query times for probabilistic inference when the resulting model is applied, which we also confirm in our experiments.

  • Estimating Causal Effects in Partially Directed Parametric Causal Factor Graphs

    by Malte Luttermann, Tanya Braun, Ralf Möller, Marcel Gehrke


  • Open Access

    Estimating Causal Effects in Partially Directed Parametric Causal Factor Graphs

    by Malte Luttermann, Tanya Braun, Ralf Möller, Marcel Gehrke

    Lifting uses a representative of indistinguishable individuals to exploit symmetries in probabilistic relational models, denoted as parametric factor graphs, to speed up inference while maintaining exact answers. In this paper, we show how lifting can be applied to causal inference in partially directed graphs, i.e., graphs that contain both directed and undirected edges to represent causal relationships between random variables. We present partially directed parametric causal factor graphs (PPCFGs) as a generalisation of previously introduced parametric causal factor graphs, which require a fully directed graph. We further show how causal inference can be performed on a lifted level in PPCFGs, thereby extending the applicability of lifted causal inference to a broader range of models requiring less prior knowledge about causal relationships.

  • Open Access

    Efficient Detection of Commutative Factors in Factor Graphs

    by Malte Luttermann, Johann Machemer, Marcel Gehrke

    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(2^n)$ 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.

  • Open Access

    AutoRAG: Grounding Text and Symbols

    by Tim Schulz, Malte Luttermann, Ralf Möller

    In safety critical domains such as the healthcare domain, systems for natural language question answering demand special correctness guarantees. Modeling problem domains formally allows for automatic transparent reasoning, but handling comprehensive formal models may quickly demand expert knowledge. Ultimately, we need a system which is as easily accessible as large language models while the correctness of its output should be checkable using trusted knowledge. Since words are ambiguous in general but concepts of a formal model are not, we propose to expand the vocabulary of a language model by concepts of a knowledge base: Motivated by retrieval-augmented generation, we introduce AutoRAG, which does not retrieve data from external sources, rather it perceives parts of the knowledge base from special vocabulary, trained by auto-encoding text and concepts. Our AutoRAG implementation for a use case in the field of nosocomial pneumonia describes concepts it associates with the input and can naturally provide a graphical depiction from the expert-made knowledge bas to allow for feasible text sanity checks.


  • Open Access

    Efficient Detection of Exchangeable Factors in Factor Graphs

    by Malte Luttermann, Johann Machemer, Marcel Gehrke

    To allow for tractable probabilistic inference with respect to domain sizes, lifted probabilistic inference exploits symmetries in probabilistic graphical models. However, checking whether two factors encode equivalent semantics and hence are exchangeable is computationally expensive. In this paper, we efficiently solve the problem of detecting exchangeable factors in a factor graph. In particular, we introduce the detection of exchangeable factors (DEFT) algorithm, which allows us to drastically reduce the computational effort for checking whether two factors are exchangeable in practice. While previous approaches iterate all $O(n!)$ permutations of a factor's argument list in the worst case (where $n$ is the number of arguments of the factor), we prove that DEFT efficiently identifies restrictions to drastically reduce the number of permutations and validate the efficiency of DEFT in our empirical evaluation.

  • Open Access

    Colour Passing Revisited: Lifted Model Construction with Commutative Factors

    by Malte Luttermann, Tanya Braun, Ralf Möller, Marcel Gehrke

    Lifted probabilistic inference exploits symmetries in a probabilistic model to allow for tractable probabilistic inference with respect to domain sizes. To apply lifted inference, a lifted representation has to be obtained, and to do so, the so-called colour passing algorithm is the state of the art. The colour passing algorithm, however, is bound to a specific inference algorithm and we found that it ignores commutativity of factors while constructing a lifted representation. We contribute a modified version of the colour passing algorithm that uses logical variables to construct a lifted representation independent of a specific inference algorithm while at the same time exploiting commutativity of factors during an offline-step. Our proposed algorithm efficiently detects more symmetries than the state of the art and thereby drastically increases compression, yielding significantly faster online query times for probabilistic inference when the resulting model is applied.


  • Open Access

    Colour Passing Revisited: Lifted Model Construction with Commutative Factors

    by Malte Luttermann, Tanya Braun, Ralf Möller, Marcel Gehrke

    Lifted probabilistic inference exploits symmetries in a probabilistic model to allow for tractable probabilistic inference with respect to domain sizes. To apply lifted inference, a lifted representation has to be obtained, and to do so, the so-called colour passing algorithm is the state of the art. The colour passing algorithm, however, is bound to a specific inference algorithm and we found that it ignores commutativity of factors while constructing a lifted representation. We contribute a modified version of the colour passing algorithm that uses logical variables to construct a lifted representation independent of a specific inference algorithm while at the same time exploiting commutativity of factors during an offline-step. Our proposed algorithm efficiently detects more symmetries than the state of the art and thereby drastically increases compression, yielding significantly faster online query times for probabilistic inference when the resulting model is applied.