Efficient prior sensitivity analysis for Bayesian model comparison
Zixiao Hu, Jason D. McEwen
TL;DR
This work tackles the prior sensitivity of Bayesian evidence in model comparison by introducing a post-hoc, sampling-agnostic framework based on the learned harmonic mean estimator (LHME). It reuses existing posterior samples through importance-resampling to evaluate alternative priors, using a learned target density to stabilize the evidence computation and a two-stage diagnostics (Pareto-$\hat{k}$ and fractional ESS) to decide when retraining is needed. The approach reproduces evidences obtained from full re-fitting and nested sampling across toy problems and a cosmological case, achieving up to $\sim 6{,}000\times$ speed-ups. The method enables efficient, transparent assessment of prior influence on model comparison with practical applicability across domains; code will be publicly released in the Harmonic package.
Abstract
Bayesian model comparison implements Occam's razor through its sensitivity to the prior. However, prior-dependence makes it important to assess the influence of plausible alternative priors. Such prior sensitivity analyses for the Bayesian evidence are expensive, either requiring repeated, costly model re-fits or specialised sampling schemes. By exploiting the learned harmonic mean estimator (LHME) for evidence calculation we decouple sampling and evidence calculation, allowing resampled posterior draws to be used directly to calculate the evidence without further likelihood evaluations. This provides an alternative approach to prior sensitivity analysis for Bayesian model comparison that dramatically alleviates the computational cost and is agnostic to the method used to generate posterior samples. We validate our method on toy problems and a cosmological case study, reproducing estimates obtained by full Markov chain Monte Carlo (MCMC) sampling and nested sampling re-fits. For the cosmological example considered our approach achieves up to $6000\times$ lower computational cost.
