平均场近似:信息不等式、算法与复杂性
The Mean-Field Approximation: Information Inequalities, Algorithms, and Complexity
摘要:
伊辛模型的平均场近似是一种正则变分工具,用于伊辛模型的分析和推断。本文给出了一般图上Ising模型平均场近似的KL误差的一个简单的最优界,并将其推广到高阶马尔可夫随机场。我们的界限改善以前的界限在工作中获得的图极限文献Borgs,Chayes,Lovász,Sós和Vesztergombi和另一个最近的工作Basak和Mukherjee。我们的界紧到低阶项。建立在用于证明界的方法,以及组合数学和优化技术,我们研究了估计伊辛模型和一般马尔可夫随机场的(变分)自由能的算法问题。对于$n$顶点上的图$G$和具有Frobenius范数$\| J \|_F$的交互矩阵$J$,我们提供了在$εn \|J\|_F$随时间的加性误差内逼近自由能的算法$\exp(poly(1/ε))$。我们还证明了对于每个$δ> 0$,在$(n \|J\|_F)^{1-δ}$内的逼近都是NP难的.最后,我们提供了更有效的近似算法,找到最佳的平均场近似,铁磁伊辛模型和伊辛模型满足Dobrushin的条件。
英文摘要:
The mean field approximation to the Ising model is a canonical variational tool that is used for analysis and inference in Ising models. We provide a simple and optimal bound for the KL error of the mean field approximation for Ising models on general graphs, and extend it to higher order Markov random fields. Our bound improves on previous bounds obtained in work in the graph limit literature by Borgs, Chayes, Lovász, Sós, and Vesztergombi and another recent work by Basak and Mukherjee. Our bound is tight up to lower order terms. Building on the methods used to prove the bound, along with techniques from combinatorics and optimization, we study the algorithmic problem of estimating the (variational) free energy for Ising models and general Markov random fields. For a graph $G$ on $n$ vertices and interaction matrix $J$ with Frobenius norm $\| J \|_F$, we provide algorithms that approximate the free energy within an additive error of $εn \|J\|_F$ in time $\exp(poly(1/ε))$. We also show that approximation within $(n \|J\|_F)^{1-δ}$ is NP-hard for every $δ> 0$. Finally, we provide more efficient approximation algorithms, which find the optimal mean field approximation, for ferromagnetic Ising models and for Ising models satisfying Dobrushin's condition.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。