2 citations · 2 across the 21 of their papers we have counts for
22 papers
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…
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…
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…
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…
Denoising the Future: Top-p Distributions for Moving Through Time
Florian Andreas Marwitz, Ralf Möller, Magnus Bender +1
Inference in dynamic probabilistic models is a complex task involving expensive operations. In particular, for Hidden Markov Models, the whole state space has to be enumerated for…
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…
Lifted Forward Planning in Relational Factored Markov Decision Processes with Concurrent Actions
Florian Andreas Marwitz, Tanya Braun, Ralf Möller +1
When allowing concurrent actions in Markov Decision Processes, whose state and action spaces grow exponentially in the number of objects, computing a policy becomes highly ineffici…
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…
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…
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…
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…
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…
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…
Enhancement of Subjective Content Descriptions by using Human Feedback
Magnus Bender, Tanya Braun, Ralf Möller +1
An agent providing an information retrieval service may work with a corpus of text documents. The documents in the corpus may contain annotations such as Subjective Content Descrip…
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…
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…
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,…
DPM: Clustering Sensitive Data through Separation
Johannes Liebenow, Yara Schütt, Tanya Braun +3
Clustering is an important tool for data exploration where the goal is to subdivide a data set into disjoint clusters that fit well into the underlying data structure. When dealing…
On the Completeness and Complexity of the Lifted Dynamic Junction Tree Algorithm
Marcel Gehrke
For static lifted inference algorithms, completeness, i.e., domain liftability, is extensively studied. However, so far no domain liftability results for temporal lifted inference…
Taming Reasoning in Temporal Probabilistic Relational Models
Marcel Gehrke, Ralf Möller, Tanya Braun
Evidence often grounds temporal probabilistic relational models over time, which makes reasoning infeasible. To counteract groundings over time and to keep reasoning polynomial by…
Answering Hindsight Queries with Lifted Dynamic Junction Trees
Marcel Gehrke, Tanya Braun, Ralf Möller
The lifted dynamic junction tree algorithm (LDJT) efficiently answers filtering and prediction queries for probabilistic relational temporal models by building and then reusing a f…
Preventing Unnecessary Groundings in the Lifted Dynamic Junction Tree Algorithm
Marcel Gehrke, Tanya Braun, Ralf Möller
The lifted dynamic junction tree algorithm (LDJT) efficiently answers filtering and prediction queries for probabilistic relational temporal models by building and then reusing a f…