SearcharxivSearch

arXiv · 2509.11204

Bayesian model updating via streamlined Bayesian active learning cubature

Abstract

This paper proposes a novel Bayesian active learning method for Bayesian model updating, which is termed as "Streamlined Bayesian Active Learning Cubature" (SBALC). The core idea is to approximate the log-likelihood function using Gaussian process (GP) regression in a streamlined Bayesian active learning way. Rather than generating many samples from the posterior GP, we only use its mean and variance function to form the model evidence estimator, stopping criterion, and learning function. Specifically, the estimation of model evidence is first treated as a Bayesian cubature problem, with a GP prior assigned over the log-likelihood function. Second, a plug-in estimator for model evidence is proposed based on the posterior mean function of the GP. Third, an upper bound on the expected absolute error between the posterior model evidence and its plug-in estimator is derived. Building on this result, a novel stopping criterion and learning function are proposed using only the posterior mean and standard deviation functions of the GP. Finally, we can obtain the model evidence based on the posterior mean function of the log-likelihood function in conjunction with Monte Carlo simulation, as well as the samples for the posterior distribution of model parameters as a by-product. Four numerical examples are presented to demonstrate the accuracy and efficiency of the proposed method compared to several existing approaches. The results show that the method can significantly reduce the number of model evaluations and the computational time without compromising accuracy.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Pei-Pei Li, Chao Dang, Cristóbal H. Acevedo, Marcos A. Valdebenito, Matthias G. R. Faes. 2025-09-14. Bayesian model updating via streamlined Bayesian active learning cubature. https://arxiv.org/abs/2509.11204

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