Search arXiv⌕ Search

arXiv · 2204.04819

RMFGP: Rotated Multi-fidelity Gaussian process with Dimension Reduction for High-dimensional Uncertainty Quantification

Abstract

Multi-fidelity modelling arises in many situations in computational science and engineering world. It enables accurate inference even when only a small set of accurate data is available. Those data often come from a high-fidelity model, which is computationally expensive. By combining the realizations of the high-fidelity model with one or more low-fidelity models, the multi-fidelity method can make accurate predictions of quantities of interest. This paper proposes a new dimension reduction framework based on rotated multi-fidelity Gaussian process regression and a Bayesian active learning scheme when the available precise observations are insufficient. By drawing samples from the trained rotated multi-fidelity model, the so-called supervised dimension reduction problems can be solved following the idea of the sliced average variance estimation (SAVE) method combined with a Gaussian process regression dimension reduction technique. This general framework we develop can effectively solve high-dimensional problems while the data are insufficient for applying traditional dimension reduction methods. Moreover, a more accurate surrogate Gaussian process model of the original problem can be obtained based on our trained model. The effectiveness of the proposed rotated multi-fidelity Gaussian process(RMFGP) model is demonstrated in four numerical examples. The results show that our method has better performance in all cases and uncertainty propagation analysis is performed for last two cases involving stochastic partial differential equations.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jiahao Zhang, Shiqi Zhang, Guang Lin. 2022-04-11. RMFGP: Rotated Multi-fidelity Gaussian process with Dimension Reduction for High-dimensional Uncertainty Quantification. https://arxiv.org/abs/2204.04819

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

KEEP EXPLORING

Related papers

One-Step Score-Based Density Ratio Estimation

Density ratio estimation (DRE) is a useful tool for quantifying discrepancies between probability distributions, but existing approaches often involve a trade-off between estimation quality and computational efficiency. Classical direct DRE methods are usually efficient at inference time, yet their performance can seriously deteriorate when the discrepancy between distributions is large. In contrast, score-based DRE methods often yield more accurate estimates in such settings, but they typically require considerable repeated function evaluations and numerical integration. We propose One-step Score-based Density Ratio Estimation (OS-DRE), a partly analytic and solver-free framework designed to combine these complementary advantages. OS-DRE decomposes the time score into spatial and temporal components, representing the latter with an analytic radial basis function (RBF) frame. This formulation converts the otherwise intractable temporal integral into a closed-form weighted sum, thereby removing the need for numerical solvers and enabling DRE with only one function evaluation. We further analyze approximation conditions for the analytic frame, and establish approximation error bounds for both finitely and infinitely smooth temporal kernels, grounding the framework in existing approximation theory. Experiments across density estimation, continual Kullback-Leibler and mutual information estimation, and near out-of-distribution detection demonstrate that OS-DRE offers a favorable balance between estimation quality and inference efficiency.

stat.ML↗

Joint Distributional Copula Regression for Insurance Claim Frequency and Severity via Boosting

In this paper, we introduce a model-based boosting approach for fitting structured additive distributional copula regression models for bivariate responses, with particular emphasis on jointly modeling insurance claim frequency and severity. The approach uses regression-type base learners, such as linear terms and splines with low degrees of freedom. It builds on generalized additive models for location, scale, and shape (GAMLSS), which extend generalized additive models (GAMs) by allowing multiple distributional parameters, rather than only the conditional mean, to depend on covariates. The structured additive predictors make the model inherently interpretable, offering greater transparency and auditability than black-box approaches. These features are particularly relevant in regulated actuarial settings and applications requiring explainable artificial intelligence. By estimating the entire conditional joint distribution, the framework also enables insurance practitioners to examine conditional quantiles, tail behavior, and prediction intervals of risks. The copula component captures dependence between claim frequency and severity and allows practitioners to investigate how this dependence varies with policyholder characteristics, potentially improving predictive performance. Moreover, by incorporating modern machine-learning techniques, specifically boosting, the proposed model improves prediction accuracy while retaining interpretability. We assess the proposed framework using both simulated and real data. The results demonstrate its ability to recover the true covariate effects on the marginal distributional parameters and the dependence structure, select informative variables, and achieve predictive performance competitive with standard benchmark models. We also illustrate how to interpret the fitted model.

stat.ML↗

MiniMMD: Minimization of MMD for Sampling, Inference and Integration

Many problems in computational statistics and machine learning can be formulated as approximating a target distribution by minimizing a discrepancy over a restricted class of candidate distributions. This minimum-discrepancy viewpoint appears, for example, in numerical integration, sampling, generative modelling, and statistical inference, but these instances are often studied separately in the literature. This thesis develops the first unified treatment of these many problems through the minimization of the maximum mean discrepancy (MMD), a kernel-based discrepancy between probability measures. The central theme is that MMD is not only a statistically meaningful distance between probability distributions, but also a tractable optimization objective to design practical and efficient algorithms. This thesis summarizes the recent theoretical and empirical advancements of such minimum-MMD based algorithms.

stat.ML↗