首页> 外文期刊>Journal of Combinatorial Optimization >A polynomial-time perfect sampler for the Q-Ising with a vertex-independent noise
【24h】

A polynomial-time perfect sampler for the Q-Ising with a vertex-independent noise

机译:用于Q-Ising的多项式时间完美采样器,具有与顶点无关的噪声

获取原文
获取原文并翻译 | 示例
           

摘要

We present a polynomial-time perfect sampler for the Q-Ising with a vertex-independent noise. The Q-Ising, one of the generalized models of the Ising, arose in the context of Bayesian image restoration in statistical mechanics. We study the distribution of Q-Ising on a two-dimensional square lattice over n vertices, that is, we deal with a discrete state space {1,…,Q} n for a positive integer Q. Employing the Q-Ising (having a parameter β) as a prior distribution, and assuming a Gaussian noise (having another parameter α), a posterior is obtained from the Bayes’ formula. Furthermore, we generalize it: the distribution of noise is not necessarily a Gaussian, but any vertex-independent noise. We first present a Gibbs sampler from our posterior, and also present a perfect sampler by defining a coupling via a monotone update function. Then, we show O(nlog n) mixing time of the Gibbs sampler for the generalized model under a condition that β is sufficiently small (whatever the distribution of noise is). In case of a Gaussian, we obtain another more natural condition for rapid mixing that α is sufficiently larger than β. Thereby, we show that the expected running time of our sampler is O(nlog n).
机译:我们为Q-Ising提供了一个与顶点无关的噪声的多项式时间完美采样器。 Q-Ising是Ising的广义模型之一,是在统计力学中的贝叶斯图像恢复的背景下出现的。我们研究n个顶点上的二维方格上Q-Ising的分布,即,我们针对正整数Q处理离散状态空间{1,…,Q} n 。采用Q-Ising(具有参数β)作为先验分布,并假设高斯噪声(具有另一个参数α),则从贝叶斯公式获得后验。此外,我们将其概括为:噪声的分布不一定是高斯分布,而是任何与顶点无关的噪声。我们首先从后验提出一个吉布斯采样器,然后通过单调更新函数定义一个耦合来提出一个完美的采样器。然后,我们展示了在β足够小(无论噪声分布如何)的条件下,广义模型的Gibbs采样器的O(nlog n)混合时间。在高斯的情况下,我们获得了另一个更自然的快速混合条件,即α足够大于β。因此,我们表明采样器的预期运行时间为O(nlog n)。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号