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

完全图上一类具有易处理划分函数的随机场

A class of random fields on complete graphs with tractable partition function

Czech Technical University in Prague(布拉格捷克理工大学)

Boris Flach

摘要:

这篇短文的目的是要引起注意的一种方法,通过这种方法,可以在多项式时间内计算出完全图上某类随机场的配分函数和边际概率。这一类包括伊辛模型与齐次成对潜力,但任意(非齐次)一元潜力。类似地,对于完全二部图上的随机场,如果它们具有齐次成对势,则可以在多项式时间内计算配分函数和边际概率。我们期望这些易于处理的大规模随机场类可以是非常有用的近似算法的评估,提供准确的误差估计。

英文摘要:

The aim of this short note is to draw attention to a method by which the partition function and marginal probabilities for a certain class of random fields on complete graphs can be computed in polynomial time. This class includes Ising models with homogeneous pairwise potentials but arbitrary (inhomogeneous) unary potentials. Similarly, the partition function and marginal probabilities can be computed in polynomial time for random fields on complete bipartite graphs, provided they have homogeneous pairwise potentials. We expect that these tractable classes of large scale random fields can be very useful for the evaluation of approximation algorithms by providing exact error estimates.

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

↑