SearcharxivSearch

arXiv · 2608.00841

Robust Surrogate-Based Bayesian Inference via Sampling-Based Adaptive Active Learning (SALE)

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.

Explore related subjects

Keep this discovery

BibTeXRIS

Dayi Li. 2026-08-01. Robust Surrogate-Based Bayesian Inference via Sampling-Based Adaptive Active Learning (SALE). https://arxiv.org/abs/2608.00841

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Estimating Hierarchically Rank Structured Covariance Matrices

We consider the problem of estimating a high-dimensional covariance matrix from a very limited number of samples. This problem is ubiquitous in computational fluid dynamics, where a small number of fluid snapshots must be used to construct a Gramian matrix determining a reduced-order model, as well as in computational geoscience, where a small ensemble of Earth system forecasts must be used to estimate the covariance matrix associated with the forecast uncertainty. It is common practice to regularize the small-sample covariance by imposing a "localization" structure that enforces a physically realistic correlation length scale, imposing a sparsity constraint, "shrinking" towards a prescribed target, or attenuating small correlations. We propose an alternate technique that regularizes the small-sample covariance by imposing hierarchical rank structure. Compared to regularization methods that assume sparsity such as spatial localization, hierarchical rank structure accommodates a wider range of covariance matrices, roughly corresponding to situations where long-range correlations vary more smoothly than short-range ones. It also results in a data-sparse matrix format that permits highly efficient matrix-vector products. We present theory and algorithms which show how to efficiently estimate a high-dimensional, hierarchically rank structured covariance matrix from limited samples. Through an error analysis and numerical experiments with a variety of model problems, we demonstrate that these techniques are effective at reducing sampling errors, and that in many cases they achieve smaller estimation error than conventional techniques.

stat.CO

Optimal Slice-Adaptive Tuning of Hybrid Slice Sampling

Slice sampling is a Markov chain Monte Carlo algorithm that draws its next state uniformly from a "slice"---a super-level set of the target density function---at each iteration, thereby providing automatic local adaptivity to the scale of the target. In practice the exact slice is not known, so general-purpose implementations use an approximate slice that is grown from a starting interval of length $w>0$, with a computational cost that depends on $w$. This work presents an analysis of the average per-iteration number of target density evaluations, as a function of $w$, of hybrid slice sampling with various slice-finding schemes for targets with contiguous slices. The paper uses the results of the analysis to develop automated, slice-adaptive tuning schemes along with suboptimality bounds and asymptotic convergence guarantees. Simulations demonstrate that the tuning schemes reliably yield near-optimal slice-adaptive tuning with essentially no dependence on the initial setting of $w$.

stat.CO