Improving the Efficiency of Gibbs Sampling for Probabilistic Logical Models by Means of Program Specialization

Author Daan Fierens



PDF
Thumbnail PDF

File

LIPIcs.ICLP.2010.74.pdf
  • Filesize: 325 kB
  • 10 pages

Document Identifiers

Author Details

Daan Fierens

Cite AsGet BibTex

Daan Fierens. Improving the Efficiency of Gibbs Sampling for Probabilistic Logical Models by Means of Program Specialization. In Technical Communications of the 26th International Conference on Logic Programming. Leibniz International Proceedings in Informatics (LIPIcs), Volume 7, pp. 74-83, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
https://doi.org/10.4230/LIPIcs.ICLP.2010.74

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.
Keywords
  • Probabilistic logical models
  • probabilistic logic programming
  • program specialization
  • Gibbs sampling

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail