The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Rao-Blackwellisation of sampling schemes
Abstract
This paper proposes a post-simulation improvement for two common Monte Carlo methods, the Accept-Reject and Metropolis algorithms. The improvement is based on a Rao-Blackwellisation method that integrates over the uniform random variables involved in the algorithms, and thus post-processes the standard estimators. We show how the Rao-Blackwellised versions of these algorithms can be implemented and, through examples, illustrate the improvement in variance brought by these new procedures. We also compare the improved version of the Metropolis algorithm with ordinary and Rao-Blackwellised importance sampling procedures for independent and general Metropolis set-ups.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Equation of State Calculations by Fast Computing Machines
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953) · The Journal of Chemical Physics · doi:10.1063/1.1699114 · Cited by 37,192
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
Sampling-based approaches to calculating marginal densities
Gelfand, A. E., & Smith, A. F. M. (1990) · Journal of the American Statistical Association · doi:10.1080/01621459.1990.10476213 · Cited by 6,606
Ziegel, E. R., Lehmann, E. L., & Casella, G. (1999) · Technometrics · doi:10.2307/1270597 · Cited by 4,203
Self-citationNon-Uniform Random Variate Generation
Devroye, L. (1986) · Springer eBooks · doi:10.1007/978-1-4613-8643-8 · Cited by 4,041
Markov Chains for Exploring Posterior Distributions
Tierney, L. (1994) · The Annals of Statistics · doi:10.1214/aos/1176325750 · Cited by 3,452
Adaptive Rejection Sampling for Gibbs Sampling
Gilks, W. R., & Wild, P. (1992) · Applied Statistics · doi:10.2307/2347565 · Cited by 1,642
Huber, P. J. (1997) · Springer Series in Statistics · doi:10.1007/978-1-4612-0667-5_6 · Cited by 1,551
Rates of convergence of the Hastings and Metropolis algorithms
Mengersen, K. L., & Tweedie, R. L. (1996) · The Annals of Statistics · doi:10.1214/aos/1033066201 · Cited by 553
LIU, J. S., WONG, W. H., & KONG, A. (1994) · Biometrika · doi:10.1093/biomet/81.1.27 · Cited by 542
Cited by
On sequential Monte Carlo sampling methods for Bayesian filtering
Doucet, A., Godsill, S., & Andrieu, C. (2000) · Statistics and Computing · doi:10.1023/a:1008935410038 · Cited by 4,411
An introduction to MCMC for machine learning.
Andrieu, C., de Freitas, N., Doucet, A., & Jordan, M. I. (2003) · Machine Learning · doi:10.1023/a:1020281327116 · Cited by 2,451
Polis, G. A., Anderson, W. B., & Holt, R. D. (1997) · Annual Review of Ecology and Systematics · doi:10.1146/annurev.ecolsys.28.1.289 · Cited by 2,362
Sequential Monte Carlo Methods for Dynamic Systems
Liu, J. S., & Chen, R. (1998) · Journal of the American Statistical Association · doi:10.1080/01621459.1998.10473765 · Cited by 2,191
Rao-Blackwellised Particle Filtering for Dynamic Bayesian Networks
Murphy, K., & Russell, S. (2001) · Sequential Monte Carlo Methods in Practice · doi:10.1007/978-1-4757-3437-9_24 · Cited by 1,157
Metadata
- Authors
- Casella, G.
- Venue
- Biometrika
- Publisher
- Oxford University Press (OUP)
- Published
- 1996-03-01
- Volume
- 83
- Issue
- 1
- Pages
- 81-94
- ISSN
- 0006-3444 (ISSN-L)
- 1464-3510
- OpenAlex
- W2071988465
- Cited by
- 546
- References
- 12
- FWCI
- 4.75
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Rao-Blackwellisation of sampling schemes. https://app.cochat.ai/papers/10.1093/biomet/83.1.81
- The paper
- Casella, G. (1996). Rao-Blackwellisation of sampling schemes. Biometrika. https://doi.org/10.1093/biomet/83.1.81
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.