REVIEW 3 cited by
Parallelizing MCMC via Weierstrass Sampler
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
With the rapidly growing scales of statistical problems, subset based communication-free parallel MCMC methods are a promising future for large scale Bayesian analysis. In this article, we propose a new Weierstrass sampler for parallel MCMC based on independent subsets. The new sampler approximates the full data posterior samples via combining the posterior draws from independent subset MCMC chains, and thus enjoys a higher computational efficiency. We show that the approximation error for the Weierstrass sampler is bounded by some tuning parameters and provide suggestions for choice of the values. Simulation study shows the Weierstrass sampler is very competitive compared to other methods for combining MCMC chains generated for subsets, including averaging and kernel smoothing.
Forward citations
Cited by 3 Pith papers
-
Distributed and recursive Bayesian inference for Big Data and complex spatio-temporal models
Distributed and recursive INLA with data-and-latent-field partitioning recovers latent-field posteriors close to full-data inference while cutting cost for large spatio-temporal models.
-
Multivariate spectral downscaling for PM2.5 species
Combining frequency-decomposed CMAQ output with cross-species correlations improves temporal prediction of speciated PM2.5 over linear downscalers.
-
Mini-batch Metropolis-Hastings MCMC with Reversible SGLD Proposal
A mini-batch Metropolis-Hastings algorithm has an approximately tempered stationary distribution, provably preserves posterior modes, and pairs with a reversible stochastic-gradient proposal for high-dimensional neura...
Discussion (0). Continue with ORCID to comment.