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.
Advances in Neural Information Processing Systems
Sarkhel, S., Venugopal, D., Singla, P., & Gogate, V. (2014). An integer polynomial programming based framework for lifted MAP inference. Advances in Neural Information Processing Systems, 4 (January), 3302-3310. Retrieved from https://digitalcommons.memphis.edu/facpubs/2492