Improving efficiency of data augmentation algorithms using Peskun's theorem
type: Item
instance of: scholarly article
title: Improving efficiency of data augmentation algorithms using Peskun's theorem
zbMATH Open document ID: 1342.65060
author: Vivekananda Roy
published in: Computational Statistics
publication date: 2016-08-04T00:00:00Z
Mathematics Subject Classification ID: 62-08
Mathematics Subject Classification ID: 65C40
zbMATH DE Number: 6609292
zbMATH Keywords: modified data augmentation
zbMATH Keywords: efficiency ordering
zbMATH Keywords: MCMC
zbMATH Keywords: Peskun ordering
zbMATH Keywords: Rao Blackwellization
Wikidata QID: Q60521520
describes a project that uses: R
MaRDI profile type: Publication
full work available at URL: s00180-015-0632-4
OpenAlex ID: W2287837679
cites work: Markov Chains
cites work: Q3172410
cites work: A theoretical comparison of the data augmentation, marginal augmentation and PX-DA algorithms
cites work: Improving the convergence properties of the data augmentation algorithm with an application to Bayesian mixture modeling
cites work: On the Markov chain central limit theorem
cites work: Convergence of Conditional Metropolis-Hastings Samplers
cites work: A spectral analytic comparison of trace-class data augmentation algorithms and their sandwich variants
cites work: Central limit theorem for additive functionals of reversible Markov processes and applications to simple exclusions
cites work: A novel sandwich algorithm for empirical Bayes analysis of rank data
cites work: Miscellanea. Peskun's theorem and a modified discrete-state Gibbs sampler
cites work: Covariance structure of the Gibbs sampler with applications to the comparisons of estimators and augmentation schemes
cites work: Parameter Expansion for Data Augmentation
cites work: Seeking efficient data augmentation schemes via conditional and marginal augmentation
cites work: Markov chains and stochastic stability
cites work: A note on Metropolis-Hastings kernels for general state spaces
cites work: Optimum Monte-Carlo sampling using Markov chains
cites work: General state space Markov chains and MCMC algorithms
cites work: Asymptotic Variance and Convergence Rates of Nearly-Periodic Markov Chain Monte Carlo Algorithms
cites work: Efficient estimation of the link function parameter in a robust Bayesian binary regression model
cites work: Q4340096
cites work: The Calculation of Posterior Distributions by Data Augmentation
DOI: 10.1007/S00180-015-0632-4
description: scientific article; zbMATH DE number 6609292