Powered embarrassing parallel MCMC sampling in Bayesian inference, a weighted average intuition
From MaRDI portal
Publication:1658367
Recommendations
- Parallelizing MCMC sampling via space partitioning
- Parallel MCMC with generalized elliptical slice sampling
- Double-parallel Monte Carlo for Bayesian analysis of big data
- Parallel local approximation MCMC for expensive models
- Parallel Markov chain Monte Carlo for Bayesian hierarchical models with big data, in two stages
Cites work
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 735099 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- An adaptive version for the Metropolis adjusted Langevin algorithm with a truncated drift
- An introduction to MCMC for machine learning
- Equation of state calculations by fast computing machines
- GPU accelerated MCMC for modeling terrorist activity
- Handbook of Markov Chain Monte Carlo
- MCMC using Hamiltonian dynamics
- Markov chains for exploring posterior distributions. (With discussion)
- Monte Carlo sampling methods using Markov chains and their applications
- SIMD parallel MCMC sampling with applications for big-data Bayesian analytics
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
Cited in
(2)
This page was built for publication: Powered embarrassing parallel MCMC sampling in Bayesian inference, a weighted average intuition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1658367)
