Improving efficiency of data augmentation algorithms using Peskun's theorem
From MaRDI portal
Publication:736654
DOI10.1007/s00180-015-0632-4zbMath1342.65060OpenAlexW2287837679WikidataQ60521520 ScholiaQ60521520MaRDI QIDQ736654
Publication date: 4 August 2016
Published in: Computational Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00180-015-0632-4
Computational methods for problems pertaining to statistics (62-08) Numerical analysis or methods applied to Markov chains (65C40)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Improving the convergence properties of the data augmentation algorithm with an application to Bayesian mixture modeling
- A spectral analytic comparison of trace-class data augmentation algorithms and their sandwich variants
- Markov chains and stochastic stability
- General state space Markov chains and MCMC algorithms
- On the Markov chain central limit theorem
- Central limit theorem for additive functionals of reversible Markov processes and applications to simple exclusions
- A note on Metropolis-Hastings kernels for general state spaces
- Efficient estimation of the link function parameter in a robust Bayesian binary regression model
- A novel sandwich algorithm for empirical Bayes analysis of rank data
- A theoretical comparison of the data augmentation, marginal augmentation and PX-DA algorithms
- Optimum Monte-Carlo sampling using Markov chains
- The Calculation of Posterior Distributions by Data Augmentation
- Miscellanea. Peskun's theorem and a modified discrete-state Gibbs sampler
- Markov Chains
- Seeking efficient data augmentation schemes via conditional and marginal augmentation
- Covariance structure of the Gibbs sampler with applications to the comparisons of estimators and augmentation schemes
- Asymptotic Variance and Convergence Rates of Nearly-Periodic Markov Chain Monte Carlo Algorithms
- Parameter Expansion for Data Augmentation
- Convergence of Conditional Metropolis-Hastings Samplers
This page was built for publication: Improving efficiency of data augmentation algorithms using Peskun's theorem
