1 code implementation • 23 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.
1 code implementation • 3 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.
no code implementations • 6 May 2024 • Malte Luttermann, Edgar Baake, Juljan Bouchagiar, Benjamin Gebel, Philipp Grüning, Dilini Manikwadura, Franziska Schollemann, Elisa Teifke, Philipp Rostalski, Ralf Möller
Failure mode and effects analysis (FMEA) is a systematic approach to identify and analyse potential failures and their effects in a system or process.
1 code implementation • 15 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.
1 code implementation • 15 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.
1 code implementation • 20 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.
1 code implementation • 28 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.
1 code implementation • 28 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.