基于树型先验模型结构的马尔可夫链蒙特卡罗方法
Markov Chain Monte Carlo using Tree-Based Priors on Model Structure
摘要:
我们提出了一个通用的框架,用于定义先验模型结构和采样后使用大都会黑斯廷斯算法。其关键思想是通过概率树来定义结构先验,并且Metropolis-Hastings算法的建议机制通过遍历该树来操作,从而定义一个廉价可计算的接受概率。我们已经将这种方法应用到贝叶斯网络结构学习中,使用了一些先验知识和树遍历策略。我们的研究结果表明,这些必须选择适当的这种方法是成功的。
英文摘要:
We present a general framework for defining priors on model structure and sampling from the posterior using the Metropolis-Hastings algorithm. The key idea is that structure priors are defined via a probability tree and that the proposal mechanism for the Metropolis-Hastings algorithm operates by traversing this tree, thereby defining a cheaply computable acceptance probability. We have applied this approach to Bayesian net structure learning using a number of priors and tree traversal strategies. Our results show that these must be chosen appropriately for this approach to be successful.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。