The DOI matches its Crossref record; 57 of the 57 references it cites were found in a registry or an index.
Efficient Construction of Reversible Jump Markov Chain Monte Carlo Proposal Distributions
Abstract
Summary: The 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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Gelman, A., Carlin, J. B., Stern, H. S., & Rubin, D. B. (2003) · doi:10.1201/9780429258480 · Cited by 27,276
Monte Carlo sampling methods using Markov chains and their applications.
Hastings, W. K. (1970) · Biometrika · doi:10.1093/biomet/57.1.97 · Cited by 15,195 · cited 3×
“A graphical model is a family of probability distributions Pg which is Markov over g (see, for instance, Lauritzen (1996)).”
BackgroundA Stochastic Approximation Method
Robbins, H., & Monro, S. (1951) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729586 · Cited by 9,643
Reversible jump Markov chain Monte Carlo computation and Bayesian model determination
GREEN, P. J. (1995) · Biometrika · doi:10.1093/biomet/82.4.711 · Cited by 5,930
Bayesian Learning for Neural Networks
Neal, R. M. (1996) · Lecture Notes in Statistics · doi:10.1007/978-1-4612-0745-0 · Cited by 4,276
Duane, S., Kennedy, A. D., Pendleton, B. J., & Roweth, D. (1987) · Physics Letters B · doi:10.1016/0370-2693(87)91197-x · Cited by 3,872
Lauritzen, S. L. (1996) · doi:10.1093/oso/9780198522195.001.0001 · Cited by 2,976
An Adaptive Metropolis Algorithm
Haario, H., Saksman, E., & Tamminen, J. (2001) · Bernoulli · doi:10.2307/3318737 · Cited by 2,631
Ripley, B. D. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01615.x · Cited by 2,511
Computing Bayes Factors by Combining Simulation and Asymptotic Approximations
Diciccio, T. J., Kass, R. E., Raftery, A., & Wasserman, L. (1997) · Journal of the American Statistical Association · doi:10.1080/01621459.1997.10474045 · Cited by 1,943
Marginal Likelihood from the Gibbs Output
Chib, S. (1995) · Journal of the American Statistical Association · doi:10.1080/01621459.1995.10476635 · Cited by 1,905
On Bayesian Analysis of Mixtures with an Unknown Number of Components (with discussion)
Richardson, S., & Green, P. J. (1997) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/1467-9868.00095 · Cited by 1,898
Graphical Models in Applied Multivariate Statistics
Goodall, C. R. (1991) · Technometrics · doi:10.1080/00401706.1991.10484880 · Cited by 1,849
Simulated Tempering: A New Monte Carlo Scheme
Marinari, E., & Parisi, G. (1992) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/19/6/002 · Cited by 1,818
Weak convergence and optimal scaling of random walk Metropolis algorithms
Roberts, G. O., Gelman, A., & Gilks, W. R. (1997) · The Annals of Applied Probability · doi:10.1214/aoap/1034625254 · Cited by 1,693 · cited 2×
“…distributions can be refined in more subtle ways than by variance alterations, the restriction of the choice of proposal problem to this one-dimensional problem is appealing, works well in practice and is supported in part by currently available theory (see for example Roberts et al. (1997)).”
BackgroundSelf-citationMarginal Likelihood From the Metropolis–Hastings Output
Chib, S., & Jeliazkov, I. (2001) · Journal of the American Statistical Association · doi:10.1198/016214501750332848 · Cited by 1,062
van Dyk, D. A., & Meng, X.-L. (2001) · Journal of Computational and Graphical Statistics · doi:10.1198/10618600152418584 · Cited by 1,052
Exponential Convergence of Langevin Distributions and Their Discrete Approximations
Roberts, G. O., & Tweedie, R. L. (1996) · Bernoulli · doi:10.2307/3318418 · Cited by 998
Self-citationBayesian Model Choice Via Markov Chain Monte Carlo Methods
Carlin, B. P., & Chib, S. (1995) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1995.tb02042.x · Cited by 989
On Bayesian Analysis of Mixtures with an Unknown Number of Components
Richardson, S. T., & Green, P. J. (1997) · Cited by 919
Optimal Scaling of Discrete Approximations to Langevin Diffusions
Roberts, G. O., & Rosenthal, J. S. (1998) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/1467-9868.00123 · Cited by 632
Self-citationOptimum Monte-Carlo sampling using Markov chains
PESKUN, P. H. (1973) · Biometrika · doi:10.1093/biomet/60.3.607 · Cited by 531
Stephens, M. (2000) · The Annals of Statistics · doi:10.1214/aos/1016120364 · Cited by 524
Minorization Conditions and Convergence Rates for Markov Chain Monte Carlo
Rosenthal, J. S. (1995) · Journal of the American Statistical Association · doi:10.1080/01621459.1995.10476548 · Cited by 487
On Bayesian model and variable selection using MCMC
Dellaportas, P., Forster, J. J., & Ntzoufras, I. (2002) · Statistics and Computing · doi:10.1023/a:1013164120801 · Cited by 448
Geiger, D., & Heckerman, D. (1994) · Uncertainty Proceedings 1994 · doi:10.1016/b978-1-55860-332-5.50035-3 · Cited by 426
Updating Schemes, Correlation Structure, Blocking and Parameterization for the Gibbs Sampler
Roberts, G. O., & Sahu, S. K. (1997) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/1467-9868.00070 · Cited by 409
Self-citationA note on Metropolis-Hastings kernels for general state spaces
Tierney, L. (1998) · The Annals of Applied Probability · doi:10.1214/aoap/1027961031 · Cited by 338
Highly Structured Stochastic Systems
Green, P. J. (2003) · CERN Document Server (European Organization for Nuclear Research) · Cited by 332
Trans-dimensional Markov chain Monte Carlo
Green, P. J. (2003) · Highly Structured Stochastic Systems · doi:10.1093/oso/9780198510550.003.0017 · Cited by 329
Analysis of a nonreversible Markov chain sampler
Diaconis, P., Holmes, S., & Neal, R. M. (2000) · The Annals of Applied Probability · doi:10.1214/aoap/1019487508 · Cited by 284
On the Relationship Between Markov chain Monte Carlo Methods for Model Uncertainty
Godsill, S. J. (2001) · Journal of Computational and Graphical Statistics · doi:10.1198/10618600152627924 · Cited by 281
Modelling Heterogeneity With and Without the Dirichlet Process
Green, P. J., & Richardson, S. (2001) · Scandinavian Journal of Statistics · doi:10.1111/1467-9469.00242 · Cited by 272
Lawler, G. F., & Sokal, A. D. (1988) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1988-0930082-9 · Cited by 265
Decomposable graphical Gaussian model determination
Giudici, P. (1999) · Biometrika · doi:10.1093/biomet/86.4.785 · Cited by 263
Self-citationDelayed rejection in reversible jump Metropolis-Hastings
Green, P. J., & Mira, A. (2001) · Biometrika · doi:10.1093/biomet/88.4.1035 · Cited by 263
Statistical Applications Using Fuzzy Sets.
Haberman, S. J., Manton, K. G., Woodbury, M. A., & Tolley, H. D. (1995) · Journal of the American Statistical Association · doi:10.2307/2291362 · Cited by 217
Spatial birth and death processes
Preston, C. (1975) · Advances in Applied Probability · doi:10.1017/s0001867800040726 · Cited by 208
Kendall, W. S., & Møller, J. (2000) · Advances in Applied Probability · doi:10.1017/s0001867800010284 · Cited by 190
Seeking efficient data augmentation schemes via conditional and marginal augmentation
Meng, X.-L. (1999) · Biometrika · doi:10.1093/biomet/86.2.301 · Cited by 179
Nearest-Neighbour Markov Point Processes and Random Sets
Baddeley, A., Møller, J., & Moller, J. (1989) · International Statistical Review / Revue Internationale de Statistique · doi:10.2307/1403381 · Cited by 179
Markov chain Monte Carlo model determination for hierarchical and graphical log-linear models
Dellaportas, P. (1999) · Biometrika · doi:10.1093/biomet/86.3.615 · Cited by 163
Bayesian Analysis: A Look at Today and Thoughts of Tomorrow
Berger, J. O. (2000) · Journal of the American Statistical Association · doi:10.1080/01621459.2000.10474328 · Cited by 155
Meng, X., & Schilling, S. G. (2002) · Journal of Computational and Graphical Statistics · doi:10.1198/106186002457 · Cited by 153
Nonparametric Convergence Assessment for MCMC Model Selection
Brooks, S. P., Giudici, P., & Philippe, A. (2003) · Journal of Computational and Graphical Statistics · doi:10.1198/1061860031347 · Cited by 105
Self-citationPerfect simulation in stochastic geometry
Kendall, W. S., & Elke Thönnes, B. (1999) · Pattern Recognition · doi:10.1016/s0031-3203(99)00021-7 · Cited by 91
Classical Model Selection via Simulated Annealing
Brooks, S. P., Friel, N., & King, R. (2003) · Journal of the Royal Statistical Society Series B (Statistical Methodology) · doi:10.1111/1467-9868.00399 · Cited by 88
Self-citationMarkov Chain Monte Carlo for Statistical Inference
Besag, J. E. (2002) · Cited by 80
On the Bayesian analysis of population size
King, R. (2001) · Biometrika · doi:10.1093/biomet/88.2.317 · Cited by 80
Improving the acceptance rate of reversible jump MCMC proposals
Al-Awadhi, F. A., Hurn, M. A., & Jennison, C. (2004) · Statistics & Probability Letters · doi:10.1016/j.spl.2004.06.025 · Cited by 76
Structured Markov Chain Monte Carlo
Sargent, D. J., Hodges, J. S., & Carlin, B. P. (2000) · Journal of Computational and Graphical Statistics · doi:10.1080/10618600.2000.10474877 · Cited by 47
Bayesian Classification of Neolithic Tools
Δελλαπόρτας, Π. (1998) · Journal of the Royal Statistical Society Series C (Applied Statistics) · doi:10.1111/1467-9876.00112 · Cited by 36
Erosheva, E. A., Fienberg, S. E., & Junker, B. W. (2002) · Annales de la faculté des sciences de Toulouse Mathématiques · doi:10.5802/afst.1035 · Cited by 27
Perfect Forward Simulation via Simulated Tempering
Brooks, S. P., Fan, Y., & Rosenthal, J. S. (2006) · Communications in Statistics - Simulation and Computation · doi:10.1080/03610910600716753 · Cited by 22
Self-citationBayesian Modelling of Prehistoric Corbelled Domes
Fan, Y., & Brooks, S. P. (2000) · Journal of the Royal Statistical Society Series D (The Statistician) · doi:10.1111/1467-9884.00239 · Cited by 21
Self-citationAsymptotic Variance and Convergence Rates of Nearly-Periodic MCMC Algorithms
Rosenthal, S. (2002) · Cited by 17
MCMC methods for restoration of nonlinearly distorted autoregressive signals
Troughton, P. T., & Godsill, S. (2001) · Signal Processing · doi:10.1016/s0165-1684(00)00192-4 · Cited by 17
Cited by
Foll, M., & Gaggiotti, O. (2008) · Genetics · doi:10.1534/genetics.108.092221 · Cited by 2,736
Andrieu, C., & Thoms, J. (2008) · Statistics and Computing · doi:10.1007/s11222-008-9110-y · Cited by 903
Exact and efficient Bayesian inference for multiple changepoint problems
Fearnhead, P. (2006) · Statistics and Computing · doi:10.1007/s11222-006-8450-8 · Cited by 440
Seismic tomography with the reversible jump algorithm
Bodin, T., & Sambridge, M. (2009) · Geophysical Journal International · doi:10.1111/j.1365-246x.2009.04226.x · Cited by 439
Bayesian auxiliary variable models for binary and multinomial regression
Held, L., & Holmes, C. C. (2006) · Bayesian Analysis · doi:10.1214/06-ba105 · Cited by 434
Metadata
- Authors
- Brooks, S. P., Giudici, P., & Roberts, G. O.
- Venue
- Journal of the Royal Statistical Society Series B: Statistical Methodology
- Publisher
- Oxford University Press (OUP)
- Published
- 2003-01-28
- Volume
- 65
- Issue
- 1
- Pages
- 3-39
- ISSN
- 1369-7412 (ISSN-L)
- 1467-9868
- OpenAlex
- W2135459617
- Cited by
- 310
- References
- 57
- FWCI
- 13.37
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.