Metraipolis › archive › dc_ff3aff033523
Three Case Studies of Two-stage MCMC for Fast Bayesian Inference of Large Spatio-temporal Data — arXiv:2609.14774
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.14774
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T00:36:31.551Z
- SHA-256 of the archived text
21aad95bfc4e5f5027fb81d95c2d60c7055091667eacdc5fb0f9c0b1e3f92d06- Stable URL of this page
https://metraipolis.com/documento/dc_ff3aff033523
How to cite
Three Case Studies of Two-stage MCMC for Fast Bayesian Inference of Large Spatio-temporal Data — arXiv:2609.14774 — arXiv (en), https://arxiv.org/abs/2609.14774 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ff3aff033523 (Metraipolis archive dc_ff3aff033523, sha256 21aad95bfc4e5f5027fb81d95c2d60c7055091667eacdc5fb0f9c0b1e3f92d06)
BibTeX
@misc{dcff3aff033523,
title = {Three Case Studies of Two-stage MCMC for Fast Bayesian Inference of Large Spatio-temporal Data — arXiv:2609.14774},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.14774},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ff3aff033523; sha256 21aad95bfc4e5f5027fb81d95c2d60c7055091667eacdc5fb0f9c0b1e3f92d06},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.14774. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
High dimensional spatio-temporal models can quickly run up against computational limitations. Recursive or multi-stage Bayesian algorithms are one way to address this computational challenge. Here we consider an increasingly used two-stage algorithm. The first stage models locations independently and in parallel across space. Resampling particles from this stage-one model with Metropolis-within-Gibbs methods and suitably computed acceptance ratios can impose spatial dependence across locations at a low computational cost, while targeting the same posterior distribution as the single-stage MCMC algorithm at a fraction of the overall computational cost. In this paper we show three complete examples of how two-stage MCMC algorithms can be used to efficiently fit Bayesian spatio-temporal models to large datasets. Specifically, we consider: a spatio-temporal self-exciting count model on areal data utilizing intrinsic conditional autoregressive (ICAR) prior distributions; a spatio-temporal model of point-referenced data using a stationary, isotropic distance-based covariance function; and a binary model fit to data on a spatial lattice utilizing a latent Gaussian process to capture all spatio-temporal dependence. In each example, we define the model and describe the corresponding two-stage MCMC approach. We then compare the resulting posterior samples and computational efficiency with those obtained using a standard single-stage MCMC algorithm. While varying across the three examples and numerous parameters, the two-stage approach often achieves roughly an order of magnitude higher computational efficiency, with the two-stage and single-stage algorithms producing closely agreeing posterior samples. Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-09-15 in stat.ME). Categorie arXiv: Methodology (stat.ME) ; Applications (stat.AP). Pagina del lavoro: https://arxiv.org/abs/2609.14774 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-16T00:16:03.212Z dalla pagina https://arxiv.org/catchup/stat.ME/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).