activity
20182026
most citedTaming Reasoning in Temporal Probabilistic Relational Models

2 citations · 2 across the 21 of their papers we have counts for

collaborators
Showing 2025Show all

5 papers · 1 filter

cs.LG2025

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…

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

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…

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…