arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1206.6822cs.AI
收藏

截集抽样的似然加权方法

Cutset Sampling with Likelihood Weighting

University Of California Irvine(加州大学欧文分校);Information and Computer Science(信息与计算机科学学院)

Bozhena Bidyuk, Rina Dechter

摘要:

本文从理论和实证两方面分析了贝叶斯网络中节点子集上似然加权的性能。该方案需要较少的样本收敛,由于减少采样方差。该方法利用网络的结构来限制用于计算采样分布的精确推理的复杂性,类似于Gibbs割集采样。然而,由于Gibbs采样器和LW的采样过程的差异,将先前提出的割集采样原理扩展到似然加权是不平凡的。我们的经验表明,似然加权割集(LWLC)是有效的时间明智的,并有一个较低的拒绝率比LW时,应用于网络具有许多确定性的概率。最后,我们表明,可能性加权割集的性能可以进一步提高缓存计算的采样分布,因此,学习“零”的目标分布。

英文摘要:

The paper analyzes theoretically and empirically the performance of likelihood weighting (LW) on a subset of nodes in Bayesian networks. The proposed scheme requires fewer samples to converge due to reduction in sampling variance. The method exploits the structure of the network to bound the complexity of exact inference used to compute sampling distributions, similar to Gibbs cutset sampling. Yet, the extension of the previosly proposed cutset sampling principles to likelihood weighting is non-trivial due to differences in the sampling processes of Gibbs sampler and LW. We demonstrate empirically that likelihood weighting on a cutset (LWLC) is effective time-wise and has a lower rejection rate than LW when applied to networks with many deterministic probabilities. Finally, we show that the performance of likelihood weighting on a cutset can be improved further by caching computed sampling distributions and, consequently, learning 'zeros' of the target distribution.

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

↑