arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2301.11664cs.PL
收藏

高阶概率编程语言中的自动对齐

Automatic Alignment in Higher-Order Probabilistic Programming Languages

Daniel Lundén, Gizem Çaylak, Fredrik Ronquist, David Broman

AI总结:

针对现有概率编程语言检查点位置确定非最优的问题,提出自动确定对齐检查点的静态分析技术,基于此设计两种新推断算法,实验证明其在执行速度和准确率上均优于标准算法。

摘要:

概率编程语言(Probabilistic Programming Languages, PPLs)允许用户对统计推断问题进行编码,并自动应用推断算法求解。PPL中常用的推断算法,如序列蒙特卡洛(sequential Monte Carlo, SMC)和马尔可夫链蒙特卡洛(Markov chain Monte Carlo, MCMC),均围绕检查点构建——检查点是概率程序执行过程中与推断算法相关的事件。在现有PPL中,检查点位置的确定并非最优。为解决这一问题,我们提出一种静态分析技术,可自动确定程序中的检查点,免去PPL用户的这项任务。该分析识别出一组在每次程序运行中都以相同顺序执行的检查点——它们是对齐的。我们形式化定义了对齐,证明了该分析的正确性,并将其作为高阶函数式PPL Miking CorePPL的一部分实现。利用对齐分析,我们设计了两种新的推断算法变体:对齐SMC和对齐轻量级MCMC。通过真实场景实验我们表明,与标准PPL版本的SMC和MCMC相比,它们显著提升了推断的执行速度和准确率。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑