Lifted Aggregation in Directed First-Order Probabilistic Models

As exact inference for first-order probabilistic graphical models at the propositional level can be formidably expensive, there is an ongoing effort to design efficient lifted inference algorithms for such models. This paper discusses directed first-order models that require an aggregation operator when a parent random variable is parameterized by logical variables that are not present in a child random variable. We introduce a new data structure, aggregation parfactors, to describe aggregation in directed first-order models. We show how to extend Milch et al.'s C-FOVE algorithm to perform lifted inference in the presence of aggregation parfactors. We also show that there are cases where the polynomial time complexity (in the domain size of logical variables) of the C-FOVE algorithm can be reduced to logarithmic time complexity using aggregation parfactors.

[1]  David Poole,et al.  The Independent Choice Logic and Beyond , 2008, Probabilistic Inductive Logic Programming.

[2]  Avi Pfeffer,et al.  Object-Oriented Bayesian Networks , 1997, UAI.

[3]  Wray L. Buntine.  Operations for Learning with Graphical Models , 1994, J. Artif. Intell. Res..

[4]  Jirí Vomlel,et al.  Exploiting tensor rank-one decomposition in probabilistic inference , 2007, Kybernetika.

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

[6]  Peter Carbonetto,et al.  Learning a contingently acyclic, probabilistic relational model of a social network , 2009 .

[7]  Avi Pfeffer,et al.  Semantics and Inference for Recursive Probability Models , 2000, AAAI/IAAI.

[8]  John S. Breese,et al.  CONSTRUCTION OF BELIEF AND DECISION NETWORKS , 1992, Comput. Intell..

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

[10]  Rahul Gupta,et al.  Efficient inference with cardinality-based clique potentials , 2007, ICML '07.

[11]  Lise Getoor,et al.  Bisimulation-based Approximate Lifted Inference , 2009, UAI.

[12]  Judea Pearl,et al.  Fusion, Propagation, and Structuring in Belief Networks , 1986, Artif. Intell..

[13]  Francisco Javier Díez,et al.  Efficient computation for the noisy MAX , 2003, Int. J. Intell. Syst..

[14]  Francisco Javier Díez,et al.  Parameter adjustment in Bayes networks. The generalized noisy OR-gate , 1993, UAI.

[15]  Ben Taskar,et al.  Introduction to Statistical Relational Learning (Adaptive Computation and Machine Learning) , 2007 .

[16]  David Poole,et al.  A Dynamic Approach to Probabilistic Inference using Bayesian Networks , 1990, UAI 1990.

[17]  Nevin L. Zhang,et al.  A simple approach to Bayesian network computations , 1994 .

[18]  Manfred Jaeger,et al.  Compiling relational Bayesian networks for exact inference , 2006, Int. J. Approx. Reason..

[19]  Nevin Lianwen Zhang,et al.  Exploiting Causal Independence in Bayesian Network Inference , 1996, J. Artif. Intell. Res..

[20]  Luc De Raedt,et al.  Probabilistic Inductive Logic Programming , 2004, Probabilistic Inductive Logic Programming.

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

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

[23]  Michael Michell.  Smoke Rings: social network analysis of friendship groups, smoking and drug-taking , 2000 .

[24]  Ben Taskar,et al.  Introduction to statistical relational learning , 2007 .