1 citations · 1 across the 3 of their papers we have counts for
11 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…
A First Step Towards Even More Sparse Encodings of Probability Distributions
Florian Andreas Marwitz, Tanya Braun, Ralf Möller
Real world scenarios can be captured with lifted probability distributions. However, distributions are usually encoded in a table or list, requiring an exponential number of values…
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…
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…