Exact Lifted Inference with Distinct Soft Evidence on Every Object

The presence of non-symmetric evidence has been a barrier for the application of lifted inference since the evidence destroys the symmetry of the first-order probabilistic model. In the extreme case, if distinct soft evidence is obtained about each individual object in the domain then, often, all current exact lifted inference methods reduce to traditional inference at the ground level. However, it is of interest to ask whether the symmetry of the model itself before evidence is obtained can be exploited. We present new results showing that this is, in fact, possible. In particular, we show that both exact maximum a posteriori (MAP) and marginal inference can be lifted for the case of distinct soft evidence on a unary Markov Logic predicate. Our methods result in efficient procedures for MAP and marginal inference for a class of graphical models previously thought to be intractable.

[1]  Dan Suciu,et al.  Lifted Inference Seen from the Other Side : The Tractable Features , 2010, NIPS.

[2]  David Poole,et al.  Probabilistic Horn Abduction and Bayesian Networks , 1993, Artif. Intell..

[3]  Matthew Richardson,et al.  Markov logic networks , 2006, Machine Learning.

[4]  Pedro M. Domingos,et al.  Lifted First-Order Belief Propagation , 2008, AAAI.

[5]  D. G. Mead Newton's Identities , 1992 .

[6]  Dan Roth,et al.  Lifted First-Order Probabilistic Inference , 2005, IJCAI.

[7]  Kristian Kersting,et al.  Counting Belief Propagation , 2009, UAI.

[8]  Leslie Pack Kaelbling,et al.  Lifted Probabilistic Inference with Counting Formulas , 2008, AAAI.

[9]  Joris M. Mooij,et al.  libDAI: A Free and Open Source C++ Library for Discrete Approximate Inference in Graphical Models , 2010, J. Mach. Learn. Res..

[10]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[11]  David Poole,et al.  First-order probabilistic inference , 2003, IJCAI.

[12]  Peter Haddawy,et al.  Probabilistic Logic Programming and Bayesian Networks , 1995, ASIAN.

[13]  Martin J. Wainwright,et al.  Tree-based reparameterization framework for analysis of sum-product and related algorithms , 2003, IEEE Trans. Inf. Theory.

[14]  Lise Getoor,et al.  Learning Probabilistic Relational Models , 1999, IJCAI.

[15]  Saso Dzeroski Relational Data Mining , 2005, Data Mining and Knowledge Discovery Handbook.

[16]  Fabian Hadiji,et al.  Informed Lifting for Message-Passing , 2010, AAAI.

[17]  B. Fine,et al.  The Fundamental Theorem of Algebra , 1997 .