Sökning: id:"swepub:oai:DiVA.org:kth-324293" >
Automatic Alignment...
Automatic Alignment in Higher-Order Probabilistic Programming Languages
-
- Lundén, Daniel, 1993- (författare)
- KTH,Programvaruteknik och datorsystem, SCS
-
- Çaylak, Gizem (författare)
- KTH,Programvaruteknik och datorsystem, SCS
-
- Ronquist, Fredrik, 1962- (författare)
- Naturhistoriska riksmuseet,Enheten för bioinformatik och genetik,Fredrik Ronquists grupp,Department of Bioinformatics and Genetics, Swedish Museum of Natural History, Stockholm, Sweden; Department of Zoology, Stockholm University, Stockholm, Sweden.
-
visa fler...
-
- Broman, David, 1977- (författare)
- KTH,Programvaruteknik och datorsystem, SCS
-
visa färre...
-
(creator_code:org_t)
- 2023
- 2023
- Engelska.
-
Ingår i: Programming Languages and Systems. ; , s. 535-563
- Relaterad länk:
-
https://kth.diva-por... (primary) (Raw object)
-
visa fler...
-
https://doi.org/10.1...
-
https://urn.kb.se/re...
-
https://doi.org/10.1...
-
https://urn.kb.se/re...
-
visa färre...
Abstract
Ämnesord
Stäng
- Probabilistic Programming Languages (PPLs) allow users to encode statistical inference problems and automatically apply an inference algorithm to solve them. Popular inference algorithms for PPLs, such as sequential Monte Carlo (SMC) and Markov chain Monte Carlo (MCMC), are built around checkpoints—relevant events for the inference algorithm during the execution of a probabilistic program. Deciding the location of checkpoints is, in current PPLs, not done optimally. To solve this problem, we present a static analysis technique that automatically determines checkpoints in programs, relieving PPL users of this task. The analysis identifies a set of checkpoints that execute in the same order in every program run—they are aligned. We formalize alignment, prove the correctness of the analysis, and implement the analysis as part of the higher-order functional PPL Miking CorePPL. By utilizing the alignment analysis, we design two novel inference algorithm variants: aligned SMC and aligned lightweight MCMC. We show, through real-world experiments, that they significantly improve inference execution time and accuracy compared to standard PPL versions of SMC and MCMC.
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
Nyckelord
- Probabilistic programming
- Operational semantics
- Static analysis
- Datalogi
- Computer Science
- Diversity of life
Publikations- och innehållstyp
- ref (ämneskategori)
- kon (ämneskategori)