2026-08-15T19:38:16Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:2585 2024-03-06T10:33:32Z ddc:004 open_access

Improving the Efficiency of Gibbs Sampling for Probabilistic Logical Models by Means of Program Specialization Fierens, Daan Probabilistic logical models probabilistic logic programming program specialization Gibbs sampling 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Daan Fierens 2010 Is Part Of LIPIcs, Volume 7, Technical Communications of the 26th International Conference on Logic Programming (2010) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ICLP.2010.74 urn:nbn:de:0030-drops-25857 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2010.74 eng https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode