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

基于可交换分解的提升滤波

Lifted Filtering via Exchangeable Decomposition

Institute of Computer Science, University of Rostock(罗斯托克大学计算机科学研究所);Computer Science Department and Centre for Cognitive Science, TU Darmstadt(达姆施塔特工业大学计算机科学系与认知科学中心)

Stefan Lüdtke, Max Schröder, Sebastian Bader, Kristian Kersting, Thomas Kirste

摘要:

提出了一种基于提升多集状态的精确递归贝叶斯滤波模型。与基于列表的接地状态表示相比,将多集与提升相结合可以同时利用多种策略来降低推理复杂度。其核心思想是借用最大并行多集重写系统的概念,并通过Rao-Blackwellization和Lifted Inference的概念对其进行增强,给出一种能够实现有效推理的状态分布表示。在定义系统状态的随机变量是可交换的世界中,实体的身份并不重要,它自动使用一种从排序中抽象出来的表示(实现复杂性的指数级降低),当观测或系统动力学通过破坏对称性破坏交换性时,它会自动适应。

英文摘要:

We present a model for exact recursive Bayesian filtering based on lifted multiset states. Combining multisets with lifting makes it possible to simultaneously exploit multiple strategies for reducing inference complexity when compared to list-based grounded state representations. The core idea is to borrow the concept of Maximally Parallel Multiset Rewriting Systems and to enhance it by concepts from Rao-Blackwellization and Lifted Inference, giving a representation of state distributions that enables efficient inference. In worlds where the random variables that define the system state are exchangeable -- where the identity of entities does not matter -- it automatically uses a representation that abstracts from ordering (achieving an exponential reduction in complexity) -- and it automatically adapts when observations or system dynamics destroy exchangeability by breaking symmetry.

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

↑