Log In Sign Up

Lifted Variable Elimination: Decoupling the Operators from the Constraint Language

by   Nima Taghipour, et al.

Lifted probabilistic inference algorithms exploit regularities in the structure of graphical models to perform inference more efficiently. More specifically, they identify groups of interchangeable variables and perform inference once per group, as opposed to once per variable. The groups are defined by means of constraints, so the flexibility of the grouping is determined by the expressivity of the constraint language. Existing approaches for exact lifted inference use specific languages for (in)equality constraints, which often have limited expressivity. In this article, we decouple lifted inference from the constraint language. We define operators for lifted inference in terms of relational algebra operators, so that they operate on the semantic level (the constraints extension) rather than on the syntactic level, making them language-independent. As a result, lifted inference can be performed using more powerful constraint languages, which provide more opportunities for lifting. We empirically demonstrate that this can improve inference efficiency by orders of magnitude, allowing exact inference where until now only approximate inference was feasible.


page 1

page 2

page 3

page 4


Exact and approximate inference in graphical models: variable elimination and beyond

Probabilistic graphical models offer a powerful framework to account for...

Constraint Processing in Lifted Probabilistic Inference

First-order probabilistic models combine representational power of first...

Tensor Variable Elimination for Plated Factor Graphs

A wide class of machine learning algorithms can be reduced to variable e...

A Concise Function Representation for Faster Exact MPE and Constrained Optimisation in Graphical Models

We propose a novel concise function representation for graphical models,...

Extended Lifted Inference with Joint Formulas

The First-Order Variable Elimination (FOVE) algorithm allows exact infer...

Exploring Unknown Universes in Probabilistic Relational Models

Large probabilistic models are often shaped by a pool of known individua...