• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • CEREMADE (UMR CNRS 7534)
  • CEREMADE : Publications
  • View Item
  •   BIRD Home
  • CEREMADE (UMR CNRS 7534)
  • CEREMADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
Thumbnail

Improving the Convergence Properties of the Data Augmentation Algorithm with an Application to Bayesian Mixture Modelling

Robert, Christian P.; Roy, Vivekananda; Hobert, James P. (2011), Improving the Convergence Properties of the Data Augmentation Algorithm with an Application to Bayesian Mixture Modelling, Statistical Science, 26, 3, p. 332-351. http://dx.doi.org/10.1214/11-STS365

View/Open
STS0911-004R1A0-1.pdf (399.0Kb)
Type
Article accepté pour publication ou publié
Date
2011
Journal name
Statistical Science
Volume
26
Number
3
Publisher
Institute of Mathematical Statistics
Pages
332-351
Publication identifier
http://dx.doi.org/10.1214/11-STS365
Metadata
Show full item record
Author(s)
Robert, Christian P.
Roy, Vivekananda
Hobert, James P.
Abstract (EN)
The reversible Markov chains that drive the data augmentation (DA) and sandwich algorithms define self-adjoint operators whose spectra encode the convergence properties of the algorithms. When the target distribution has uncountable support, as is nearly always the case in practice, it is generally quite difficult to get a handle on these spectra. We show that, if the augmentation space is finite, then (under regularity conditions) the operators defined by the DA and sandwich chains are compact, and the spectra are finite subsets of [0; 1). Moreover, we prove that the spectrum of the sandwich operator dominates the spectrum of the DA operator in the sense that the ordered elements of the former are all less than or equal to the corresponding elements of the latter. As a concrete example, we study a widely used DA algorithm for the exploration of posterior densities associated with Bayesian mixture models (Diebolt and Robert, 1994). In particular, we compare this mixture DA algorithm with an alternative algorithm proposed by Frühwirth-Schnatter (2001) that is based on random label switching.
Subjects / Keywords
Markov chains; Data augmentation; sandwich algorithms; Bayesian mixture models

Related items

Showing items related by title and author.

  • Thumbnail
    A mixture representation of π with applications in Markov chain Monte Carlo and perfect sampling 
    Hobert, James P.; Robert, Christian P. (2004) Article accepté pour publication ou publié
  • Thumbnail
    Using a Markov Chain to Construct a Tractable Approximation of an Intractable Probability Distribution 
    Hobert, James P.; Jones, Galin L.; Robert, Christian P. (2006) Article accepté pour publication ou publié
  • Thumbnail
    Bayesian Modelling and Inference on Mixtures of Distributions 
    Marin, Jean-Michel; Mengersen, Kerrie; Robert, Christian P. (2005) Chapitre d'ouvrage
  • Thumbnail
    A Mixture Approach to Bayesian Goodness of Fit 
    Robert, Christian P.; Rousseau, Judith (2002) Document de travail / Working paper
  • Thumbnail
    Bayesian Mixtures of Triangular distributions with application to Goodness-of-Fit Testing 
    Rousseau, Judith; Mengersen, Kerrie; McVinish, Ross (2005) Document de travail / Working paper
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo