Powered embarrassing parallel MCMC sampling in Bayesian inference, a weighted average intuition

DOI10.1016/J.CSDA.2017.05.005zbMath1466.62145OpenAlexW2619768869MaRDI QIDQ1658367

Geoffrey K. F. Tso, Lufan Long, Song Li

Publication date: 14 August 2018

Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.csda.2017.05.005

zbMATH Keywords

Markov chain Monte Carlomaximum likelihoodweighted averagepowered parallel

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08)

Related Items (2)

Parallel generalized elliptical slice sampling with adaptive regional pseudo-priors ⋮ Multi-objective optimization using statistical models

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An introduction to MCMC for machine learning
• GPU accelerated MCMC for modeling terrorist activity
• SIMD parallel MCMC sampling with applications for big-data Bayesian analytics
• Markov chains for exploring posterior distributions. (With discussion)
• An adaptive version for the Metropolis adjusted Langevin algorithm with a truncated drift
• Handbook of Markov Chain Monte Carlo
• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
• Equation of State Calculations by Fast Computing Machines
• Monte Carlo sampling methods using Markov chains and their applications

This page was built for publication: Powered embarrassing parallel MCMC sampling in Bayesian inference, a weighted average intuition