An Integer Polynomial Programming Based Framework for Lifted MAP Inference

In this paper, we present a new approach for lifted MAP inference in Markov logic networks (MLNs). The key idea in our approach is to compactly encode the MAP inference problem as an Integer Polynomial Program (IPP) by schematically applying three lifted inference steps to the MLN: lifted decomposition, lifted conditioning, and partial grounding. Our IPP encoding is lifted in the sense that an integer assignment to a variable in the IPP may represent a truth-assignment to multiple indistinguishable ground atoms in the MLN. We show how to solve the IPP by first converting it to an Integer Linear Program (ILP) and then solving the latter using state-of-the-art ILP techniques. Experiments on several benchmark MLNs show that our new algorithm is substantially superior to ground inference and existing methods in terms of computational efficiency and solution quality.

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

[2]  Kristian Kersting,et al.  Efficient Lifting of MAP LP Relaxations Using k-Locality , 2014, AISTATS.

[3]  Pedro M. Domingos,et al.  Markov Logic: An Interface Layer for Artificial Intelligence , 2009, Markov Logic: An Interface Layer for Artificial Intelligence.

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

[5]  Lawrence J. Watters.  Letter to the Editor - Reduction of Integer Polynomial Programming Problems to Zero-One Linear Programming Problems , 1967, Oper. Res..

[6]  Christopher Ré,et al.  Tuffy: Scaling up Statistical Inference in Markov Logic Networks using an RDBMS , 2011, Proc. VLDB Endow..

[7]  Ronen I. Brafman,et al.  Exploiting Uniform Assignments in First-Order MPE , 2012, UAI.

[8]  Andrew McCallum,et al.  Introduction to Statistical Relational Learning , 2007 .

[9]  Bart Selman,et al.  Local search strategies for satisfiability testing , 1993, Cliques, Coloring, and Satisfiability.

[10]  Vibhav Gogate,et al.  Advances in Lifted Importance Sampling , 2012, AAAI.

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

[12]  Vibhav Gogate,et al.  On Lifting the Gibbs Sampling Algorithm , 2012, StarAI@UAI.

[13]  Sriraam Natarajan,et al.  Speeding Up Inference in Markov Logic Networks by Preprocessing to Reduce the Size of the Resulting Grounded Network , 2009, IJCAI.

[14]  Lawrence J. Watters,et al.  REDUCTION OF INTEGER POLYNOMIAL PROGRAMMING PROBLEMS TO ZERO-ONE LINEAR PROGRAMMING PROBLEMS , 2016 .

[15]  Fabian Hadiji,et al.  Reduce and Re-Lift: Bootstrapped Lifted Likelihood Maximization for MAP , 2013, AAAI.

[16]  Heiner Stuckenschmidt,et al.  RockIt: Exploiting Parallelism and Symmetry for MAP Inference in Statistical Relational Models , 2013, AAAI.

[17]  Hung Hai Bui,et al.  Automorphism Groups of Graphical Models and Lifted Variational Inference , 2012, UAI.

[18]  Luc De Raedt,et al.  Lifted Probabilistic Inference by First-Order Knowledge Compilation , 2011, IJCAI.

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

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

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

[22]  Guy Van den Broeck,et al.  Lifted Relax, Compensate and then Recover: From Approximate to Exact Lifted Probabilistic Inference , 2012, UAI.

[23]  Somdeb Sarkhel,et al.  Lifted MAP Inference for Markov Logic Networks , 2014, AISTATS.

[24]  Matthew Richardson,et al.  The Alchemy System for Statistical Relational AI: User Manual , 2007 .

[25]  Adnan Darwiche,et al.  Clone: Solving Weighted Max-SAT in a Reduced Search Space , 2007, Australian Conference on Artificial Intelligence.

[26]  Pedro M. Domingos,et al.  Probabilistic theorem proving , 2011, UAI.