The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Seeking efficient data augmentation schemes via conditional and marginal augmentation
Abstract
Data augmentation, sometimes known as the method of auxiliary variables, is a powerful tool for constructing optimisation and simulation algorithms. In the context of optimisation, Meng & van Dyk (1997, 1998) reported several successes of the 'working parameter' approach for constructing efficient data-augmentation schemes for fast and simple EM-type algorithms. This paper investigates the use of working parameters in the context of Markov chain Monte Carlo, in particular in the context of Tanner & Wong's (1987) data augmentation algorithm, via a theoretical study of two working-parameter approaches, the conditional augmentation approach and the marginal augmentation approach. Posterior sampling under the univariate t model is used as a running example, which particularly illustrates how the marginal augmentation approach obtains a fast-mixing positive recurrent Markov chain by first constructing a nonpositive recurrent Markov chain in a larger space.
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
Parameter expansion to accelerate EM: the PX-EM algorithm
Liu, C. (1998) · Biometrika · doi:10.1093/biomet/85.4.755 · Cited by 433
Cited by
van Dyk, D. A., & Meng, X.-L. (2001) · Journal of Computational and Graphical Statistics · doi:10.1198/10618600152418584 · Cited by 1,052
Self-citationOptimization Transfer Using Surrogate Objective Functions
Lange, K., Hunter, D. R., & Yang, I. (2000) · Journal of Computational and Graphical Statistics · doi:10.1080/10618600.2000.10474858 · Cited by 808
An empirical survey of data augmentation for time series classification with neural networks
Iwana, B. K., & Uchida, S. (2021) · PLOS ONE · doi:10.1371/journal.pone.0254841 · Cited by 725
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
Efficient Construction of Reversible Jump Markov Chain Monte Carlo Proposal Distributions
Brooks, S. P., Giudici, P., & Roberts, G. O. (2003) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/1467-9868.03711 · Cited by 310
Metadata
- Authors
- Meng, X.-L.
- Venue
- Biometrika
- Publisher
- Oxford University Press (OUP)
- Published
- 1999-06-01
- Volume
- 86
- Issue
- 2
- Pages
- 301-320
- ISSN
- 0006-3444 (ISSN-L)
- 1464-3510
- OpenAlex
- W2064387721
- Cited by
- 179
- References
- 1
- FWCI
- 7.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: Seeking efficient data augmentation schemes via conditional and marginal augmentation. https://app.cochat.ai/papers/10.1093/biomet/86.2.301
- The paper
- Meng, X.-L. (1999). Seeking efficient data augmentation schemes via conditional and marginal augmentation. Biometrika. https://doi.org/10.1093/biomet/86.2.301
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.