Lifted Weight Learning of Markov Logic Networks Revisited
Artificial Intelligence
2019-03-08 v1
Abstract
We study lifted weight learning of Markov logic networks. We show that there is an algorithm for maximum-likelihood learning of 2-variable Markov logic networks which runs in time polynomial in the domain size. Our results are based on existing lifted-inference algorithms and recent algorithmic results on computing maximum entropy distributions.
Keywords
Cite
@article{arxiv.1903.03099,
title = {Lifted Weight Learning of Markov Logic Networks Revisited},
author = {Ondrej Kuzelka and Vyacheslav Kungurtsev},
journal= {arXiv preprint arXiv:1903.03099},
year = {2019}
}
Comments
Appearing in the proceedings of the 22nd International Conference on Artificial Intelligence and Statistics (AISTATS)