This work characterise the annealed objective's stability--bias trade-off through perturbation and Bayesian regret bounds, derive explicit budget-dependent expected total-variation control for the ideal EP-weighted UR, and establish an expected total-variation rate for the implemented proxy.
Abstract
Bayesian inference is difficult when likelihood evaluations are expensive and budgets are limited. We propose sampling-based adaptive active learning (SALE), a Gaussian-process (GP) framework for surrogate-based Bayesian inference. SALE uses the expected posterior (EP) induced by normalised GP sample paths as a common sequential-design measure: it defines a posterior-guided search region and weights uncertainty reduction (UR). A state-dependent rule allocates evaluations between Bayesian optimisation (BO) for localisation and UR for calibration. For BO, an annealed objective interpolates between the EP and Thompson sampling while regularising the query law against surrogate-path perturbations. For UR, we introduce an ideal EP-weighted rule and a computationally feasible proxy. Under a Bayesian GP framework, we characterise the annealed objective's stability--bias trade-off through perturbation and Bayesian regret bounds, derive explicit budget-dependent expected total-variation control for the ideal EP-weighted UR, and establish an expected total-variation rate for the implemented proxy. Across analytic benchmarks and simulated likelihoods, SALE reduces total-variation error across all considered settings while avoiding severe failures seen under several external baselines. Econometric and astrophysical examples demonstrate its practical value.
Bayesian contextual optimization (BCO) is proposed, a framework that maintains a Gibbs posterior over the parameter space that weights candidate models by their empirical decision quality rather than statistical fit, thereby avoiding commitment to a potentially misspecified likelihood while encoding the full distributi...
Zhuo-Jun Xie, Adam F. Abdin, Yi-Ping Fang· 0 citations
A unified framework, KENDO (Kernel ENsemble Disagreement-aware Operator), is proposed that integrates Ensemble Gaussian Processes (EGP) with disagreement-aware acquisition strategies and extends the approach to multi-objective optimization via random scalarization that preserves the single-optimizer conditioning struct...
Heng Zhang, Hao-Tian Xiang, Konstantinos D. Polyzos et al.· 1 citation
Dynamic black-box optimization presents significant challenges for Bayesian Optimization (BO), as the objective function evolves over time, causing optimal locations to shift continuously. Existing dynamic BO (DBO) methods using standard acquisition functions such as Upper Confidence Bound (UCB) fail to explicitly acco...
Merlin Angel Kelly, R. Patel, Alexander Thomas et al.· 1 citation
Results show that SME-BETEL credible sets are asymptotically calibrated to the sampling variability of the score matching estimator, yielding valid frequentist coverage under model misspecification and prove a Bernstein-von Mises theorem for the SME-BETEL posterior.
Jiong-Ran Wang, D. Pati, A. Bhattacharya· 1 citation
In this work, we revisit estimation and variable selection in sparse Gaussian regression, possibly under affine constraints. We adopt a middle-ground approach between optimisation and fully hierarchical Bayesian methods, preserving much of the computational efficiency of the former while adding posterior uncertainty qu...
Martingale posteriors and related predictive resampling methods replace the likelihood--prior pair used within Bayesian inference with a predictive model for future observations. These methods are simple to implement and increasingly popular due to their computational efficiency, but little is known about their ability...
Hui Wang, Edwin Fong, David T. Frazier· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.