Efficient construction of reversible jump Markov chain Monte Carlo proposal distributions
AbstractThe major implementational problem for reversible jump Markov chain Monte Carlo methods is that there is commonly no natural way to choose jump proposals since there is no Euclidean structure in the parameter space to guide our choice. We consider mechanisms for guiding the choice of proposal. The first group of methods is based on an analysis of acceptance probabilities for jumps. Essentially, these methods involve a Taylor series expansion of the acceptance probability around certain canonical jumps and turn out to have close connections to Langevin algorithms. The second group of methods generalizes the reversible jump algorithm by using the so-called saturated space approach. These allow the chain to retain some degree of memory so that, when proposing to move from a smaller to a larger model, information is borrowed from the last time that the reverse move was performed. The main motivation for this paper is that, in complex problems, the probability that the Markov chain moves between such spaces may be prohibitively small, as the probability mass can be very thinly spread across the space. Therefore, finding reasonable jump proposals becomes extremely important. We illustrate the procedure by using several examples of reversible jump Markov chain Monte Carlo applications including the analysis of autoregressive time series, graphical Gaussian modelling and mixture modelling. Copyright 2003 Royal Statistical Society.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Royal Statistical Society in its journal Journal of the Royal Statistical Society: Series B (Statistical Methodology).
Volume (Year): 65 (2003)
Issue (Month): 1 ()
Contact details of provider:
Postal: 12 Errol Street, London EC1Y 8LX, United Kingdom
Web page: http://wileyonlinelibrary.com/journal/rssb
More information through EDIRC
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Liqun Wang & James Fu, 2007. "A practical sampling approach for a Bayesian mixture model with unknown number of components," Statistical Papers, Springer, vol. 48(4), pages 631-653, October.
- Azari Soufiani, Hossein & Diao, Hansheng & Lai, Zhenyu & Parkes, David C., 2013. "Generalized Random Utility Models with Multiple Types," Scholarly Articles 12363923, Harvard University Department of Economics.
- Griffin, J.E. & Steel, M.F.J., 2010.
"Bayesian inference with stochastic volatility models using continuous superpositions of non-Gaussian Ornstein-Uhlenbeck processes,"
Computational Statistics & Data Analysis,
Elsevier, vol. 54(11), pages 2594-2608, November.
- Griffin, Jim & Steel, Mark F.J., 2008. "Bayesian inference with stochastic volatility models using continuous superpositions of non-Gaussian Ornstein-Uhlenbeck processes," MPRA Paper 11071, University Library of Munich, Germany.
- Sridhar Narayanan, 2013. "Bayesian estimation of discrete games of complete information," Quantitative Marketing and Economics, Springer, vol. 11(1), pages 39-81, March.
- N. Friel & A. N. Pettitt, 2008. "Marginal likelihood estimation via power posteriors," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 70(3), pages 589-607.
- McVinish, R. & Mengersen, K., 2008. "Semiparametric Bayesian circular statistics," Computational Statistics & Data Analysis, Elsevier, vol. 52(10), pages 4722-4730, June.
- David I. Hastie & Peter J. Green, 2012. "Model choice using reversible jump Markov chain Monte Carlo," Statistica Neerlandica, Netherlands Society for Statistics and Operations Research, vol. 66(3), pages 309-338, 08.
- Pandolfi, Silvia & Bartolucci, Francesco & Friel, Nial, 2014. "A generalized multiple-try version of the Reversible Jump algorithm," Computational Statistics & Data Analysis, Elsevier, vol. 72(C), pages 298-314.
- Tsung-I Lin & Hsiu Ho & Pao Shen, 2009. "Computationally efficient learning of multivariate t mixture models with missing information," Computational Statistics, Springer, vol. 24(3), pages 375-392, August.
- Streftaris, George & Worton, Bruce J., 2008. "Efficient and accurate approximate Bayesian inference with an application to insurance data," Computational Statistics & Data Analysis, Elsevier, vol. 52(5), pages 2604-2622, January.
- Rigat, F. & Mira, A., 2012. "Parallel hierarchical sampling: A general-purpose interacting Markov chains Monte Carlo algorithm," Computational Statistics & Data Analysis, Elsevier, vol. 56(6), pages 1450-1467.
- Helen Armstrong & Christopher K. Carter & Kevin K. F. Wong & Robert Kohn, 2007. "Bayesian Covariance Matrix Estimation using a Mixture of Decomposable Graphical Models," Discussion Papers 2007-13, School of Economics, The University of New South Wales.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Wiley-Blackwell Digital Licensing) or (Christopher F. Baum).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.