A Delayed Column Generation Strategy for Exact K-Bounded MAP Inference in Markov Logic Networks
Abstract
The paper introduces k-bounded MAP inference, a parameterization of MAP inference in Markov logic networks. k-Bounded MAP states are MAP states with at most k active ground atoms of hidden (non-evidence) predicates. We present a novel delayed column generation algorithm and provide empirical evidence that the algorithm efficiently computes k-bounded MAP states for meaningful real-world graph matching problems. The underlying idea is that, instead of solving one large optimization problem, it is often more efficient to tackle several small ones.
Cite
Text
Niepert. "A Delayed Column Generation Strategy for Exact K-Bounded MAP Inference in Markov Logic Networks." Conference on Uncertainty in Artificial Intelligence, 2010.Markdown
[Niepert. "A Delayed Column Generation Strategy for Exact K-Bounded MAP Inference in Markov Logic Networks." Conference on Uncertainty in Artificial Intelligence, 2010.](https://mlanthology.org/uai/2010/niepert2010uai-delayed/)BibTeX
@inproceedings{niepert2010uai-delayed,
title = {{A Delayed Column Generation Strategy for Exact K-Bounded MAP Inference in Markov Logic Networks}},
author = {Niepert, Mathias},
booktitle = {Conference on Uncertainty in Artificial Intelligence},
year = {2010},
pages = {384-391},
url = {https://mlanthology.org/uai/2010/niepert2010uai-delayed/}
}