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

马尔可夫随机场中的区域检测:高斯情形

Region Detection in Markov Random Fields: Gaussian Case

Ilya Soloveychik, Vahid Tarokh

摘要:

研究了样本不足情形下高斯马尔可夫场中的模型选择问题。在d-正则图的情况下,基准信息理论的结果要求样本的数量至少与顶点数量的对数成比例,以允许一致的图恢复。当样本的数量小于该数量时,不可能可靠地检测所有边缘。在许多应用中,学习网络上边(耦合)参数的分布比边的具体位置更重要。假设整个图可以被划分成一些空间区域具有相似的边缘参数和合理的规则边界,我们开发了新的信息理论的样本复杂性的界限,并表明,有限数量的样本可以是足够的一致恢复这些地区。最后,我们介绍和分析了一个有效的区域生长算法,能够恢复区域的高精度。我们表明,它是一致的,并证明其性能优势,在合成模拟。

英文摘要:

We consider the problem of model selection in Gaussian Markov fields in the sample deficient scenario. The benchmark information-theoretic results in the case of d-regular graphs require the number of samples to be at least proportional to the logarithm of the number of vertices to allow consistent graph recovery. When the number of samples is less than this amount, reliable detection of all edges is impossible. In many applications, it is more important to learn the distribution of the edge (coupling) parameters over the network than the specific locations of the edges. Assuming that the entire graph can be partitioned into a number of spatial regions with similar edge parameters and reasonably regular boundaries, we develop new information-theoretic sample complexity bounds and show that a bounded number of samples can be sufficient to consistently recover these regions. Finally, we introduce and analyze an efficient region growing algorithm capable of recovering the regions with high accuracy. We show that it is consistent and demonstrate its performance benefits in synthetic simulations.

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

↑