activity
20232026
collaborators

18 papers

cs.AI2026

Lifted Model Construction under Approximate Commutativity

Malte Luttermann, Jan Speller, Tanya Braun +2

Lifted inference algorithms enable scalable probabilistic inference even for large object domains by leveraging the indistinguishability of objects in a probability distribution. A…

cs.AI2026

Lifted Causal Inference

Malte Luttermann, Tanya Braun, Ralf Möller +1

Lifted inference exploits indistinguishabilities in probabilistic graphical models by using a representative for indistinguishable objects, thereby speeding up query answering whil…

cs.AI2026

Inducing Comparability of Factorised Probability Distributions

Jan Speller, Malte Luttermann, Marcel Gehrke +1

To allow for principled comparison between two probabilistic graphical models defined over non-identical variable sets, they have to be lifted to a common measurable space. To this…

cs.AI2026

On the Detection of Commutative Factors in Factor Graphs: Necessary and Sufficient Conditions

Malte Luttermann, Ralf Möller, Marcel Gehrke

Exploiting the indistinguishability of objects in a probabilistic graphical model such as a factor graph is key to lifted probabilistic inference algorithms and allows for tractabl…

cs.AI2025

Compression versus Accuracy: A Hierarchy of Lifted Models

Jan Speller, Malte Luttermann, Marcel Gehrke +1

Probabilistic graphical models that encode indistinguishable objects and relations among them use first-order logic constructs to compress a propositional factorised model for more…

cs.AI2025

Lifting Factor Graphs with Some Unknown Factors for New Individuals

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…

cs.AI2025

Approximate Lifted Model Construction

Malte Luttermann, Jan Speller, Marcel Gehrke +3

Probabilistic relational models such as parametric factor graphs enable efficient (lifted) inference by exploiting the indistinguishability of objects. In lifted inference, a repre…

cs.AI2024

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

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 fou…

cs.AI2024

Estimating Causal Effects in Partially Directed Parametric Causal Factor Graphs

Malte Luttermann, Tanya Braun, Ralf Möller +1

Lifting uses a representative of indistinguishable individuals to exploit symmetries in probabilistic relational models, denoted as parametric factor graphs, to speed up inference…

cs.AI2024

Towards Privacy-Preserving Relational Data Synthesis via Probabilistic Relational Models

Malte Luttermann, Ralf Möller, Mattis Hartwig

Probabilistic relational models provide a well-established formalism to combine first-order logic and probabilistic models, thereby allowing to represent relationships between obje…

cs.AI2024

Efficient Detection of Commutative Factors in Factor Graphs

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 symmetr…

cs.AI2024

Lifting Factor Graphs with Some Unknown Factors

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…

cs.AI2024

Automated Computation of Therapies Using Failure Mode and Effects Analysis in the Medical Domain

Malte Luttermann, Edgar Baake, Juljan Bouchagiar +7

Failure mode and effects analysis (FMEA) is a systematic approach to identify and analyse potential failures and their effects in a system or process. The FMEA approach, however, r…

cs.AI2024

Efficient Detection of Exchangeable Factors in Factor Graphs

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…

cs.AI2024

Lifted Causal Inference in Relational Domains

Malte Luttermann, Mattis Hartwig, Tanya Braun +2

Lifted inference exploits symmetries in probabilistic graphical models by using a representative for indistinguishable objects, thereby speeding up query answering while maintainin…

cs.AI2023

Colour Passing Revisited: Lifted Model Construction with Commutative Factors

Malte Luttermann, Tanya Braun, Ralf Möller +1

Lifted probabilistic inference exploits symmetries in a probabilistic model to allow for tractable probabilistic inference with respect to domain sizes. To apply lifted inference,…

cs.AI2023

Practical Algorithms for Orientations of Partially Directed Graphical Models

Malte Luttermann, Marcel Wienöbst, Maciej Liśkiewicz

In observational studies, the true causal model is typically unknown and needs to be estimated from available observational and limited experimental data. In such cases, the learne…

cs.AI2023

Efficient Enumeration of Markov Equivalent DAGs

Marcel Wienöbst, Malte Luttermann, Max Bannach +1

Enumerating the directed acyclic graphs (DAGs) of a Markov equivalence class (MEC) is an important primitive in causal analysis. The central resource from the perspective of comput…