【24h】

Symbolic Variable Elimination for Discrete and Continuous Graphical Models

机译:离散和连续图形模型的符号变量消除

获取原文

摘要

Probabilistic reasoning in the real-world often requires inference in continuous variable graphical models, yet there are few methods for exact, closed-form inference when joint distributions are non-Gaussian. To address this inferential deficit, we introduce SVE - a symbolic extension of the well-known variable elimination algorithm to perform exact inference in an expressive class of mixed discrete and continuous variable graphical models whose conditional probability functions can be well-approximated as oblique piecewise polynomials with bounded support. Using this representation, we show that we can compute all of the SVE operations exactly and in closed-form, which crucially includes definite integration w.r.t. multivariate piecewise polynomial functions. To aid in the efficient computation and compact representation of this solution, we use an extended algebraic decision diagram (XADD) data structure that supports all SVE operations. We provide illustrative results for SVE on probabilistic inference queries inspired by robotics localization and tracking applications that mix various continuous distributions; this represents the first time a general closed-form exact solution has been proposed for this expressive class of discrete/continuous graphical models.
机译:现实世界中的概率推理通常需要在连续变量图形模型中进行推理,但是当关节分布为非高斯分布时,很少有用于精确,封闭形式推理的方法。为了解决这种推断缺陷,我们引入了SVE-众所周知的变量消除算法的符号扩展,可以在混合表达形式的离散离散和连续变量图形模型中执行精确推理,其条件概率函数可以近似地作为斜分段多项式在有限的支持下。使用此表示,我们表明我们可以完全以封闭形式计算所有SVE运算,而关键地包括确定积分w.r.t.。多元分段多项式函数。为了帮助此解决方案进行有效的计算和紧凑表示,我们使用了扩展的代数决策图(XADD)数据结构,该结构支持所有SVE操作。我们为SVE的概率推理查询提供了说明性结果,这些查询受机器人本地化和跟踪应用程序的启发,这些应用程序混合了各种连续分布;这代表首次针对此类离散/连续图形模型提出了通用的闭式精确解。

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号