arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1205.2616cs.AI
收藏

基于互模拟的近似提升推理

Bisimulation-based Approximate Lifted Inference

Univ. of Maryland, College Park(马里兰大学学院公园分校)

Prithviraj Sen, Amol Deshpande, Lise Getoor

摘要:

最近,人们对执行提升推理的方法很感兴趣;然而,大多数工作都假设一阶模型作为系统的输入。在这里,我们描述了提升的推理算法,确定对称性和自动提升的概率模型,以加速推理。特别是,我们描述了近似提升推理技术,允许用户通过使用少数可调参数来权衡推理精度和计算效率,同时保持误差有界。我们的算法是密切相关的图论概念的互模拟。我们报告的合成和真实数据的实验表明,在对称性的存在下,推理的运行时间可以显着改善,与近似解除推理提供数量级的地面推理加速。

英文摘要:

There has been a great deal of recent interest in methods for performing lifted inference; however, most of this work assumes that the first-order model is given as input to the system. Here, we describe lifted inference algorithms that determine symmetries and automatically lift the probabilistic model to speedup inference. In particular, we describe approximate lifted inference techniques that allow the user to trade off inference accuracy for computational efficiency by using a handful of tunable parameters, while keeping the error bounded. Our algorithms are closely related to the graph-theoretic concept of bisimulation. We report experiments on both synthetic and real data to show that in the presence of symmetries, run-times for inference can be improved significantly, with approximate lifted inference providing orders of magnitude speedup over ground inference.

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

↑