The permanent of a non-negative matrix appears naturally in many information processing scenarios. Because of the intractability of the permanent beyond small matrices, various approximation techniques have been developed in the past. In this paper, we study the Bethe approximation of the permanent and add to the body of literature showing that this approximation is very well behaved in many respects. Our main technical tool are topological double covers of the normal factor graph whose partition function equals the permanent of interest, along with a transformation of these double covers.
翻译:在许多信息处理假设中,非负矩阵的永久性自然地出现在许多信息处理假设中,由于超越小矩阵的永久性的可吸引性,过去已经开发了各种近似技术。在本文中,我们研究了永久性近似值,并在文献中增加了文献,表明这一近似在许多方面表现良好。我们的主要技术工具是正常系数图的表层双层覆盖,其分区功能等于永久利益,同时转换了这些双层。