Log In Sign Up

Answering Hindsight Queries with Lifted Dynamic Junction Trees

by   Marcel Gehrke, et al.

The lifted dynamic junction tree algorithm (LDJT) efficiently answers filtering and prediction queries for probabilistic relational temporal models by building and then reusing a first-order cluster representation of a knowledge base for multiple queries and time steps. We extend LDJT to (i) solve the smoothing inference problem to answer hindsight queries by introducing an efficient backward pass and (ii) discuss different options to instantiate a first-order cluster representation during a backward pass. Further, our relational forward backward algorithm makes hindsight queries to the very beginning feasible. LDJT answers multiple temporal queries faster than the static lifted junction tree algorithm on an unrolled model, which performs smoothing during message passing.


page 1

page 2

page 3

page 4


Preventing Unnecessary Groundings in the Lifted Dynamic Junction Tree Algorithm

The lifted dynamic junction tree algorithm (LDJT) efficiently answers fi...

A backward pass through a CNN using a generative model of its activations

Neural networks have shown to be a practical way of building a very comp...

Fusing First-order Knowledge Compilation and the Lifted Junction Tree Algorithm

Standard approaches for inference in probabilistic formalisms with first...

Optimised Maintenance of Datalog Materialisations

To efficiently answer queries, datalog systems often materialise all con...

Double Bayesian Smoothing as Message Passing

Recently, a novel method for developing filtering algorithms, based on t...

Taming Reasoning in Temporal Probabilistic Relational Models

Evidence often grounds temporal probabilistic relational models over tim...

Joint Target Detection, Tracking and Classification with Forward-Backward PHD Smoothing

Forward-backward Probability Hypothesis Density (PHD) smoothing is an ef...