Divide-and-conquer Metropolis-Hastings samplers with matched samples

DOI10.1214/23-bjps589OpenAlexW4390413810MaRDI QIDQ6138717

Hang Qian

Publication date: 16 January 2024

Published in: Brazilian Journal of Probability and Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1214/23-bjps589

zbMATH Keywords

BayesMarkov chain Monte Carloparallel computingbig data

Mathematics Subject Classification ID

Statistics (62-XX) Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Zig-Zag Process and Super-Efficient Sampling for Bayesian Analysis of Big Data
• Merging MCMC subposteriors through Gaussian-process approximations
• Comparing consensus Monte Carlo strategies for distributed Bayesian computation
• Following a Moving Target—Monte Carlo Inference for Dynamic Bayesian Models
• A sequential particle filter method for static models
• Robust and Scalable Bayes via a Median of Subset Posterior Measures
• Equation of State Calculations by Fast Computing Machines
• Speeding Up MCMC by Efficient Data Subsampling
• Monte Carlo sampling methods using Markov chains and their applications

This page was built for publication: Divide-and-conquer Metropolis-Hastings samplers with matched samples