arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1602.02606stat.CO
收藏

基于块似然信息准则的隐吉布斯随机场模型选择

Hidden Gibbs random fields model selection using Block Likelihood Information Criterion

Julien Stoehr, Jean-Michel Marin, Pierre Pudlo

摘要:

在吉布斯随机场之间进行模型选择是一项非常具有挑战性的任务。事实上,由于马尔可夫依赖结构,场的归一化常数不能使用标准的分析或数值方法计算。此外,这种不可观测的场不能被积分出去,似然估计是一个加倍棘手的问题。这就形成了一个核心问题,即选择最适合观测数据的模型。我们介绍了一个新的近似版本的贝叶斯信息准则。我们将格划分成连续的矩形块,我们近似的概率测度的隐藏吉布斯场的产品的吉布斯分布在块。在此基础上,我们估计的可能性,并推导出块似然信息准则(BLIC),回答模型选择问题,如依赖结构的选择或潜在状态的数量。针对这些问题,我们研究了BLIC的性能。此外,我们提出了与ABC算法的比较,指出新的标准提供了一个更好的时间效率和可靠的结果之间的权衡。

英文摘要:

Performing model selection between Gibbs random fields is a very challenging task. Indeed, due to the Markovian dependence structure, the normalizing constant of the fields cannot be computed using standard analytical or numerical methods. Furthermore, such unobserved fields cannot be integrated out and the likelihood evaluztion is a doubly intractable problem. This forms a central issue to pick the model that best fits an observed data. We introduce a new approximate version of the Bayesian Information Criterion. We partition the lattice into continuous rectangular blocks and we approximate the probability measure of the hidden Gibbs field by the product of some Gibbs distributions over the blocks. On that basis, we estimate the likelihood and derive the Block Likelihood Information Criterion (BLIC) that answers model choice questions such as the selection of the dependency structure or the number of latent states. We study the performances of BLIC for those questions. In addition, we present a comparison with ABC algorithms to point out that the novel criterion offers a better trade-off between time efficiency and reliable results.

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

↑