返回
Probabilistic programming with stochastic variational message passing
DOI:10.1016/j.ijar.2022.06.006.png)
摘要
En 中文
Stochastic approximation methods for variational inference have recently gained popularity in the probabilistic programming community since these methods are amenable to automation and allow online, scalable, and universal approximate Bayesian inference. Unfortunately, common Probabilistic Programming Languages (PPLs) with stochastic approximation engines lack the efficiency of message passing-based inference algorithms with deterministic update rules such as Belief Propagation (BP) and Variational Message Passing (VMP). Still, Stochastic Variational Inference (SVI) and Conjugate-Computation Variational Inference (CVI) provide principled methods to integrate fast deterministic inference techniques with broadly applicable stochastic approximate inference. Unfortunately, implementation of SVI and CVI necessitates manually driven variational update rules, which does not yet exist in most PPLs. In this paper, we cast SVI and CVI explicitly in a message passing-based inference context. We provide an implementation for SVI and CVI in ForneyLab, which is an automated message passing-based probabilistic programming package in the open source Julia language. Through a number of experiments, we demonstrate how SVI and CVI extends the automated inference capabilities of message passing-based probabilistic programming. (C) 2022 The Author(s). Published by Elsevier Inc.
Keyword:
Factor graphs
Message passing
Natural gradient descent
Probabilistic programming
Variational inference
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3
论文数:
3.0K
被引数:
5.1K
机构
引用论文
The factor graph approach to model-based signal processing基于模型的信号处理的因子图方法
PROCEEDINGS OF THE IEEE
IF25.9
Imine-linked micron-network polymers with high polyethylene glycol uptake for shaped-stabilized phase change materials
RSC Advances
IF0

