Timezone: »

 
Poster
Fast Lifted MAP Inference via Partitioning
Somdeb Sarkhel · Parag Singla · Vibhav Gogate

Thu Dec 10 08:00 AM -- 12:00 PM (PST) @ 210 C #45
in Poster Session »

Recently, there has been growing interest in lifting MAP inference algorithms for Markov logic networks (MLNs). A key advantage of these lifted algorithms is that they have much smaller computational complexity than propositional algorithms when symmetries are present in the MLN and these symmetries can be detected using lifted inference rules. Unfortunately, lifted inference rules are sound but not complete and can often miss many symmetries. This is problematic because when symmetries cannot be exploited, lifted inference algorithms ground the MLN, and search for solutions in the much larger propositional space. In this paper, we present a novel approach, which cleverly introduces new symmetries at the time of grounding. Our main idea is to partition the ground atoms and force the inference algorithm to treat all atoms in each part as indistinguishable. We show that by systematically and carefully refining (and growing) the partitions, we can build advanced any-time and any-space MAP inference algorithms. Our experiments on several real-world datasets clearly show that our new algorithm is superior to previous approaches and often finds useful symmetries in the search space that existing lifted inference rules are unable to detect.

[ PDF] 

Author Information

Somdeb Sarkhel (University of Texas at Dallas)
Parag Singla (Indian Institute of Technology Delhi)
Vibhav Gogate (UT Dallas)

More from the Same Authors