Abstract
There is currently a large interest in probabilistic logical models. A popular algorithm for approximate probabilistic inference with such models is Gibbs sampling. From a computational perspective, Gibbs sampling boils down to repeatedly executing certain queries on a knowledge base composed of a static part and a dynamic part. The larger the static part, the more redundancy there is in these repeated calls. This is problematic since inefficient Gibbs sampling yields poor approximations.
We show how to apply program specialization to make Gibbs sampling more efficient. Concretely, we develop an algorithm that specializes the definitions of the query-predicates with respect to the static part of the knowledge base. In experiments on real-world benchmarks we obtain speedups of up to an order of magnitude.
BibTeX - Entry
@InProceedings{fierens:LIPIcs:2010:2585,
author = {Daan Fierens},
title = {{Improving the Efficiency of Gibbs Sampling for Probabilistic Logical Models by Means of Program Specialization}},
booktitle = {Technical Communications of the 26th International Conference on Logic Programming},
pages = {74--83},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-17-0},
ISSN = {1868-8969},
year = {2010},
volume = {7},
editor = {Manuel Hermenegildo and Torsten Schaub},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2010/2585},
URN = {urn:nbn:de:0030-drops-25857},
doi = {10.4230/LIPIcs.ICLP.2010.74},
annote = {Keywords: Probabilistic logical models, probabilistic logic programming, program specialization, Gibbs sampling}
}
|
Keywords: |
|
Probabilistic logical models, probabilistic logic programming, program specialization, Gibbs sampling |
|
Collection: |
|
Technical Communications of the 26th International Conference on Logic Programming |
|
Issue Date: |
|
2010 |
|
Date of publication: |
|
25.06.2010 |
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)