arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1207.4156cs.LGstat.ML
收藏

广义平均场推理的图划分策略

Graph partition strategies for generalized mean field inference

University of California(加利福尼亚大学)

Eric P. Xing, Michael I. Jordan, Stuart Russell

摘要:

任意图形模型的自主变分推理算法需要能够优化模型参数空间上的变分近似,以及用于变分近似的易处理的家庭的选择。在本文中,我们提出了一种新的组合图分割算法与广义平均场(GMF)推理算法。这种组合优化了变量的不相交聚类,并使用这些聚类执行推理。我们提供了一个正式的分析图割和GMF近似之间的关系,并探讨了几个图分区策略的经验。我们的实证结果提供了相当明确的支持加权版本的MinCut作为一个有用的聚类算法GMF推理,这是一致的正式分析的影响。

英文摘要:

An autonomous variational inference algorithm for arbitrary graphical models requires the ability to optimize variational approximations over the space of model parameters as well as over the choice of tractable families used for the variational approximation. In this paper, we present a novel combination of graph partitioning algorithms with a generalized mean field (GMF) inference algorithm. This combination optimizes over disjoint clustering of variables and performs inference using those clusters. We provide a formal analysis of the relationship between the graph cut and the GMF approximation, and explore several graph partition strategies empirically. Our empirical results provide rather clear support for a weighted version of MinCut as a useful clustering algorithm for GMF inference, which is consistent with the implications from the formal analysis.

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

↑