Skip to content
DraconiticResearch
Search Sources API
197,768 studies31 sourcesUpdated 2 min ago
PreprintCC BY-NC-ND 4.0arXiv

Efficient Bootstrap Calibration of Generalized Posteriors with Importance Reweighting

Abstract

The learning rate of a generalized posterior governs posterior uncertainty but typically has no canonical value. Generalized posterior calibration (GPC) selects this rate by matching bootstrap-estimated credible-interval coverage to its nominal level, often requiring repeated posterior simulation. We propose GPC via importance reweighting (GPC-IRW), which reuses draws from a reference posterior fitted to the original data across bootstrap resamples and candidate learning rates. For quantile-based intervals of a scalar functional, we express the coverage criterion in terms of bootstrap posterior cumulative distribution functions, avoiding computation of individual bootstrap credible intervals. Safeguards based on importance-weight effective sample size and proximity to coverage-decision boundaries invoke reweighting from cached bootstrap-specific draws or direct posterior simulation when necessary. Under the stated regularity conditions, with numerical error tending to zero, we show that median-centered calibration preserves the first-order learning-rate target and achieves asymptotically nominal coverage. The approach extends to independent clusters through cluster-level resampling. Simulations yield coverage and interval lengths comparable to those of existing GPC algorithms at substantially lower computational cost. In an exoplanet mass-radius analysis, GPC-IRW achieves 6.7- and 9.6-fold speedups over MCMC-based calibration in the single-planet and full-sample analyses, respectively, while illustrating the effects of within-host dependence.

Related

  1. Fast Calibration of Generalized Posteriors via Dirichlet Reweighting
    Shonosuke Sugasawa
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  2. Computationally Efficient Experimental Design with Generalized Posteriors
    Luke Hagar, James M. McGree
    arXivPreprintCC BY-NC-ND 4.0Full textStatisticsarXiv
  3. On the asymptotic behaviour of α-divergence generalized posteriors
    Ioar Casado-Telletxea, Omar Rivasplata
    arXivPreprintCC BY-NC-ND 4.0Full textStatisticsarXiv
  4. Amortized ratio-estimation importance sampling and localized simulation-based calibration for intractable likelihoods
    Umberto Picchini
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  5. Efficient Importance Sampling of Brownian Motion Avoiding Poissonian Obstacles for Long Time
    Jose Blanchet, Paul Dupuis, Hao Liu
    arXivPreprintCC BY 4.0Full textProbabilityarXiv
BibTeX
@misc{tanaka2026efficient,
  title = {{Efficient Bootstrap Calibration of Generalized Posteriors with Importance Reweighting}},
  author = {Masahiro Tanaka},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.37232},
  eprint = {2610.37232},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.37232},
  note = {CC BY-NC-ND 4.0},
}
RIS
TY  - UNPB
TI  - Efficient Bootstrap Calibration of Generalized Posteriors with Importance Reweighting
AU  - Masahiro Tanaka
PY  - 2026
DA  - 2026/10/27
PB  - arXiv
DO  - 10.48550/arxiv.2610.37232
UR  - https://arxiv.org/abs/2610.37232
AB  - The learning rate of a generalized posterior governs posterior uncertainty but typically has no canonical value. Generalized posterior calibration (GPC) selects this rate by matching bootstrap-estimated credible-interval coverage to its nominal level, often requiring repeated posterior simulation. We propose GPC via importance reweighting (GPC-IRW), which reuses draws from a reference posterior fitted to the original data across bootstrap resamples and candidate learning rates. For quantile-based intervals of a scalar functional, we express the coverage criterion in terms of bootstrap posterior cumulative distribution functions, avoiding computation of individual bootstrap credible intervals. Safeguards based on importance-weight effective sample size and proximity to coverage-decision boundaries invoke reweighting from cached bootstrap-specific draws or direct posterior simulation when necessary. Under the stated regularity conditions, with numerical error tending to zero, we show that median-centered calibration preserves the first-order learning-rate target and achieves asymptotically nominal coverage. The approach extends to independent clusters through cluster-level resampling. Simulations yield coverage and interval lengths comparable to those of existing GPC algorithms at substantially lower computational cost. In an exoplanet mass-radius analysis, GPC-IRW achieves 6.7- and 9.6-fold speedups over MCMC-based calibration in the single-planet and full-sample analyses, respectively, while illustrating the effects of within-host dependence.
ER  -