AAAI Publications, Twenty-Fourth AAAI Conference on Artificial Intelligence

Font Size: 
Efficient Lifting for Online Probabilistic Inference
Aniruddh Nath, Pedro Domingos

Last modified: 2010-07-04


Lifting can greatly reduce the cost of inference on first-order probabilistic graphical models, but constructing the lifted network can itself be quite costly. In online applications (e.g., video segmentation) repeatedly constructing the lifted network for each new inference can be extremely wasteful, because the evidence typically changes little from one inference to the next. The same is true in many other problems that require repeated inference, like utility maximization, MAP inference, interactive inference, parameter and structure learning, etc. In this paper, we propose an efficient algorithm for updating the structure of an existing lifted network with incremental changes to the evidence. This allows us to construct the lifted network once for the initial inference problem, and amortize the cost over the subsequent problems. Experiments on video segmentation and viral marketing problems show that the algorithm greatly reduces the cost of inference without affecting the quality of the solutions.


Probabilistic Inference; Relational Probabilistic Models; Graphical Models

Full Text: PDF