On the Complexity and Approximation of Binary Evidence in Lifted Inference

11/26/2013
by   Guy Van den Broeck, et al.
0

Lifted inference algorithms exploit symmetries in probabilistic models to speed up inference. They show impressive performance when calculating unconditional probabilities in relational models, but often resort to non-lifted inference when computing conditional probabilities. The reason is that conditioning on evidence breaks many of the model's symmetries, which can preempt standard lifting techniques. Recent theoretical results show, for example, that conditioning on evidence which corresponds to binary relations is #P-hard, suggesting that no lifting is to be expected in the worst case. In this paper, we balance this negative result by identifying the Boolean rank of the evidence as a key parameter for characterizing the complexity of conditioning in lifted inference. In particular, we show that conditioning on binary evidence with bounded Boolean rank is efficient. This opens up the possibility of approximating evidence by a low-rank Boolean matrix factorization, which we investigate both theoretically and empirically.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/30/2019

Property testing of the Boolean and binary rank

We present algorithms for testing if a (0,1)-matrix M has Boolean/binary...
research
12/18/2020

Factorizations of Binary Matrices – Rank Relations and the Uniqueness of Boolean Decompositions

The application of binary matrices are numerous. Representing a matrix a...
research
07/01/2019

The Trustworthy Pal: Controlling the False Discovery Rate in Boolean Matrix Factorization

Boolean matrix factorization (BMF) is a popular and powerful technique f...
research
03/06/2013

Inference with Possibilistic Evidence

In this paper, the concept of possibilistic evidence which is a possibil...
research
09/09/2019

MEBF: a fast and efficient Boolean matrix factorization method

Boolean matrix has been used to represent digital information in many fi...
research
01/16/2019

Soft Constraints for Inference with Declarative Knowledge

We develop a likelihood free inference procedure for conditioning a prob...
research
07/24/2017

Domain Recursion for Lifted Inference with Existential Quantifiers

In recent work, we proved that the domain recursion inference rule makes...

Please sign up or login with your details

Forgot password? Click here to reset