Reduce and Re-Lift: Bootstrapped Lifted Likelihood Maximization for MAPFabian Hadiji; Kristian Kersting
In: Statistical Relational Artificial Intelligence, Papers from the 2013 AAAI Workshop. AAAI Conference on Artificial Intelligence (AAAI-2013), July 15, Bellevue, Washington, USA, AAAI Technical Report, Vol. WS-13-16, AAAI, 2013.
By handling whole sets of indistinguishable objects together, lifted belief propagation approaches have rendered large, previously intractable, probabilistic inference problems quickly solvable. In this paper, we show that Kumar and Zilberstein's likelihood maximization (LM) approach to MAP inference is liftable, too, and actually provides additional structure for optimization. Specifically, it has been recognized that some pseudo marginals may converge quickly, turning intuitively into pseudo evidence. This additional evidence typically changes the structure of the lifted network: it may expand or reduce it. The current lifted network, however, can be viewed as an upper bound on the size of the lifted network required to finish likelihood maximization. Consequently, we re-lift the network only if the pseudo evidence yields a reduced network, which can efficiently be computed on the current lifted network. Our experimental results on Ising models, image segmentation and relational entity resolution demonstrate that this bootstrapped LM via" reduce and re-lift" finds MAP assignments comparable to those found by the original LM approach, but in a fraction of the time.