用Quantization逼近
Approximation by Quantization
摘要:
图形模型中的推理包括重复地乘以和求和。它通常是棘手的,因为以这种方式获得的衍生电位可以是指数级的大。近似推理技术,如置信传播和变分方法,通过简化导出的电位来解决这个问题,通常是通过从它们中删除变量。我们提出了一种简化势的替代方法:量化它们的值。量子化使得势能的不同状态具有相同的值,因此引入了上下文特定的独立性,可以利用这些独立性来表示更复杂的势能。我们使用代数决策图(ADD)来有效地做到这一点。我们应用量化和ADD减少变量消除和连接树传播,产生一个家庭的有界近似推理方案。我们的实验测试表明,我们的新方案显着优于国家的最先进的方法在许多基准实例。
英文摘要:
Inference in graphical models consists of repeatedly multiplying and summing out potentials. It is generally intractable because the derived potentials obtained in this way can be exponentially large. Approximate inference techniques such as belief propagation and variational methods combat this by simplifying the derived potentials, typically by dropping variables from them. We propose an alternate method for simplifying potentials: quantizing their values. Quantization causes different states of a potential to have the same value, and therefore introduces context-specific independencies that can be exploited to represent the potential more compactly. We use algebraic decision diagrams (ADDs) to do this efficiently. We apply quantization and ADD reduction to variable elimination and junction tree propagation, yielding a family of bounded approximate inference schemes. Our experimental tests show that our new schemes significantly outperform state-of-the-art approaches on many benchmark instances.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。