Search Results for author: Malte Luttermann

Found 8 papers, 7 papers with code

Efficient Detection of Commutative Factors in Factor Graphs

1 code implementation23 Jul 2024 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.

Lifting Factor Graphs with Some Unknown Factors

1 code implementation3 Jun 2024 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.

Lifted Causal Inference in Relational Domains

1 code implementation15 Mar 2024 Malte Luttermann, Mattis Hartwig, Tanya Braun, Ralf Möller, Marcel Gehrke

Lifted inference exploits symmetries in probabilistic graphical models by using a representative for indistinguishable objects, thereby speeding up query answering while maintaining exact answers.

Causal Inference

Efficient Detection of Exchangeable Factors in Factor Graphs

1 code implementation15 Mar 2024 Malte Luttermann, Johann Machemer, Marcel Gehrke

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.

Colour Passing Revisited: Lifted Model Construction with Commutative Factors

1 code implementation20 Sep 2023 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.

Practical Algorithms for Orientations of Partially Directed Graphical Models

1 code implementation28 Feb 2023 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.

Causal Discovery

Efficient Enumeration of Markov Equivalent DAGs

1 code implementation28 Jan 2023 Marcel Wienöbst, Malte Luttermann, Max Bannach, Maciej Liśkiewicz

Enumerating the directed acyclic graphs (DAGs) of a Markov equivalence class (MEC) is an important primitive in causal analysis.

Cannot find the paper you are looking for? You can Submit a new open access paper.