Issues in the Multiple Try Metropolis Mixing

Authors: L. Martino, F. Louzada

The multiple Try Metropolis (MTM) algorithm is an advanced MCMC technique based on drawing and testing several candidates at each iteration of the algorithm. One of them is selected according to certain weights and then it is tested according to a suitable acceptance probability. Clearly, since the computational cost increases as the employed number of tries grows, one expects that the performance of an MTM scheme improves as the number of tries increases, as well. However, there are scenarios where the increase of number of tries does not produce a corresponding enhancement of the performance. In this work, we describe these scenarios and then we introduce possible solutions for solving these issues.

Comments: 15 Pages. To appear in Computational Statistics

Download: PDF

Submission history

[v1] 2015-08-18 02:29:47
[v2] 2015-08-19 03:39:57
[v3] 2016-02-24 08:21:59

Unique-IP document downloads: 53 times

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus