平面零场Ising模型的易处理无子式推广
Tractable Minor-free Generalization of Planar Zero-field Ising Models
摘要:
我们提出了一个新的家庭的零场伊辛模型$N$二进制变量/自旋连续“胶合”的平面和$O(1)$大小的组件和子集最多三个顶点到一棵树。本文给出了求解精确推理(计算配分函数)和精确采样(产生独立同分布)的动态规划型多项式时间算法。采样)在于对作为黑盒的组件的有效(对于平面)或蛮力(对于$O(1)$大小)推断和采样的顺序应用。为了说明实用的新家庭的易处理的图形模型,我们首先建立了一个多项式算法的推理和采样的零场伊辛模型在$K_{3,3}$ -未成年人的自由拓扑结构和在$K_{5}$ -未成年人的自由拓扑结构-这两个扩展的平面零场伊辛模型-这是既不属也树宽有界的。第二,我们实证证明了改进的近似质量的NP难问题的推理在正方形网格伊辛模型在一个节点相关的非零“磁场”。
英文摘要:
We present a new family of zero-field Ising models over $N$ binary variables/spins obtained by consecutive "gluing" of planar and $O(1)$-sized components and subsets of at most three vertices into a tree. The polynomial-time algorithm of the dynamic programming type for solving exact inference (computing partition function) and exact sampling (generating i.i.d. samples) consists in a sequential application of an efficient (for planar) or brute-force (for $O(1)$-sized) inference and sampling to the components as a black box. To illustrate the utility of the new family of tractable graphical models, we first build a polynomial algorithm for inference and sampling of zero-field Ising models over $K_{3,3}$-minor-free topologies and over $K_{5}$-minor-free topologies -- both are extensions of the planar zero-field Ising models -- which are neither genus - nor treewidth-bounded. Second, we demonstrate empirically an improvement in the approximation quality of the NP-hard problem of inference over the square-grid Ising model in a node-dependent non-zero "magnetic" field.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。