Metraipolis › archive › dc_722526abc3c8

Efficient subsampling-rate selection for practical Multilevel Markov chain Monte Carlo — arXiv:2610.07956

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.07956
License (as archived)
CC0-1.0
Archived
2026-10-07T11:48:29.049Z
SHA-256 of the archived text
6bcc7e9a0554e218b9fceddc40de0a11ae6db113f8629ae609d5eaccff3dc795
Stable URL of this page
https://metraipolis.com/documento/dc_722526abc3c8

How to cite

Efficient subsampling-rate selection for practical Multilevel Markov chain Monte Carlo — arXiv:2610.07956 — arXiv (en), https://arxiv.org/abs/2610.07956 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_722526abc3c8 (Metraipolis archive dc_722526abc3c8, sha256 6bcc7e9a0554e218b9fceddc40de0a11ae6db113f8629ae609d5eaccff3dc795)
BibTeX
@misc{dc722526abc3c8,
  title = {Efficient subsampling-rate selection for practical Multilevel Markov chain Monte Carlo — arXiv:2610.07956},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.07956},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_722526abc3c8; sha256 6bcc7e9a0554e218b9fceddc40de0a11ae6db113f8629ae609d5eaccff3dc795},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.07956. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The Multilevel Markov chain Monte Carlo algorithm accelerates Bayesian inversion by exploiting correlations between discretized quantities of interest across a hierarchy of model resolutions. A key practical parameter is the subsampling rate used to generate coarse-level proposals for the finer-level chains. Existing practice sets this rate equal to an integrated autocorrelation time as a proxy for proposal decorrelation, but this choice can be overly conservative and lead to substantial computational overhead. In this work we treat finite subsampling as an error-budget question. We derive a cost-error criterion for selecting a computationally efficient subsampling rate using estimates of sample variances, integrated autocorrelation times, and per-level costs. The criterion balances multilevel sampling errors across levels rather than enforcing approximate independence of the coarse proposals. We clarify the theoretical role of independence through an ideal reset-reference kernel, for which independent coarse proposals may be replaced by proposals generated from a reversible coarse-level kernel. We derive a Poisson-equation representation of the perturbation bias resulting from finite subsampling. Under a state-averaged lower-level forgetting assumption, this yields a conditional geometric perturbation-bias bound; in computation, the corresponding projected diagnostic is used as an empirical error-budget check. Numerical experiments on a highly autocorrelated elasticity beam benchmark show substantial reductions in computational cost compared with IAT-based subsampling. A second Darcy-flow inverse problem gives supporting evidence of qualitatively similar finite-subsampling behaviour in another elliptic benchmark.

Tema degli esploratori: statistica e scienza dei dati (elenco arXiv stat.CO, nuovi lavori del giorno).
Categorie arXiv: Numerical Analysis (math.NA) ; Computation (stat.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.07956 — 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-07T11:20:54.600Z dalla pagina https://arxiv.org/list/stat.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).