Graph Laplacian-based Bayesian Multi-fidelity Modeling
Orazio Pinti, Jeremy M. Budd, Franca Hoffmann, Assad A. Oberai
TL;DR
This work introduces a graph-Laplacian–based Bayesian framework to fuse dense low-fidelity data with sparse high-fidelity measurements for multi-fidelity modeling. By placing a graph spectral prior on low-to-high fidelity displacements and combining it with a Gaussian likelihood from limited high-fidelity data, the posterior is Gaussian with a MAP that can be computed via linear systems. Two scalable solvers—the truncated-eigenfunction expansion and Nyström-based low-rank approximation—enable efficient computation for high-dimensional QoIs and spatial fields. Across five physics-driven benchmarks (elasticity, Darcy flow, and Navier–Stokes–related heat flux), the method delivers 75–85% reductions in low-fidelity error using only 0.5–3.3% high-fidelity data, while also providing uncertainty quantification. The approach also offers theoretical convergence guarantees and attractive links to semi-supervised graph learning, making it practical for adaptive or active learning in large-scale simulations.
Abstract
We present a novel probabilistic approach for generating multi-fidelity data while accounting for errors inherent in both low- and high-fidelity data. In this approach a graph Laplacian constructed from the low-fidelity data is used to define a multivariate Gaussian prior density for the coordinates of the true data points. In addition, few high-fidelity data points are used to construct a conjugate likelihood term. Thereafter, Bayes rule is applied to derive an explicit expression for the posterior density which is also multivariate Gaussian. The maximum \textit{a posteriori} (MAP) estimate of this density is selected to be the optimal multi-fidelity estimate. It is shown that the MAP estimate and the covariance of the posterior density can be determined through the solution of linear systems of equations. Thereafter, two methods, one based on spectral truncation and another based on a low-rank approximation, are developed to solve these equations efficiently. The multi-fidelity approach is tested on a variety of problems in solid and fluid mechanics with data that represents vectors of quantities of interest and discretized spatial fields in one and two dimensions. The results demonstrate that by utilizing a small fraction of high-fidelity data, the multi-fidelity approach can significantly improve the accuracy of a large collection of low-fidelity data points.
