Rank-Normalization, Folding, and Localization: An Improved Rˆ for Assessing Convergence of MCMC (with Discussion)

By Aki Vehtari, Andrew Gelman, Daniel P. Simpson, Bob Carpenter, Paul-Christian Burkner. Bayesian Analysis, 2019

1,440 citations recorded by the source corpus.

Markov chain Monte Carlo is a key computational tool in Bayesian statistics, but it can be challenging to monitor the convergence of an iterative stochastic algorithm. In this paper we show that the convergence diagnostic $\widehat{R}$ of Gelman and Rubin (1992) has serious flaws. Traditional $\widehat{R}$ will fail to correctly diagnose convergence failures when the chain has a heavy tail or when the variance varies across the chains. In this paper we propose an alternative rank-based diagnostic that fixes these problems. We also introduce a collection of quantile-based local efficiency measures, along with a practical approach for computing Monte Carlo error estimates for quantiles. We suggest that common trace plots should be replaced with rank plots from multiple chains. Finally, we give recommendations for how these methods should be used in practice.

Subfields: Management Science and Operations Research, Statistics and Probability

View Paper: https://www.semanticscholar.org/paper/5f0b75a41dc87ba5877e2cd8f84e8d7e70883711

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Management Science and Operations Research

  1. Andrew Gelman
  2. Aki Vehtari
  3. Yuling Yao
  4. Bryan Eikema

In Statistics and Probability

  1. Yuling Yao
  2. Aki Vehtari
  3. Andrew Gelman
  4. Bryan Eikema
  5. Joshua S. Speagle
  6. Paul-Christian Burkner
  7. Jonah Gabry
  8. Daniel P. Simpson

Citations in the corpus