Generalized Posterior Calibration via Sequential Monte Carlo Sampler
Masahiro Tanaka

TL;DR
This paper introduces an efficient sequential Monte Carlo-based method for calibrating generalized posterior distributions, improving computational speed while maintaining accurate coverage in statistical learning models.
Contribution
It develops a novel SMC sampler approach that reduces computational costs in generalized posterior calibration compared to existing bootstrap-based methods.
Findings
Significantly faster calibration than the original GPC algorithm.
Maintains nominal frequentist coverage in various models.
Efficiently leverages the similarity between learning rate and inverse temperature.
Abstract
As the amount and complexity of available data increases, the need for robust statistical learning becomes more pressing. To enhance resilience against model misspecification, the generalized posterior inference method adjusts the likelihood term by exponentiating it with a learning rate, thereby fine-tuning the dispersion of the posterior distribution. This study proposes a computationally efficient strategy for selecting an appropriate learning rate. The proposed approach builds upon the generalized posterior calibration (GPC) algorithm, which is designed to select a learning rate that ensures nominal frequentist coverage. This algorithm, which evaluates the coverage probability using bootstrap samples, has high computational costs because of the repeated posterior simulations needed for bootstrap samples. To address this limitation, the study proposes an algorithm that combines…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsManufacturing Process and Optimization
