Reduced Traces and JITing in Church
Reduced Traces and JITing in Church
复制标题
减少教堂中的痕迹和 JITing
DOI：
--
复制
发表时间：
2013
期刊：
影响因子：
--
通讯作者：
Jeff Wu
中科院分区：
文献类型：
--
作者：
Jeff Wu
丘奇是一种图灵完全概率编程语言，专为推理而设计。通过允许简单地描述和操纵分布，它允许以紧凑的方式描述经典的Al模型，提供了一种非常丰富的表达语言。然而，对于贝叶斯网、隐马尔可夫模型和主题模型中的推理，研究人员通常用常规编程语言编写特殊的用例算法来最大化性能，而这些正是为之设计的概率编程语言所针对的设置。在这篇文章中，我们认为一种非常通用的语言仍然可以支持非常快的推理。我们首先介绍我们的教会式语言的理论方面，包括许多实现权衡。虽然该语言非常独立且易于使用，但我们也允许对推理进行更详细的说明。最后，我们展示了实验结果，展示了我们在能够快速执行推理的通用语言方面的进展，并指出了未来的研究方向。
Church is a Turing-complete probabilistic programming language, designed for inference. By allowing for easy description and manipulation of distributions, it allows one to describe classical Al models in compact ways, providing a language for very rich expression. However, for inference in Bayes nets, Hidden Markov Models, and topic models, the very settings for which probabilistic programming languages like Church were designed for, researchers typically instead write special cased algorithms in regular programming languages to maximize performance. In this paper, we argue that an extremely general language can still support very fast inference. We first introduce the theoretical aspects of our Church-like language, including many implementation tradeoffs. While the language is extremely hands-off and easy to use, we also allow for more detailed specification of the inference. Lastly, we demonstrate empirical results displaying our progress towards general languages which can perform inference quickly, and point out many future directions for research.