The growing availability of hardware accelerators such as GPUs has generated interest in Markov chains Monte Carlo (MCMC) workflows which run a large number of chains in parallel. Each chain still needs to forget its initial state but the subsequent sampling phase can be almost arbitrarily short. To determine if the resulting short chains are reliable, we need to assess how close the Markov chains are to convergence to their stationary distribution. The $\widehat R$ statistic is a battle-tested convergence diagnostic but unfortunately can require long chains to work well. We present a nested design to overcome this challenge, and introduce tuning parameters to control the reliability, bias, and variance of convergence diagnostics.
翻译:GPUs等硬件加速器的日益普及引起了人们对Markov连锁店Monte Carlo(MCMC)工作流程的兴趣,这些工作流程同时运行着大量的链条。每个链条仍然需要忘记其初始状态,但随后的取样阶段可能几乎是任意的短路。要确定由此产生的短链是否可靠,我们需要评估Markov连锁店离固定分布有多近。 $@ wweenful R$统计数据是经过战斗测试的趋同诊断,但不幸的是需要很长的链条才能很好地运作。 我们提出了克服这一挑战的嵌套设计,并引入调控参数来控制趋同诊断的可靠性、偏向性和差异性。