Journal
JOURNAL OF EDUCATIONAL AND BEHAVIORAL STATISTICS
Volume 29, Issue 4, Pages 461-488Publisher
AMER EDUCATIONAL RESEARCH ASSOC
DOI: 10.3102/10769986029004461
Keywords
convergence diagnostics; Markov chain Monte Carlo (MCMC); multivariate potential scale reductionfactor (MPSRF); testlet model
Ask authors/readers for more resources
There is an increasing use of Markov chain Monte Carlo (MCMC) algorithms for fitting statistical models in psychometrics, especially in situations where the traditional estimation techniques are very difficult to apply. One of the disadvantages of using an MCMC algorithm is that it is not straightforward to determine the convergence of the algorithm. Using the output of an MCMC algorithm that has not converged may lead to incorrect inferences on the problem at hand The convergence is not one to a point, but that of the distribution of a sequence of generated values to another distribution, and hence is not easy to assess; there is no guaranteed diagnostic tool to determine convergence of an MCMC algorithm in general. This article examines the convergence of MCMC algorithms using a number of convergence diagnostics for two real data examples from psychometrics. Findings from this research have the potential to be useful to researchers using the algorithms. For both the examples, the number of iterations required (suggested by the diagnostics) to be reasonably confident that the MCMC algorithm has converged may be larger than what many practitioners consider to be safe.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available