2020
DOI: 10.1146/annurev-statistics-031219-041300
|View full text |Cite
|
Sign up to set email alerts
|

Convergence Diagnostics for Markov Chain Monte Carlo

Abstract: Markov chain Monte Carlo (MCMC) is one of the most useful approaches to scientific computing because of its flexible construction, ease of use and generality. Indeed, MCMC is indispensable for performing Bayesian analysis. Two critical questions that MCMC practitioners need to address are where to start and when to stop the simulation. Although a great amount of research has gone into establishing convergence criteria and stopping rules with sound theoretical foundation, in practice, MCMC users often decide co… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

2
121
0
1

Year Published

2020
2020
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 205 publications
(124 citation statements)
references
References 78 publications
2
121
0
1
Order By: Relevance
“…To understand why HMC works, we refer readers to the approachable and intuitive expositions in [22] and [24,Cha.15] for expert explanations of the algorithm and to [23], [25]- [27] for further technical analysis. In particular, Betancourt discusses how HMC is "uniquely suited to the high-dimensional problems of applied interest."…”
Section: Algorithm 1 Hamiltonian Monte Carlomentioning
confidence: 99%
See 2 more Smart Citations
“…To understand why HMC works, we refer readers to the approachable and intuitive expositions in [22] and [24,Cha.15] for expert explanations of the algorithm and to [23], [25]- [27] for further technical analysis. In particular, Betancourt discusses how HMC is "uniquely suited to the high-dimensional problems of applied interest."…”
Section: Algorithm 1 Hamiltonian Monte Carlomentioning
confidence: 99%
“…The No-U-Turn Sampler has at least the same efficiency as a well-tuned HMC algorithm [25]. The convergence is usually checked by empirical diagnostic tools [27]. Also, we carefully set the initial values of the parameters to make the convergence faster by exploring the outage data in Section III.…”
Section: Algorithm 1 Hamiltonian Monte Carlomentioning
confidence: 99%
See 1 more Smart Citation
“…For HMC-NUTS, we run 100 times for the dual averaging algorithm to tune the Störmer-Verlet symplectic integrator, and then we generate 4,000 samples for uncertainty quantification. For MCMC convergence analysis, we use Geweke z-score test for measuring stationarity of the chain and autocorrelation function and time τ for checking chain mixing (Geweke, 1992;Roy, 2020). We also convert the z-score into a two-sided p-value, for certain significance level comparisons.…”
Section: Numerical Experimentsmentioning
confidence: 99%
“…At best, we hope to “fail to prove a failure to converge”. A plethora of convergence criteria and/or graphical methods is available to do so 24 . For example, we may create a trace plot showing the values of the parameter generated at each iteration and check whether they converge to stationary values.…”
Section: Convergencementioning
confidence: 99%