First-Order Decomposition Trees

06/04/2013
by   Nima Taghipour, et al.
0

Lifting attempts to speed up probabilistic inference by exploiting symmetries in the model. Exact lifted inference methods, like their propositional counterparts, work by recursively decomposing the model and the problem. In the propositional case, there exist formal structures, such as decomposition trees (dtrees), that represent such a decomposition and allow us to determine the complexity of inference a priori. However, there is currently no equivalent structure nor analogous complexity results for lifted inference. In this paper, we introduce FO-dtrees, which upgrade propositional dtrees to the first-order level. We show how these trees can characterize a lifted inference solution for a probabilistic logical model (in terms of a sequence of lifted operations), and make a theoretical analysis of the complexity of lifted inference in terms of the novel notion of lifted width for the tree.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/06/2013

Incremental Probabilistic Inference

Propositional representation services such as truth maintenance systems ...
research
08/07/2019

A Constraint Model for the Tree Decomposition of a Graph

We present a constraint model for the problem of producing a tree decomp...
research
03/18/2018

Cubical Assemblies and Independence of the Propositional Resizing Axiom

We construct a model of cubical type theory with a univalent and impredi...
research
03/18/2018

Cubical Assemblies and the Independence of the Propositional Resizing Axiom

We construct a model of cubical type theory with a univalent and impredi...
research
04/15/2012

Lower Complexity Bounds for Lifted Inference

One of the big challenges in the development of probabilistic relational...
research
04/05/2015

Dual Decomposition from the Perspective of Relax, Compensate and then Recover

Relax, Compensate and then Recover (RCR) is a paradigm for approximate i...
research
08/19/2012

Lifted Variable Elimination: A Novel Operator and Completeness Results

Various methods for lifted probabilistic inference have been proposed, b...

Please sign up or login with your details

Forgot password? Click here to reset