Fast Calibration of Generalized Posteriors via Dirichlet Reweighting

While generalized Bayesian inference offers a principled approach to uncertainty quantification under general loss functions, its practical performance depends critically on the choice of the learning rate. Generalized posterior calibration, which selects the learning rate so that the resulting credible sets attain nominal frequentist coverage, is computationally intensive because it relies on repeated posterior sampling across bootstrap datasets and candidate learning rates. To overcome this practical difficulty, we propose a fast calibration method that combines Dirichlet-weighted bootstrap perturbations with importance sampling to estimate coverage while reducing the need for repeated posterior sampling. We further extend the framework to hierarchical models, where group-specific learning rates are calibrated and stabilized via shrinkage. Illustrative examples using quantile regression, support vector machines, and hierarchical Huber regression demonstrate that the proposed method substantially reduces computational cost while maintaining accurate calibration.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-10-26
DOI
https://doi.org/10.48550/arxiv.2610.35187
Primary Topic
Markov Chains and Monte Carlo Methods
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

Fast Calibration of Generalized Posteriors via Dirichlet Reweighting

Shonosuke Sugasawa
arXiv (Cornell University)
Markov Chains and Monte Carlo Methods
preprint

Fast Calibration of Generalized Posteriors via Dirichlet Reweighting

Shonosuke Sugasawa
preprint en

Abstract

While generalized Bayesian inference offers a principled approach to uncertainty quantification under general loss functions, its practical performance depends critically on the choice of the learning rate. Generalized posterior calibration, which selects the learning rate so that the resulting credible sets attain nominal frequentist coverage, is computationally intensive because it relies on repeated posterior sampling across bootstrap datasets and candidate learning rates. To overcome this practical difficulty, we propose a fast calibration method that combines Dirichlet-weighted bootstrap perturbations with importance sampling to estimate coverage while reducing the need for repeated posterior sampling. We further extend the framework to hierarchical models, where group-specific learning rates are calibrated and stabilized via shrinkage. Illustrative examples using quantile regression, support vector machines, and hierarchical Huber regression demonstrate that the proposed method substantially reduces computational cost while maintaining accurate calibration.

arXiv (Cornell University)
Markov Chains and Monte Carlo Methods
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon