难处理网络中似然上下界的计算
Computing Upper and Lower Bounds on Likelihoods in Intractable Networks
Massachusetts Institute of Technology(麻省理工学院)
摘要:
我们提出了确定性技术计算上界和下界的边缘概率在sigmoid和噪声或网络。当网络的大小(或团的大小)排除了精确计算时,这些技术变得有用。我们通过数值实验说明了边界的紧密性。
英文摘要:
We present deterministic techniques for computing upper and lower bounds on marginal probabilities in sigmoid and noisy-OR networks. These techniques become useful when the size of the network (or clique size) precludes exact computations. We illustrate the tightness of the bounds by numerical experiments.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。