The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Partially Collapsed Gibbs Samplers: Theory and Methods
Abstract
Ever-increasing computational power, along with ever–more sophisticated statistical computing techniques, is making it possible to fit ever–more complex statistical models. Among the more computationally intensive methods, the Gibbs sampler is popular because of its simplicity and power to effectively generate samples from a high-dimensional probability distribution. Despite its simple implementation and description, however, the Gibbs sampler is criticized for its sometimes slow convergence, especially when it is used to fit highly structured complex models. Here we present partially collapsed Gibbs sampling strategies that improve the convergence by capitalizing on a set of functionally incompatible conditional distributions. Such incompatibility generally is avoided in the construction of a Gibbs sampler, because the resulting convergence properties are not well understood. We introduce three basic tools (marginalization, permutation, and trimming) that allow us to transform a Gibbs sampler into a partially collapsed Gibbs sampler with known stationary distribution and faster convergence.
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
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444
Stochastic relaxation, gibbs distributions, and the bayesian restoration of images.
Geman, S., & Geman, D. (1984) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1984.4767596 · Cited by 17,949 · cited 1×
“The ordinary Gibbs sampler (Geman and Geman 1984) begins with the joint posterior distribution of a set of unknown quantities and updates groups of these quantities by sampling them from their conditional distributions under the joint posterior distribution.”
BackgroundInference from iterative simulation using multiple sequences
Gelman, A., & Rubin, D. B. (1992) · Statistical Science · doi:10.1214/ss/1177011136 · Cited by 16,627
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
Monte Carlo Strategies in Scientific Computing
Liu, J. S. (2004) · Springer Series in Statistics · doi:10.1007/978-0-387-76371-2 · Cited by 2,690
Maximum likelihood estimation via the ECM algorithm: A general framework
MENG, X.-L., & RUBIN, D. B. (1993) · Biometrika · doi:10.1093/biomet/80.2.267 · Cited by 1,861
van Dyk, D. A., & Meng, X.-L. (2001) · Journal of Computational and Graphical Statistics · doi:10.1198/10618600152418584 · Cited by 1,052
Self-citationThe EM Algorithm—an Old Folk-song Sung to a Fast New Tune
Meng, X.-L., & Van Dyk, D. (1997) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/1467-9868.00082 · Cited by 802
Self-citationThe Skew-normal Distribution and Related Multivariate Families*
AZZALINI, A. (2005) · Scandinavian Journal of Statistics · doi:10.1111/j.1467-9469.2005.00426.x · Cited by 701
The Collapsed Gibbs Sampler in Bayesian Computations with Applications to a Gene Regulation Problem
Liu, J. S. (1994) · Journal of the American Statistical Association · doi:10.1080/01621459.1994.10476829 · Cited by 641
The ECME algorithm: A simple extension of EM and ECM with faster monotone convergence
LIU, C., & RUBIN, D. B. (1994) · Biometrika · doi:10.1093/biomet/81.4.633 · Cited by 613
Spatial Statistics and Bayesian Computation
Besag, J., & Green, P. J. (1993) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1993.tb01467.x · Cited by 542
LIU, J. S., WONG, W. H., & KONG, A. (1994) · Biometrika · doi:10.1093/biomet/81.1.27 · Cited by 542
Parameter Expansion for Data Augmentation
Liu, J. S., & Wu, Y. N. (1999) · Journal of the American Statistical Association · doi:10.1080/01621459.1999.10473879 · Cited by 356
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
Analysis of energy spectra with low photon counts via Bayesian posterior simulation
van Dyk, D. A., & Connors, A. (2001) · Cited by 83
Partially Collapsed Gibbs Samplers: Illustrations and Applications
Park, T., & van Dyk, D. A. (2009) · Journal of Computational and Graphical Statistics · doi:10.1198/jcgs.2009.08108 · Cited by 82
Self-citationFitting Mixed-Effects Models Using Efficient EM-Type Algorithms
van Dyk, D. A. (2000) · Journal of Computational and Graphical Statistics · doi:10.1080/10618600.2000.10474867 · Cited by 50
Dobigeon, N., Tourneret, J., & Scargle, J. D. (2007) · Open Archive Toulouse Archive Ouverte (University of Toulouse) · Cited by 47
NESTING EM ALGORITHMS FOR COMPUTATIONAL EFFICIENCY
van Dyk, D. A. (2000) · Cited by 35
Searching for Narrow Emission Lines in X‐Ray Spectra: Computation and Methods
Park, T., van Dyk, D. A., & Siemiginowska, A. (2008) · The Astrophysical Journal · doi:10.1086/591631 · Cited by 32
Self-citationAlternating Subspace-Spanning Resampling to Accelerate Markov Chain Monte Carlo Simulation
Liu, C. (2003) · Journal of the American Statistical Association · doi:10.1198/016214503388619148 · Cited by 19
On the Orderings and Groupings of Conditional Maximizations within ECM-Type Algorithms
van Dyk, D. A., & Meng, X. (1997) · Journal of Computational and Graphical Statistics · doi:10.1080/10618600.1997.10474737 · Cited by 14
Metadata
- Authors
- van Dyk, D. A., & Park, T.
- Venue
- Journal of the American Statistical Association
- Publisher
- Informa UK Limited
- Published
- 2008-06-01
- Volume
- 103
- Issue
- 482
- Pages
- 790-796
- ISSN
- 0162-1459 (ISSN-L)
- 1537-274X
- OpenAlex
- W1989692914
- Cited by
- 267
- References
- 23
- FWCI
- 8.38
- 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.