Partial Evaluation in Junction Trees

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

1 Citation (Scopus)
1 Downloads (Pure)

Abstract

One prominent method to perform inference on probabilistic graphical models is the probability propagation in trees of clusters (PPTC) algorithm. In this paper, we demonstrate the use of partial evaluation, an established technique from the compiler domain, to improve the performance of online Bayesian inference using the PPTC algorithm in the context of observed evidence. We present a metaprogramming-based method to transform a base program into an optimized version by precomputing the static input at compile time while guaranteeing behavioral equivalence. We achieve an inference time reduction of 21% on average for the Promedas benchmark.

Original languageEnglish
Title of host publicationProceedings : 2022 25th Euromicro Conference on Digital System Design, DSD 2022
EditorsHimar Fabelo, Samuel Ortega, Amund Skavhaug
PublisherInstitute of Electrical and Electronics Engineers
Pages429-437
Number of pages9
ISBN (Electronic)978-1-6654-7404-7
DOIs
Publication statusPublished - 4 Jan 2022
Event25th Euromicro Conference on Digital System Design, DSD 2022 - Maspalomas, Spain
Duration: 31 Aug 20222 Sept 2022

Conference

Conference25th Euromicro Conference on Digital System Design, DSD 2022
Country/TerritorySpain
CityMaspalomas
Period31/08/222/09/22

Bibliographical note

Funding Information:
This work is partially funded by the Netherlands Organization for Scientific Research.

Keywords

  • Bayesian inference
  • junction trees
  • message passing
  • partial evaluation
  • probabilistic graphical models

Fingerprint

Dive into the research topics of 'Partial Evaluation in Junction Trees'. Together they form a unique fingerprint.

Cite this