Generalized Counting For Lifted Variable Elimination

INDUCTIVE LOGIC PROGRAMMING: 23RD INTERNATIONAL CONFERENCE(2014)

引用 16|浏览13
暂无评分
摘要
Lifted probabilistic inference methods exploit symmetries in the structure of probabilistic models to perform inference more efficiently. In lifted variable elimination, the symmetry among a group of interchangeable random variables is captured by counting formulas, and exploited by operations that handle such formulas. In this paper, we generalize the structure of counting formulas and present a set of inference operators that introduce and eliminate these formulas from the model. This generalization expands the range of problems that can be solved in a lifted way. Our work is closely related to the recently introduced method of joint conversion. Due to its more fine grained formulation, however, our approach can provide more efficient solutions than joint conversion.
更多
查看译文
关键词
Normal Form, Joint State, Factor Graph, Variable Elimination, Conversion Operation
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要