arXiv is now an independent nonprofit! Learn more
License: arXiv.org perpetual non-exclusive license
arXiv:2608.17248v1 [cs.CE] 18 Aug 2026

Information fusion and machine learning for sensitivity analysis using physics knowledge and experimental data Thanks: Citation: Kapusuzoglu, B., & Mahadevan, S. Information fusion and machine learning for sensitivity analysis using physics knowledge and experimental data. Reliability Engineering & System Safety 214, 107712 (2021). DOI: 10.1016/j.ress.2021.107712

Berkcan Kapusuzoglu Thanks: Corresponding author: berkcan.kapusuzoglu@vanderbilt.edu    and    Sankaran Mahadevan Affiliation:  Affiliation: Department of Civil and Environmental Engineering Affiliation: Vanderbilt University, Nashville, TN 37235, USA Email: berkcan.kapusuzoglu@vanderbilt.edu,    sankaran.mahadevan@vanderbilt.edu
Abstract

When computational models (either physics-based or data-driven) are used for the sensitivity analysis of engineering systems, the sensitivity estimate is affected by the accuracy and uncertainty of the model. This paper considers global sensitivity analysis (GSA) for situations where both a physics-based model and experimental observations are available, and investigates physics-informed machine learning strategies to effectively combine the two sources of information in order to maximize the accuracy of the sensitivity estimate. Two representative machine learning (ML) techniques are considered, namely, deep neural networks (DNN) and Gaussian process (GP) modeling, and two strategies for incorporating physics knowledge within these techniques are investigated, namely: (i) incorporating loss functions in the ML models to enforce physics constraints, and (ii) pre-training and updating the ML model using simulation and experimental data respectively. Four different models are built for each type (DNN and GP), and the uncertainties in these models are included in the Sobol’ indices computation. The DNN-based models, with many degrees of freedom in terms of model parameters and training options, are found to result in smaller bounds on the sensitivity estimates when compared to the GP-based models. The proposed methods are illustrated for additive manufacturing and lake temperature modeling examples.

Keywords Global sensitivity analysis \cdot Sobol’ index \cdot Deep learning \cdot Physics-informed machine learning \cdot Additive manufacturing \cdot Information fusion

1 Introduction

Computational models are often used to analyze the response of an engineering system for a variety of input realizations, since conducting experiments to directly measure the true response for many input realizations is often not affordable. However, the computational model is often an incomplete representation of the complex physical system, thus the system response prediction is affected by model uncertainty. In general, the uncertainty sources affecting system response prediction include (a) epistemic uncertainty due to lack of knowledge (arising from either data or model inadequacies), and (b) aleatory uncertainty due to the inherent variability in the system properties or the external inputs. Global sensitivity analysis (GSA) [46] aims to provide a quantitative assessment of the relative contribution of each uncertainty source to the uncertainty in the model response [45, 34, 4].

Much of the GSA literature has focused on variability in the inputs and their effects on output variability; the extension of GSA to include epistemic uncertainty sources (data, model) is recent and sparse [47, 30, 28, 40, 36]. Model outputs can have uncertainty even for a fixed input when there exists model uncertainty. When the model is computationally expensive, it is often replaced with a surrogate model to facilitate the estimation of Sobol’ indices, since such computation requires many input-output samples from the model; the surrogate model introduces additional uncertainty. Several types of surrogate models are used in the literature, e.g., polynomial chaos expansion (PCE), Gaussian process (GP) regression, neural networks, etc., to train a parametric relationship between the inputs and the outputs. The quality and quantity of the training data affect the accuracy of these surrogate models, which directly affects the uncertainty in the model output [28, 40, 36]. Thus, it is important to also include the contribution of surrogate model uncertainty to the output uncertainty in GSA. In Le Gratiet et al [28] for example, the Gaussian process surrogate model uncertainty is included in the Sobol’ index estimates using multiple realizations of the GP model prediction, which helps to construct prediction intervals for the Sobol’ index estimates.

Expanding GSA to consider both aleatory and epistemic uncertainty sources is beneficial in supporting resource allocation decisions. If the contribution of epistemic uncertainty is found to be significant, then it may be valuable to collect more data or refine the physics model to reduce the epistemic uncertainty and thus its contribution to the output uncertainty. Several GSA studies have developed auxiliary variable-based approaches to include both aleatory and epistemic uncertainty sources at a single level instead of using nested simulations, thus achieving both computational efficiency and direct ranking of the different sources of uncertainty to support resource allocation decision-making. The auxiliary variable is used to transform one-to-many input-output mapping to one-to-one mapping, thus facilitating the computation of Sobol’ indices for both aleatory and epistemic sources [47]. This idea is expanded in [30] to include several epistemic sources, such as input statistical uncertainty, surrogate model error, physics model discrepancy, and numerical solution error, and to systems with time series inputs and outputs.

Three scenarios of model and data availability can be considered for GSA: (1) use of a physics-based computational model alone, (2) use of available input-output data alone (either from experiments or previous simulations), or (3) use of both physics model and available experimental data. A straightforward model-based approach to estimate Sobol’ indices is to use a double-loop Monte Carlo simulation (MCS)  [50]. In order to reduce the cost associated with the double-loop MCS, analytical, spectral and efficient sampling-based methods have been developed. The methodology developed by Sudret [51] approximates the original physics model by a PCE and estimates the Sobol’ indices by using the PCE coefficients. Chen et al. [5] proposed analytical formulas to compute Sobol’ indices using a GP surrogate model with input variables that follow normal or uniform distributions. The improved FAST method [52] combines the classical FAST method [45] with random balanced design [48] for generating samples to evaluate Sobol’ indices.

In some problems, input-output data may be already available instead of having to simulate a physics model expressly for the purpose of GSA. Such data may be available from experiments, or real-world observations, or Markov Chain Monte Carlo (MCMC) sampling during Bayesian model calibration, or MC sampling during reliability analysis, etc. In such cases, data-driven methods have been proposed to directly compute the Sobol’ indices based on available input-output samples instead of simulation runs of the physics model. A GSA method based on ANOVA using factorial design of experiments is developed by Ginot et al. [14]. The proposed method results in same values as the Sobol’ index since the variance decomposition used in the Sobol’ index estimations is same as the one used in the classical ANOVA [2]. In high dimensional problems, even the use of a surrogate model for GSA, which repeatedly executes the code by suppressing some variables and running through the range of other variables, may be computationally demanding since the number of executions of the code increases rapidly with the number of inputs [28, 20, 37, 41]. The computational cost of most sample-based methods is proportional to the number of model inputs. Li and Mahadevan [29] proposed a modularized method, which has a computational cost that is not proportional to the model input dimension, to estimate the first-order Sobol’ indices based on stratification of available input-output samples. DeCarlo et al. [10] proposed an importance sampling approach by introducing weights to different data points to estimate Sobol’ indices from available data using Sobol’ sequences to reduce the number of simulations; this method computes both first-order and higher order indices, and is able to include correlated inputs. Approximations to the joint probability distribution of inputs and outputs such as multivariate Gaussian, Gaussian copula, and Gaussian mixture have recently been found to give rapid estimation of Sobol’ indices  [20].

The third scenario is of interest in this paper, where both a physics-based model and some experimental or real-world data are available. One option, if adequate data is available, is to simply build a regression or machine learning (ML) model based on the observation data, and use this model to perform GSA. Multiple recent studies have pursued data-driven ML models in situations where abundant experimental data or real-world observations are available due to advances in modern sensing techniques. Generally, the construction of data-driven ML models does not require in-depth knowledge of the complex physics inherent in the physical process. ML models can learn complex systems using available observations, but the accuracy of these models depends on the quality and quantity of the data. If the available data is sparse, then the complexity of the process may not be fully captured. Further, since purely data-driven ML models do not explicitly consider physical laws, they can produce physically inconsistent results. In such cases, incorporating physics knowledge within ML models may improve the accuracy and efficiency of GSA computations. The combined use of physics-based and ML models has been shown to achieve more accurate and physically consistent predictions by leveraging the advantages of each method [26, 22, 53, 24].

In this work, we incorporate physics knowledge into the ML models to better capture the physics of the process by leveraging physical laws while improving the generalization performance of data-driven models. Two types of strategies are considered for incorporating physics knowledge within ML models: (1) incorporating loss functions in the ML model training to enforce physics constraints, and (2) pre-training the ML model with data generated by the physics model and then updating it with experimental data. Note that the first strategy does not use the physics model but only constraints for the output to obey physical requirements; whereas, the second strategy explicitly uses the physics computational model. Two types of ML models are considered in this paper, namely, Gaussian process (GP) and deep neural network (DNN). These two models are selected in order to represent two different kinds of available ML techniques; the GP model is one of the surrogate models commonly used in uncertainty quantification (UQ) studies, and DNN belongs to the emerging class of deep learning algorithms revolutionizing the field of artificial intelligence, spurred by recent advances in sensing, communication and computational resources. Four different physics-informed machine learning (PIML) models are developed for each type (i.e., GP or DNN) to predict the output quantity of interest (QoI), through combinations of the two strategies. The resulting GSA procedure incorporates the effect of uncertainty in the ML or PIML model, and the various models and strategies are compared in terms of accuracy and uncertainty in the GSA results and their computational demand.

In summary, the contributions of this paper are as follows:

  • Physics knowledge and experimental observations are fused in order to maximize the accuracy of sensitivity estimates.

  • Two PIML strategies and their combinations are investigated for global sensitivity analysis using both physics knowledge and experimental data.

  • Four different models are built for each of GP and DNN, and the uncertainties in these models are included in the Sobol’ indices computation.

  • The accuracy, uncertainty and computational effort of different options for the ML and PIML models are evaluated and compared.

The outline of the rest of the paper is as follows. Section 2 provides background information on related methods. Section 3 presents the proposed methodology. Two numerical examples are presented in Section 4 to illustrate the proposed methodology and draw insights on the performance of various PIML strategies and models. Concluding remarks are provided in Section 5.

2 Background

This section introduces each of the basic techniques used in developing the proposed methodology, namely variance-based GSA, Gaussian process (GP) surrogate modeling, and deep neural networks (DNN). These techniques are well established with extensive literature, therefore only a brief introduction is given here.

2.1 Variance-based GSA

Consider a deterministic real integrable one-to-one system response function Y=f(𝐗)\mathrm{Y}=f(\boldsymbol{\mathrm{X}}), where f()f(\boldsymbol{\cdot}) is the computational model, 𝐗={X1,,Xk}\boldsymbol{\mathrm{X}}=\{\mathrm{X}_{1},...,\mathrm{X}_{k}\} are mutually independent model inputs, and Y\mathrm{Y} is the model output. As shown in [50], the variance of Y\mathrm{Y} can be decomposed as

V(Y)=\displaystyle V(\mathrm{Y})= ikVi+i1ki2=i1+1kVi1i2+i1ki2=i1+1ki3=i2+1kVi1i2i3++V12k\displaystyle\sum_{i}^{k}V_{i}+\sum_{i_{1}}^{k}\sum_{i_{2}=i_{1}+1}^{k}V_{i_{1}i_{2}}+\sum_{i_{1}}^{k}\sum_{i_{2}=i_{1}+1}^{k}\sum_{i_{3}=i_{2}+1}^{k}V_{i_{1}i_{2}i_{3}}+...+V_{12...k} (1)

where ViV_{i} is the variance of Y\mathrm{Y} due to Xi\mathrm{X}_{i} alone, and Vi1ip(p2)V_{i_{1}...i_{p}}(p\geq 2) indicates the variance of Y\mathrm{Y} caused by the interaction of {Xi1,,Xip}\{\mathrm{X}_{i_{1}},...,\mathrm{X}_{i_{p}}\}.

The Sobol’ indices are defined by dividing both sides of Eq. (1) with V(Y)V(\mathrm{Y})

1=\displaystyle 1= ikSi+i1ki2=i1+1kSi1i2+i1ki2=i1+1ki3=i2+1kSi1i2i3++S12k\displaystyle\sum_{i}^{k}S_{i}+\sum_{i_{1}}^{k}\sum_{i_{2}=i_{1}+1}^{k}S_{i_{1}i_{2}}+\sum_{i_{1}}^{k}\sum_{i_{2}=i_{1}+1}^{k}\sum_{i_{3}=i_{2}+1}^{k}S_{i_{1}i_{2}i_{3}}+...+S_{12...k} (2)

where SiS_{i} is the first-order or main effects index that assesses the contribution of Xi\mathrm{X}_{i} individually to the variance of the output Y\mathrm{Y} without considering interactions with other inputs. The higher-order indices Si1ip(p2)S_{i_{1}...i_{p}}(p\geq 2) in Eq. (2) measure the contributions of the interactions of {Xi1,,Xip}\{\mathrm{X}_{i_{1}},...,\mathrm{X}_{i_{p}}\}.

The first-order index SiS_{i} is defined as follows:

Si=ViV(Y)=VXi(E𝐗i(Y|Xi))V(Y)S_{i}=\frac{V_{i}}{V(\mathrm{Y})}=\frac{V_{X_{i}}(E_{\boldsymbol{\mathrm{X}}_{-i}}(\mathrm{Y}|\mathrm{X}_{i}))}{V(\mathrm{Y})} (3)

where 𝐗i\boldsymbol{\mathrm{X}}_{-i} are all the model inputs other than Xi\mathrm{X}_{i}.

The overall contribution of Xi\mathrm{X}_{i} considering an individual input and its interactions with all other inputs is measured by the total effects index SiTS_{i}^{T}:

SiT=1ViV(Y)=V𝐗i(Exi(Y|𝐗i))V(Y).S_{i}^{T}=1-\frac{V_{-i}}{V(\mathrm{Y})}=\frac{V_{\boldsymbol{\mathrm{X}}_{-i}}(E_{\mathrm{x}_{i}}(\mathrm{Y}|\boldsymbol{\mathrm{X}}_{-i}))}{V(\mathrm{Y})}. (4)

The computation of SiS_{i} analytically is nontrivial since E𝐗i()E_{\boldsymbol{\mathrm{X}}_{-i}}(\boldsymbol{\cdot}) requires multi-dimensional integrals. A basic sampling-based approach is to use double-loop sampling [50]. Several approaches to reduce the computational cost were mentioned in Section 1. One of these approaches of particular relevance to this paper is to replace the original computational model f()f(\boldsymbol{\cdot}) by a surrogate model and use this surrogate model in GSA [16, 35, 54, 21, 19]. This approach will be addressed further in Section 3.

2.2 Gaussian process surrogate modeling

A Gaussian process (GP) surrogate model (or kriging) approximates a response function y=G(𝐱)y=G(\mathbf{x}) over the domain of input 𝐱\mathbf{x} as a Gaussian random process with a mean function m(𝐱)m(\mathbf{x}) and a covariance function k(𝐱,𝐱)k(\mathbf{x},\mathbf{x^{\prime}}), which describes the deviation of the model from the trend

𝐲(𝐱)𝒢𝒫(m(𝐱),k(𝐱,𝐱)).\mathbf{y}(\mathbf{x})\sim\mathcal{GP}\big(m(\mathbf{x}),k(\mathbf{x},\mathbf{x^{\prime}})\big). (5)

Given a set of training data {𝐗T,𝐘T\mathbf{X}_{T},\mathbf{Y}_{T}} and the input 𝐗P\mathbf{X}_{P}, where prediction is desired, the conditional probability distribution of the output 𝐘P\mathbf{Y}_{P} follows a multivariate Gaussian distribution [43] as

𝐘P|𝐗P,𝐗T,𝐘T𝒩(𝝁,Σ)\displaystyle\mathbf{Y}_{P}|\mathbf{X}_{P},\mathbf{X}_{T},\mathbf{Y}_{T}\sim\mathcal{N}(\boldsymbol{\mu},\Sigma) (6)
𝝁=m(𝐗P)+ΣPT(ΣTT+σobs2𝑰)1(𝐘Tm(𝐗T))\displaystyle\boldsymbol{\mu}=m(\mathbf{X}_{P})+\Sigma_{PT}(\Sigma_{TT}+\sigma_{obs}^{2}\boldsymbol{I})^{-1}\big(\mathbf{Y}_{T}-m(\mathbf{X}_{T})\big)
Σ=ΣPPΣPT(ΣTT+σobs2𝑰)1ΣPTT\displaystyle\Sigma=\Sigma_{PP}-\Sigma_{PT}(\Sigma_{TT}+\sigma_{obs}^{2}\boldsymbol{I})^{-1}\Sigma_{PT}^{T}

where 𝝁\boldsymbol{\mu} is the mean vector of the prediction 𝐘P\mathbf{Y}_{P} conditioned on the training data, and Σ\Sigma is the conditional covariance matrix of 𝐘P\mathbf{Y}_{P}; ΣPT\Sigma_{PT} is the covariance matrix between the prediction data 𝐗𝐏\mathbf{X_{P}} and each of the training points {𝐗𝐓=x1,x2,,xn\mathbf{X_{T}}=\boldmath{x_{1}},\boldmath{x_{2}},...,\boldmath{x_{n}}}; ΣTT\Sigma_{TT} is the n×nn\times n covariance matrix of the training data; ΣPP\Sigma_{PP} is the unconditional covariance matrix of 𝐘P\mathbf{Y}_{P}; σobs2\sigma_{obs}^{2} is the variance of observation/measurement error (also called noise variance), and 𝑰\boldsymbol{I} is the identity matrix.

The mean function m()m(\cdot) is often formulated as a polynomial function of inputs. The covariance function k()k(\cdot) can be formulated by using a covariance function based on the desired properties (order of continuity, stationary/non-stationary, isotropic/anisotropic). A squared exponential correlation function with separate length scale parameters lil_{i} for each input dimension has often been used in the literature:

k(𝐱,𝐱)=σf2exp[i=1M(xixi)22li]+σobs2δ(𝐱,𝐱)k(\mathbf{x},\mathbf{x^{\prime}})=\sigma_{f}^{2}\exp\left[-\sum_{i=1}^{\rm M}\frac{\left(x_{i}-x^{\prime}_{i}\right)^{2}}{2l_{i}}\right]+\sigma_{obs}^{2}\delta(\mathbf{x},\mathbf{x}^{\prime}) (7)

where σf2\sigma_{f}^{2} is the signal/process variance and defines the maximum allowable covariance, and δ(𝐱,𝐱)\delta(\mathbf{x},\mathbf{x}^{\prime}) is the Kronecker delta function.

The hyperparameters of the GP model considering a zero mean function, i.e., 𝚯={l,σf,σobs}\mathbf{\Theta}=\{l,\sigma_{f},\sigma_{obs}\}, are inferred from the training data. A common method is to maximize the log marginal likelihood function, which is defined as

logp(𝐘T|𝐗T;𝚯)=12𝐘T(ΣTT+σobs2𝑰)1𝐘T12log|ΣTT+σobs2𝑰|n2log2π.\displaystyle\mathrm{log}\ p(\mathbf{Y}_{T}|\mathbf{X}_{T};\mathbf{\Theta})=-\frac{1}{2}\mathbf{Y}_{T}(\Sigma_{TT}+\sigma_{obs}^{2}\boldsymbol{I})^{-1}\mathbf{Y}_{T}-\frac{1}{2}\mathrm{log}|\Sigma_{TT}+\sigma_{obs}^{2}\boldsymbol{I}|-\frac{n}{2}\mathrm{log}2\pi. (8)

2.3 Deep neural networks

In recent years, due to the confluence of advanced sensing and imaging techniques, big data processing techniques, enormous computational power and the internet, rapid advances are being made in developing sophisticated data-driven machine learning models, particularly neural networks. A deep neural network (DNN) is composed of multiple hidden layers and has four major components: neuron, activation function, cost function, and optimization. Figure 1 shows a neural network consisting of three inputs, two hidden layers, each having four neurons, and two output neurons. The values of various input variables of a particular neuron are multiplied by their associated weights, then the sum of the products of the neuron weights and the inputs are calculated at each neuron. The summed value is passed through an activation function that maps the summed value to a fixed range before passing these signals on to the next layer of neurons.

Figure 1: A deep neural network with two hidden layers.

The predictions of the DNN after forward propagation, 𝐘^\mathbf{\hat{Y}}, are compared against the observations, 𝐘obs\mathbf{Y}_{obs}, by defining a loss function (e.g., root mean squared error (RMSE); RMSE(𝐘obs,𝐘^)=i=1n(yobs,iy^i)2/n\mathcal{L}_{\rm RMSE}(\mathbf{Y}_{obs},\mathbf{\hat{Y}})=\sqrt{\sum_{i=1}^{n}(\mathrm{y}_{obs,i}-\mathrm{\hat{y}}_{i})^{2}/n}), which measures how far off the predictions are from the observations for the nn training samples. Backpropagation algorithms are employed to keep track of small perturbations to the weights that affect the error in the output and to distribute this error back through the network layers by computing gradients for each layer using the chain rule. In order to minimize the value of the loss function, necessary adjustments are applied at each iteration to the neuron weights in each layer of the network. These procedures are performed at each iteration until the loss function converges to a stable value.

3 Proposed methodology

The proposed methodology for sensitivity analysis, using both physics knowledge and experimental data, consists of the following steps:

  1. 1.

    Identification of PIML strategies

  2. 2.

    Implementation of PIML strategies in ML models

  3. 3.

    Variance quantification in ML model prediction

  4. 4.

    Sobol’ indices computation with ML model prediction variance

The following subsections describe these steps in detail.

3.1 Identification of PIML strategies

PIML models seek to incorporate physics knowledge or constraints within the data-driven ML models. When a mechanistic, physics-based model is also available, complementary strengths of both mechanistic and ML models can be leveraged in a synergistic manner [53]. In the latter case, the aim is to improve the predictions beyond that of physics-based models or ML models alone by coupling physics-based models with ML models. Thus two different strategies to combine physics knowledge and ML models can be considered: (1) incorporate physics constraints in the ML models, and (2) pre-train and update the ML models using physics model input-output and experimental data, respectively.

3.1.1 Strategy 1: Enforcing physics constraints

A direct strategy to enforce physics constraints in ML model predictions is by including the constraints within the loss function used in training the ML model [26]. Thus, while training a PIML model with inputs 𝐗obs\mathbf{X}_{obs} and outputs 𝐘obs\mathbf{Y}_{obs}, the physical constraints can be incorporated as additional penalty terms in the loss function:

=ML+λphyphy(𝐘^),\displaystyle\mathcal{L}=\mathcal{L}_{\rm ML}+\lambda_{\rm phy}\mathcal{L}_{\rm phy}(\mathbf{\hat{Y}}), (9)

where ML\mathcal{L}_{\rm ML} is the log marginal likelihood of the data for a GP model:

GP=logp(𝐘obs|𝐗obs;𝚯)\mathcal{L}_{\rm GP}=\mathrm{log}\ p(\mathbf{Y}_{obs}|\mathbf{X}_{obs};\mathbf{\Theta}) (10)

with experimental observations {𝐗obs,𝐘obs\mathbf{X}_{obs},\mathbf{Y}_{obs}} being the training data for the GP model. For a DNN ML\mathcal{L}_{\rm ML} represents training a loss function that evaluates a supervised error, e.g., root mean squared error (RMSE):

DNN(𝐘obs,𝐘^)=i=1n(Yobs,iY^i)2n\mathcal{L}_{\rm DNN}(\mathbf{Y}_{obs},\mathbf{\hat{Y}})=\sqrt{\sum_{i=1}^{n}\frac{(Y_{obs,i}-\hat{Y}_{i})^{2}}{n}} (11)

which measures the accuracy of predictions 𝐘^\mathbf{\hat{Y}} for nn training samples. (Note that for the GP model, the likelihood is maximized, whereas for the DNN model, the RMSE is minimized). The additional physics constraint loss function phy\mathcal{L}_{\rm phy} in the second term of Eq. (9) is weighted by a hyperparameter λphy\lambda_{\rm phy}; the value of λphy\lambda_{\rm phy} controls the strength of the physics constraint enforcement. The inclusion of the second term ensures physically consistent model predictions and helps to reduce the generalization error, which is a measure of how accurately a model is able to predict the output QoI for previously unseen data [26].

The physical inconsistencies in the model predictions are evaluated using the physics constraint loss term. The generic forms of these physical relationships can be expressed using the following constraints:

1(𝐘^,𝚪)=0,\displaystyle\mathcal{F}_{1}(\mathbf{\hat{Y}},\mathbf{\Gamma})=0, (12)
2(𝐘^,𝚪)0.\displaystyle\mathcal{F}_{2}(\mathbf{\hat{Y}},\mathbf{\Gamma})\leq 0.

where 𝚪\mathbf{\Gamma} denotes other variables or thresholds that define the physics constraint regarding the model output 𝐘^\mathbf{\hat{Y}}. Equation. 12 indicates that the constraints may take the form of equalities or inequalities. These equations can involve algebraic relationships or partial differentials of 𝐘^\mathbf{\hat{Y}} and/or 𝚪\mathbf{\Gamma}. The physics-based loss functions for these equations can be defined as:

phy(𝐘^)=1(𝐘^,𝚪)+ReLU(2(𝐘^,𝚪)),\displaystyle{}\mathcal{L}_{{\rm phy}}(\mathbf{\hat{Y}})=||\mathcal{F}_{1}(\mathbf{\hat{Y}},\mathbf{\Gamma})||+\rm{ReLU}(\mathcal{F}_{2}(\mathbf{\hat{Y}},\mathbf{\Gamma})), (13)

where ReLU(x)=max(0,x)\rm{ReLU}(x)=max(0,x) represents the rectified linear unit function and it acquires value when a threshold is violated in the inequality constraint, i.e., it penalizes the optimization when 2>0\mathcal{F}_{2}>0. It can also be used to penalize deviations from a desired physically consistent relationship among multiple outputs 𝐘^\mathbf{\hat{Y}} [38].

3.1.2 Strategy 2: Pre-training and Updating

The ML model output accuracy and uncertainty are dependent on the quality and quantity of the available training data. In some systems, the high cost associated with conducting experiments makes it infeasible to have adequate amount of training data to build purely data-driven models. Thus, it may be desirable to combine the physics-based model and available experimental data in seeking to maximize the accuracy of the sensitivity estimates. When the experiments are expensive, they can only be conducted for a few values of the inputs, whereas it might be possible to run the physics-based model for a larger set of input values. In that case, the simulation data can be used to pre-train an ML model, which is used as the initial model to be updated with experimental observations. Further, training of ML models requires the choice of initial values of the model parameters. The transfer of physical knowledge using a pre-trained ML model can prevent poor initialization due to lack of knowledge regarding the initial choice of ML model parameters prior to training.

Since the pre-training based on the physics-based model can use a large amount of training data (with multiple input parameter combinations) over a wide range of values, the pre-training may also help the eventual ML model to have wider generalization beyond experimental data. In the numerical example in Section 4, the pre-training strategy exercises the physics model over 1310 input combinations, whereas only 39 experiments are available. However, if the physics model is computationally expensive, then the advantage of the pre-training strategy in using a larger input data set (for physics model runs) compared to the experiments becomes limited.

The two proposed strategies to predict the QoI are shown in Fig. 2. Figure 2(a) shows the first method, where the physical knowledge is included through constraints within the loss function of an ML trained with only experimental data. Figure 2(b) shows the second method, where an ML model is first trained with data generated using the physics-based model and then updated using experimental data. Figures 2(c) and 2(d) show the trained ML model predictions (𝒀^\boldsymbol{\hat{Y}}) for the two proposed strategies, respectively. The proposed PIML strategies can be applied to any physical system by leveraging the related physical constraints or physics-based models.

Figure 2: PIML strategies: (a) incorporating physics-based loss functions in the ML models to enforce physics constraints, (b) pre-training an ML model with physics model input-output (𝐗phy\mathbf{X_{\mathrm{phy}}}, 𝐘phy\mathbf{Y_{\mathrm{phy}}}) and updating it with experimental training data (𝐗obs\mathbf{X_{\mathrm{obs}}}, 𝐘obs\mathbf{Y_{\mathrm{obs}}}), (c) the trained ML model prediction (𝐘^)(\mathbf{\hat{Y}}), (d) updated ML model prediction (𝐘^)(\mathbf{\hat{Y}}).

3.2 Implementation of PIML strategies in ML models

Based on the proposed two strategies to incorporate physics knowledge into the ML model, four separate ML models can be constructed for each type of surrogate model considered here (i.e., GP and DNN):

  1. 1.

    GP\mathbf{\rm GP}

  2. 2.

    GPphy\mathbf{\rm GP^{\mathcal{L}_{\rm phy}}}

  3. 3.

    GPupd\mathbf{\rm GP^{\rm upd}}

  4. 4.

    GPupd1,phy\mathbf{\rm GP^{\rm upd_{1},\mathcal{L}_{\rm phy}}}

  5. 5.

    DNN\mathbf{\rm DNN}

  6. 6.

    DNNphy\mathbf{\rm DNN^{\mathcal{L}_{\rm phy}}}

  7. 7.

    DNNupd\mathbf{\rm DNN^{\rm upd}}

  8. 8.

    DNNupd,phy\mathbf{\rm DNN^{\rm upd,\mathcal{L}_{\rm phy}}}

These different models cover the following options: model trained with experimental data alone, models trained with PIML strategies 1 or 2 alone, and models trained with both PIML strategies together. The implementations of PIML strategies 1, 2, and their combination are different for the GP models vs. the DNN models. The following subsections describe how the PIML strategies can be implemented for each of the above models.

3.2.1 Implementation of PIML in GP models

In Model 1, denoted as GP\mathbf{\rm GP}, only experimental observations are used for training. The hyperparameters of the GP model (process variance, correlation length scale along each input dimension, and trend function coefficients, and also measurement error variance if unknown) are optimized during training by maximizing the log marginal likelihood function shown in Eq. (8). In calculating the likelihood, the difference between the true response of the system 𝐘true\mathbf{Y}_{\rm true} and the observed response 𝐘obs\mathbf{Y_{\mathrm{obs}}} is attributed to the observation error ϵobs\epsilon_{\rm obs}, which is often treated as a zero-mean Gaussian random variable with variance σobs2\sigma_{\rm obs}^{2}.

Model 2, denoted as GPphy\mathbf{\rm GP^{\mathcal{L}_{\rm phy}}}, incorporates the first PIML strategy by enforcing physics constraints during the optimization of the GP model hyperparameters. More specifically, the physics constraints are included during the maximization of the log marginal likelihood function (Eq. (8)) while inferring the hyperparameters of the GP model. Thus, the training of Model 2 is achieved by maximizing the function in Eq. (14):

GP=logp(𝐘obs|𝐗obs;𝚯)λphyphy(𝐘^),\displaystyle\mathcal{L}_{\rm GP}=\mathrm{log}\ p(\mathbf{Y}_{obs}|\mathbf{X}_{obs};\mathbf{\Theta})-\lambda_{\rm phy}\mathcal{L}_{\rm phy}(\mathbf{\hat{Y}}), (14)

where 𝐘^\mathbf{\hat{Y}} is the GP model prediction. Note that since GP\mathcal{L}_{\rm GP} is to be maximized, the second term corresponding to the physics constraint has a negative sign. Gaussian process modeling under constraints has been studied in the literature [8, 9, 15, 32, 44]. Veiga et al.  [9] developed a framework that incorporates bound, monotonicity and convexity constraints in GP modeling. Golchi et al. [15] developed a Bayesian approach to GP modeling that incorporates the monotonicity constraint. The need to obtain the monotonicity information at each of the points in the derivative input set can slow down the computation as the input dimension increases since the size of the covariance matrix depends on the input dimension. This paper does not use the methods described above. Instead, the paper proposes a different method that penalizes violations of the physics constraints by introducing a regularization term in the likelihood function. To the best of our knowledge, this is the first study to apply the penalty approach to the likelihood function of the GP model. Further, the computational effort of the proposed method (i.e., the calculation of the regularization term) does not increase with the problem size since the regularization term does not need the inverse of the covariance matrix.

The current work considers two different approaches for the second PIML strategy. Both approaches use a pre-trained model, obtained using the physics model input-output data. In the first approach, the model parameters are updated using the experimental data; and in the second approach, a discrepancy correction term is added to the pre-trained model. The first step of pre-training using data generated by the physics model can be thought of as similar to a lower fidelity model, and the second step of improving the pre-trained model (either by parameter updating or by adding a discrepancy term) can be thought of as similar to incorporating higher fidelity data (experimental data, in this case) to improve the model. Various multi-fidelity modeling strategies with different combinations of the low- and high-fidelity models have been studied in the literature, such as filtering, fusion, and adaptation [42]. The discrepancy correction approach pursued here adopts the simplest strategy, namely, additive correction, where a model discrepancy term is added to the low-fidelity model [1]:

fHF(𝐗)=fLF(𝐗)+δ(𝐗,𝜽𝜹)f_{HF}(\mathbf{X})=f_{LF}(\mathbf{X})+\delta(\mathbf{X};\boldsymbol{\theta_{\delta}}) (15)

where fHF()f_{HF}(\cdot) and fLF()f_{LF}(\cdot) are the high and low fidelity models, respectively, 𝐗\mathbf{X} is the input to the model, and θδ\theta_{\delta} are the parameters of the discrepancy correction term. The correction term can be obtained using any suitable surrogate modeling technique.

Model 3, denoted as GPupd\mathbf{\rm GP^{\rm upd}}, pursues the first approach of the second PIML strategy, where a GP model is pre-trained using the coupled multi-physics model input-output and then updated with experimental data. Then, the model parameters of this pre-trained network are updated using the experimental data.

An alternative approach, denoted as GPMF\mathbf{\rm GP^{\rm MF}}, pursues the second approach of the second PIML strategy, i.e., it pre-trains a GP surrogate model with data generated from the physics model, then improves the surrogate using experimental data. Consider a physics model G()G(\boldsymbol{\cdot}) that maps input variables 𝐗\mathbf{X} and model parameters 𝜽𝒎\boldsymbol{\theta_{m}} to the numerical model output 𝐘m\mathbf{Y}_{m}:

𝐘m(𝐗)=G(𝐗,𝜽m(𝐗)).\mathbf{Y}_{m}(\mathbf{X})=G\big(\mathbf{X};\ \boldsymbol{\theta}_{m}(\mathbf{X})\big). (16)

Let nDn_{D} be the number of collected observation data 𝐘obs\mathbf{Y_{\mathrm{obs}}} from experiments with input variable settings 𝐱(1),,𝐱(nD)\mathbf{x}^{(1)},...,\mathbf{x}^{(n_{D})}, where 𝐱(i)\mathbf{x}^{(i)} is the input variable setting for the iith experiment. The physics model prediction is inaccurate due to missing physics or due to other approximations. Thus, a model discrepancy term 𝜹(𝐗)\boldsymbol{\delta}(\mathbf{X}) as a function of model inputs is introduced to capture the difference between 𝐘true\mathbf{Y}_{\rm true} and 𝐘m\mathbf{Y}_{m} [27]:

𝐘true(𝐗)=𝐘m(𝐗)+𝜹(𝐗).\mathbf{Y}_{\rm true}(\mathbf{X})=\mathbf{Y_{\mathrm{m}}}(\mathbf{X})+\boldsymbol{\delta}(\mathbf{X}). (17)

The experimental observations 𝐘obs\mathbf{Y}_{\rm obs} can be described in terms of the true system response 𝐘true\mathbf{Y}_{\rm true} and the corresponding observation errors ϵobs(𝐗)\epsilon_{\rm obs}(\mathbf{X}) as

𝐘obs(𝐗)=𝐘true(𝐗)+ϵobs(𝐗).\mathbf{Y}_{\rm obs}(\mathbf{X})=\mathbf{Y_{\mathrm{true}}}(\mathbf{X})+\epsilon_{\rm obs}(\mathbf{X}). (18)

Combining Eqs. (17) and (18),

𝐘obs(𝐗)ϵobs(𝐗)=𝐘m(𝐗)+𝜹(𝐗)=G(𝐗,𝜽m(𝐗))+𝜹(𝐗).\mathbf{Y}_{\rm obs}(\mathbf{X})-\epsilon_{\rm obs}(\mathbf{X})=\mathbf{Y}_{m}(\mathbf{X})+\boldsymbol{\delta}(\mathbf{X})=G\big(\mathbf{X};\ \boldsymbol{\theta}_{m}(\mathbf{X})\big)+\boldsymbol{\delta}(\mathbf{X}). (19)

When the physics model is computationally expensive, it is replaced by a cheaper surrogate model. In Model 3, a GP surrogate model is used to approximate the original physics model. The accuracy of the surrogate model prediction depends on the quality and quantity of the training data generated by the original physics model. The surrogate model error (ϵδ(𝐗)\epsilon_{\delta}(\mathbf{X})) can be incorporated as follows:

𝐘m(𝐗)=𝐘^m(𝐗)+ϵδ(𝐗),\mathbf{Y}_{m}(\mathbf{X})=\mathbf{\hat{Y}}_{m}(\mathbf{X})+\epsilon_{\delta}(\mathbf{X}), (20)

where 𝐘^m\mathbf{\hat{Y}}_{m} is the surrogate model prediction.

A common approach to estimate the discrepancy term 𝜹(𝐗)\boldsymbol{\delta}(\mathbf{X}) is the one formulated by Kennedy and O’Hagan [27], which is applicable in the context of Bayesian calibration. In that case, physics model parameters are sought to be calibrated, and a discrepancy term is added in the calibration equation. The discrepancy term can be expressed in multiple ways, such as constant, Gaussian random variable with unknown parameters (either input-dependent or not), or Gaussian process (either stationary or non-stationary) [31]. The hyperparameters of the discrepancy term are then estimated along with the physics model parameters using Bayesian calibration [25].

However, the situation considered here is much simpler. There is no calibration of the physics model parameters here; only the discrepancy term is needed. (In other words, the physics model parameters are already established). In that case, the model discrepancy can be evaluated for different input values of experimental tests and realizations of observation errors as follows:

𝜹(𝐗)=𝐘obs(𝐗)ϵobs(𝐗)𝐘^m(𝐗)ϵδ(𝐗).\boldsymbol{\delta}(\mathbf{X})=\mathbf{Y_{\mathrm{obs}}}(\mathbf{X})-\epsilon_{\rm obs}(\mathbf{X})-\mathbf{\hat{Y}}_{m}(\mathbf{X})-\epsilon_{\delta}(\mathbf{X}). (21)

Moving the surrogate model error ϵδ(𝐗)\epsilon_{\delta}(\mathbf{X}) to the left-hand side, we can express the difference between the actual response and GP model prediction as

𝜹^(𝐗)=𝜹(𝐗)+ϵδ(𝐗)=𝐘obs(𝐗)ϵobs(𝐗)𝐘^m(𝐗).\boldsymbol{\hat{\delta}}(\mathbf{X})=\boldsymbol{\delta}(\mathbf{X})+\epsilon_{\delta}(\mathbf{X})=\mathbf{Y_{\mathrm{obs}}}(\mathbf{X})-\epsilon_{\rm obs}(\mathbf{X})-\mathbf{\hat{Y}}_{m}(\mathbf{X}). (22)

In this work, a second GP model is trained for 𝜹^(𝐗)\boldsymbol{\hat{\delta}}(\mathbf{X}) in terms of the inputs. Thus two GP models are trained in Model 3. The first GP model is constructed using the physics model input-output data, and predicts 𝐘^m\mathbf{\hat{Y}}_{m}. The second GP model is constructed using the experimental data and the corresponding surrogate model predictions, and predicts 𝜹^\boldsymbol{\hat{\delta}} (the difference between the surrogate model prediction and actual system response).

The GP model for the model discrepancy captures the combined contribution of measurement error, physics and surrogate model errors for a given prediction. Thus, the predictions of the first GP model (pre-trained) are corrected with the second GP model predictions (𝜹^\boldsymbol{\hat{\delta}}) representing the model discrepancy term and can be written as

𝐘^(𝐗)=𝐘^m(𝐗)+𝜹^.\mathbf{\hat{Y}}(\mathbf{X})=\mathbf{\hat{Y}}_{m}(\mathbf{X})+\boldsymbol{\hat{\delta}}. (23)

Model 4, denoted as GPupd,phy\mathbf{\rm GP^{\rm upd,\mathcal{L}_{\rm phy}}}, combines both PIML strategies for GP, where the optimized model parameters of the pre-trained model based on the physics model input-output are used as the initial values. These model parameters are updated using the experimental data by minimizing the augmented loss function shown in Eq. (14) which consists of both the training loss function and the physics constraint loss terms.

3.2.2 Implementation of PIML in DNN models

In Model 5, denoted simply as DNN\mathbf{\rm DNN}, a deep neural network is trained using only experimental data. In order to train the model, an optimization algorithm is used to find a set of model parameters (weights and biases) that best map inputs to outputs. The number of epochs, which is the number of complete passes through a batch of training dataset, layers and neurons needs to be optimized to reduce cost and improve model accuracy. The model accuracy is evaluated using a validation dataset not used for training; the number of epochs is gradually increased until the accuracy improvement is insignificant. The accuracy and generalization performance of the DNN are also affected by the dropout rate used in training the model; the dropout concept will be discussed in Section 3.3 below, and the selection of the dropout rate will be discussed in Section 4.

Model 6, denoted as DNNphy\mathbf{\rm DNN^{\mathcal{L}_{\rm phy}}}, extends Model 5 by implementing the first PIML strategy, i.e., physical knowledge related to the physical process is enforced through constraints within the loss function of the DNN, as shown in Eq. (9). The physics-based loss function terms are evaluated for given experimental inputs at every optimization iteration during the training of DNNphy\mathbf{\rm DNN^{\mathcal{L}_{\rm phy}}}; this makes the optimization process slower during the training. In particular, the multipliers in the physics constraint penalty terms (λphyDNN\lambda^{\rm DNN}_{\rm phy}) affect the training speed; a higher value of the multiplier makes the penalty stronger (i.e., the physics constraints more stringent), thus requiring an increased number of iterations to converge to the optimum solution.

Model 7, denoted as DNNupd\mathbf{\rm DNN^{\rm upd}}, pursues the second PIML strategy, where a DNN model is pre-trained using the coupled multi-physics model input-output and then updated with experimental data. The pre-trained model is first trained with physics model input-output data consisting of input combinations over a range of values. Then, the weights and biases (model parameters) of this pre-trained network are updated using the experimental data.

Model 8, denoted as DNNupd,phy\mathbf{\rm DNN^{\rm upd,\mathcal{L}_{\rm phy}}}, combines both PIML strategies for DNN, where the optimized model parameters of the pre-trained model based on the physics model input-output are used as the initial values. These model parameters are updated using the experimental data by minimizing the augmented loss function shown in Eq. (11) which consists of both the training loss function and the physics constraint loss terms. Similar to Model 6, the inclusion of physics constraints makes it slower for the optimization to converge to optimal model parameter values.

3.3 Variance of GP and DNN prediction

In general, every surrogate model has uncertainty in prediction, whether acknowledged or not. In the GP models, the prediction at a given input is expressed by a normal distribution with a mean and variance. In order to quantify the uncertainty in the GP prediction, we can sample multiple realizations of the Gaussian process. Note that this only captures the variance of the GP prediction, not the bias, which can be evaluated by comparing against validation data.

In the DNN models, the estimates of the model parameters (neuron weights 𝐰\mathbf{w}) have uncertainty, and this uncertainty depends on the available training data. When the neural network parameters are represented using distributions (to reflect the epistemic uncertainty) instead of deterministic values, the model is referred to as a Bayesian neural network (BNN) [11, 33, 39]. In this Bayesian context, the model parameter uncertainty is first described using a prior distribution p(𝐰)p(\mathbf{w}), and the likelihood function is p(𝐘|𝐗,𝐰)p(\mathbf{Y}|\mathbf{X},\mathbf{w}). Following Bayes’ theorem, a posterior distribution over the model parameters given the training data {𝐗T,𝐘T}={{𝐱1,,𝐱N},{{𝐲1,,𝐲N}}\{\mathbf{X}_{T},\mathbf{Y}_{T}\}=\{\{\mathbf{x}_{1},...,\mathbf{x}_{N}\},\{\{\mathbf{y}_{1},...,\mathbf{y}_{N}\}\} is defined by

p(𝐰|𝐗,𝐘)=p(𝐘|𝐗,𝐰)p(𝐰)p(𝐘|𝐗).p(\mathbf{w}|\mathbf{X},\mathbf{Y})=\frac{p(\mathbf{Y}|\mathbf{X},\mathbf{w})p(\mathbf{w})}{p(\mathbf{Y}|\mathbf{X})}. (24)

In this context, the predictive distribution of the model outputs for a given input 𝐗^\hat{\mathbf{X}} is given by:

p(𝐘^|𝐗^,𝐗T,𝐘T)=Ωp(𝐘^|𝐗^,𝐰)p(𝐰|𝐗T,𝐘T)𝑑𝐰.p(\mathbf{\hat{\mathbf{Y}}}|\hat{\mathbf{X}},\mathbf{X}_{T},\mathbf{Y}_{T})=\int_{\Omega}p(\hat{\mathbf{Y}}|\hat{\mathbf{X}},\mathbf{w})p(\mathbf{w}|\mathbf{X}_{T},\mathbf{Y}_{T})d\mathbf{w}. (25)

The posterior distribution of model parameters p(𝐰|𝐗T,𝐘T)p(\mathbf{w}|\mathbf{X}_{T},\mathbf{Y}_{T}) is challenging to evaluate over the entire parameter space Ω\Omega due to the high dimensionality of Ω\Omega in a DNN model, and the highly non-linear behavior caused by the non-linear activation functions and their combinations across multiple hidden layers. Therefore, different approximate inference techniques can be considered to infer the posterior distribution p(𝐰|𝐗T,𝐘T)p(\mathbf{w}|\mathbf{X}_{T},\mathbf{Y}_{T}) [3, 17, 18, 12]. One such approximation is variational inference, which fits a simple and tractable distribution qθ(𝐰)q_{\theta}(\mathbf{w}) to the posterior, parametrized by a variational parameter θ\theta [3]. This approximates the intractable problem by optimizing the parameters of qθ(𝐰)q_{\theta}(\mathbf{w}). The quality of the variational inference can be assessed by the Kullback-Leibler (KL) divergence between the approximate distribution qθ(𝐰)q_{\theta}(\mathbf{w}) and the true model posterior p(𝐰|𝐗T,𝐘T)p(\mathbf{w}|\mathbf{X}_{T},\mathbf{Y}_{T}).

The term dropout refers to randomly dropping out neurons (along with their connections) with a given dropout rate during the training phase in a neural network. Dropout is a common regularization approach in neural network training, which prevents over-fitting and reduces generalization error. A Monte Carlo (MC) dropout technique has been developed in recent years in the context of Bayesian neural networks [13], which has been shown to be equivalent to performing approximate variational inference. In MC dropout, dropout is not only applied while training a model but also during prediction. Randomly chosen neurons are temporarily removed from the network along with their connections. Next, the gradients of neuron weights are calculated on a sub-neural network for each training data and these gradients are then averaged over the training sets to obtain the weights for the overall network. A Bayesian neural network with MC dropout generates random samples following a binomial distribution (0 or 1) for each neuron in the input and hidden layers during prediction. The neuron that takes the value 00 is dropped with probability pdp_{d}. The outputs of the network are predicted using the collection of generated random samples from the posterior predictive distribution and the uncertainty in the prediction of a new data is quantified with the trained network. Thus the MC dropout strategy provides an efficient way of Bayesian inference to quantify the model prediction variance, and can be applied to a variety of neural networks, such as feedforward neural networks, convolutional neural networks, and recurrent neural networks  [55].

The sensitivity estimate results depend on the dropout rate. The main reason for this is that the model is regularized and it underfits the data as it is over-regularized. Further, both the accuracy and uncertainty of the sensitivity estimates also depend on the number of training epochs, and the architecture of the network. If the model is not fully trained, it will also result in underfitting, leading to larger bias and variance in the prediction.

3.4 Sobol’ indices computation with model uncertainty

This section discusses the incorporation of ML model prediction variance within the estimation of Sobol’ indices using the GP and DNN models.

When the training data is noise-free, the GP predictions at the training points have zero variance and at other points the variance is non-zero. The prediction at any point is given by a normal distribution with a mean and variance. This prediction uncertainty can be captured by sampling multiple realizations of the GP model, which can then be used in GSA. The model uncertainty pertaining to the GP model is propagated to the Sobol’ index calculations using the following estimator (see [28]):

SiGP=VXi(E𝐗[𝐲P(𝐗)|Xi])V(𝐲P(𝐗))1mk=1m𝐲P(𝐗k)𝐲P(Xki)1mk=1m𝐲P(𝐗k)k=1m𝐲P(Xki)1mk=1m𝐲P(𝐗k)2[1mk=1m𝐲P(𝐗k)]2\displaystyle S^{\rm GP}_{i}=\frac{V_{X^{i}}\big(E_{\mathbf{X}}\big[\mathbf{y}_{P}(\mathbf{X})|X^{i}\big]\big)}{V\big(\mathbf{y}_{P}(\mathbf{X})\big)}\approx\frac{\frac{1}{m}\sum_{k=1}^{m}\mathbf{y}_{P}(\mathbf{X}_{k})\mathbf{y}_{P}(X_{k}^{i})-\frac{1}{m}\sum_{k=1}^{m}\mathbf{y}_{P}(\mathbf{X}_{k})\sum_{k=1}^{m}\mathbf{y}_{P}(X_{k}^{i})}{\frac{1}{m}\sum_{k=1}^{m}\mathbf{y}_{P}(\mathbf{X}_{k})^{2}-\big[\frac{1}{m}\sum_{k=1}^{m}\mathbf{y}_{P}(\mathbf{X}_{k})\big]^{2}} (26)

where 𝐲P(𝐗)\mathbf{y}_{P}(\mathbf{X}) is a realization of the predictive distribution shown in Eq. (6) trained using experimental data, and 𝐗k\mathbf{X}_{k} and XkiX_{k}^{i} are the kkth samples of the random vectors 𝐗\mathbf{X} and 𝐗i\mathbf{X}^{i}.

The distribution of SiGPS^{\rm GP}_{i} can be computed by sampling NZN_{Z} realizations from the Gaussian predictive distribution 𝐘P(𝐗)\mathbf{Y}_{P}(\mathbf{X}) numerically using Algorithm 1.

Algorithm 1 Estimation of the distribution of SiGPS^{\rm GP}_{i} using GP models.
1: Generate two samples 𝐗k\mathbf{X}_{k} and XkiX_{k}^{i} (k=1,,m){(k=1,\ldots,m)} of the random vectors 𝐗\mathbf{X} and XiX^{i}.
2: for p=1,2,,NZp=1,2,\ldots,N_{Z} do
3:   Sample a realization 𝐲P(𝐱)\mathbf{y}_{P}(\mathbf{x}) of 𝐘P(𝐗)\mathbf{Y}_{P}(\mathbf{X}) with 𝐱={(xk)k=1,,m,(xki)k=1,,m}\mathbf{x}=\{(x_{k})_{k=1,\ldots,m},(x_{k}^{i})_{k=1,\ldots,m}\}.
4:   Compute S^i,pGP\hat{S}^{\rm GP}_{i,p} using Eq. (26).
5: end forreturn (S^i,pGP)p=1,2,,NZ(\hat{S}^{\rm GP}_{i,p})_{p=1,2,\ldots,N_{Z}}.

The output of Algorithm 1 (S^i,pGP)p=1,2,,NZ(\hat{S}^{\rm GP}_{i,p})_{p=1,2,\ldots,N_{Z}} is a sample of size NZN_{Z}, where mm is the number of Monte Carlo samples. Thus, the mean and variance of sensitivity estimates obtained using the GP models are defined as follows, respectively:

μSiGP=1NZp=1NZS^i,pGP,\displaystyle\mu_{S^{\rm GP}_{i}}=\frac{1}{N_{Z}}\sum_{p=1}^{N_{Z}}\hat{S}^{\rm GP}_{i,p}, (27)
σSiGP2=1NZp=1NZ(S^i,pGPμSiGP)2.\displaystyle\sigma^{2}_{S^{\rm GP}_{i}}=\frac{1}{N_{Z}}\sum_{p=1}^{N_{Z}}(\hat{S}^{\rm GP}_{i,p}-\mu_{S^{\rm GP}_{i}})^{2}.

A similar approach can be implemented in the DNN models with the use of MC dropout (with a chosen dropout rate). However, in contrast to the GP models, where we sample from a multivariate normal distribution to quantify the uncertainty in the Sobol’ index estimates, the sampling implementation is different in the DNN models. In the DNN models, we randomly set units of the network to zero and generate predictions using the remaining units of the network as shown in Algorithm 2. The neuron weights can be drawn from the approximate posterior 𝐰^qθ(𝐰)\hat{\mathbf{w}}\sim q_{\theta}(\mathbf{w}) to obtain the model outputs of a DNN with MC dropout denoted as 𝒢w^(𝐗)=𝐘^\mathcal{G}^{\hat{w}}(\mathbf{X})=\hat{\mathbf{Y}}, where 𝐘^\hat{\mathbf{Y}} is the predictive mean,

The predictive posterior given in Eq. 25 can be defined as follows:

p(𝐘^|𝐗^,𝐗T,𝐘T)=𝒩(𝐘^,𝒢w^(𝐗),σ2𝐈)p(\mathbf{\hat{\mathbf{Y}}}|\hat{\mathbf{X}},\mathbf{X}_{T},\mathbf{Y}_{T})=\mathcal{N}(\hat{\mathbf{Y}};\mathcal{G}^{\hat{w}}(\mathbf{X}),\sigma^{2}\mathbf{I}) (28)

where σ2=(2Nλ)/((1pd)l2)\sigma^{2}=(2N\lambda)/((1-p_{d})l^{2}) is the noise term [13], ll being the prior length-scale, and λ\lambda is the regularization strength used in typical loss functions. Dropout can be interpreted as a variational Bayesian approximation and the minimization objective is defined by [23]

(θ,pd)=1Ni=1Nlogp(𝐘𝐢^|𝒢w^(𝐗𝐢))+1pd2N||θ||2\mathcal{L}(\theta,p_{d})=-\frac{1}{N}\sum_{i=1}^{N}\mathrm{log}\ p(\hat{\mathbf{Y_{i}}}|\mathcal{G}^{\hat{w}}(\mathbf{X_{i}}))+\frac{1-p_{d}}{2N}||\theta||^{2} (29)

where θ\theta is the set of distribution’s parameters to be optimized (i.e., weights of the network).

The predictive mean and predictive uncertainty are estimated by collecting the results of stochastic forward passes through the model. The mean prediction of the model with NdN_{d} samples can be approximated by

𝔼(𝐘)1Ndt=1Nd𝒢w^(𝐗),\mathbb{E}(\mathbf{Y})\approx\frac{1}{N_{d}}\sum_{t=1}^{N_{d}}\mathcal{G}^{\hat{w}}(\mathbf{X}), (30)

and the variance of the prediction is estimated by

Var(𝐘)σ2+1Ndt=1Nd𝒢w^(𝐗)T𝒢w^(𝐗)𝔼(𝐘)T𝔼(𝐘).\text{Var}(\mathbf{Y})\approx\sigma^{2}+\frac{1}{N_{d}}\sum_{t=1}^{N_{d}}\mathcal{G}^{\hat{w}}(\mathbf{X})^{T}\mathcal{G}^{\hat{w}}(\mathbf{X})-\mathbb{E}(\mathbf{Y})^{T}\mathbb{E}(\mathbf{Y}). (31)

Similar to Eq.  (26), the uncertainty in the DNN model can be propagated to the sensitivity calculations using the following estimator:

SiDNN=1mk=1m𝒢w^(𝐗k)𝒢w^(𝐗k)1mk=1m𝒢w^(𝐗k)k=1m𝒢w^(𝐗k)1mk=1m𝒢w^(𝐗k)21mk=1m(𝒢w^(𝐗k))2,\displaystyle S^{\rm DNN}_{i}=\frac{\frac{1}{m}\sum_{k=1}^{m}\mathcal{G}^{\hat{w}}(\mathbf{X}_{k})\mathcal{G}^{\hat{w}}(\mathbf{X}_{k}^{\prime})-\frac{1}{m}\sum_{k=1}^{m}\mathcal{G}^{\hat{w}}(\mathbf{X}_{k})\sum_{k=1}^{m}\mathcal{G}^{\hat{w}}(\mathbf{X}_{k}^{\prime})}{\frac{1}{m}\sum_{k=1}^{m}\mathcal{G}^{\hat{w}}(\mathbf{X}_{k})^{2}-\frac{1}{m}\sum_{k=1}^{m}(\mathcal{G}^{\hat{w}}(\mathbf{X}_{k}))^{2}}, (32)

where 𝒢w^(𝐗)\mathcal{G}^{\hat{w}}(\mathbf{X}) denotes the deep neural network (DNN) with MC dropout and all the other terms have the same definition as Eq. (26). We note that the model uncertainty is propagated to the calculation of the sensitivity estimates by directly using the results based on stochastic forward passes through a dropout-reduced DNN instead of the predictive mean and predictive uncertainty.

Algorithm 2 Estimation of the distribution of SmDNNS^{\rm DNN}_{m} using DNN models with MC dropout.
1: Generate samples 𝐗k\mathbf{X}_{k} and 𝐗k\mathbf{X}_{k}^{\prime} (k=1,,m){(k=1,\ldots,m)} of the random vectors 𝐗\mathbf{X} and 𝐗\mathbf{X}^{\prime}.
2: for p=1,2,,Ndp=1,2,\ldots,N_{d} do
3:   Perform a stochastic forward pass through the network 𝒢w^(𝐗)\mathcal{G}^{\hat{w}}(\mathbf{X}) using MC dropout and calculate the model prediction 𝐘^=𝒢w^(𝐗)\mathbf{\hat{Y}}=\mathcal{G}^{\hat{w}}(\mathbf{X}).
4:   Compute S^m,pDNN\hat{S}^{\rm DNN}_{m,p} using Eq. (32).
5: end forreturn (S^m,pDNN)p=1,2,,Nd(\hat{S}^{\rm DNN}_{m,p})_{p=1,2,\ldots,N_{d}}.

The output of Algorithm 2 (S^m,pDNN)p=1,2,,Nd(\hat{S}^{\rm DNN}_{m,p})_{p=1,2,\ldots,N_{d}} is a sample of size NdN_{d}. Thus, the mean and variance of sensitivity estimates obtained using DNN models are defined as follows, respectively:

μSmDNN=1Ndp=1NdS^m,pDNN,\displaystyle\mu_{S^{\rm DNN}_{m}}=\frac{1}{N_{d}}\sum_{p=1}^{N_{d}}\hat{S}^{\rm DNN}_{m,p}, (33)
σSmDNN2=1Ndp=1Nd(S^m,pDNNμSmDNN)2.\displaystyle\sigma^{2}_{S^{\rm DNN}_{m}}=\frac{1}{N_{d}}\sum_{p=1}^{N_{d}}(\hat{S}^{\rm DNN}_{m,p}-\mu_{S^{\rm DNN}_{m}})^{2}.

In summary, two types of PIML strategies are proposed in this section and implemented in two types of ML models (GP and DNN), in order to evaluate the accuracy and uncertainty of the sensitivity estimates in GSA. Eight different PIML models are developed by leveraging the two PIML strategies. The accuracy of these models can be assessed by comparison against validation data, whereas the variance of the sensitivity estimates can be quantified using Algorithms 1 and 2 and Eqs. 26 to 33. The different models have different training strategies and different numbers of parameters, both of which will affect the accuracy and uncertainty of the sensitivity estimates. These differences are assessed in detail in the next section.

4 Numerical illustration

4.1 Illustrative example 1

4.1.1 Problem setup

An additive manufacturing application is used to illustrate the proposed PIML models for GSA and compare their performance. A fused filament fabrication (FFF) process is considered; commercial material Ultimaker Black Acrylonitrile butadiene styrene (ABS) is extruded from an Ultimaker 2 Extended+ 3D printer to manufacture parts with unidirectionally aligned filaments, and the porosity of the manufactured part is measured. FFF is a widely used additive manufacturing (AM) process due to its easy operation, low cost, and suitability for complex geometries. As the molten filament is deposited layer upon layer through a nozzle, it cools down, solidifies and bonds with the adjacent filaments. Rectangular specimens of length 35 mm, width 12 mm, and thickness 4.2 mm are manufactured for the ABS amorphous polymer, with constant filament height, width and length (0.7, 0.8, and 35 mm, respectively).

The output QoI is the porosity of the printed part, and the inputs are two process parameters, namely nozzle temperature and speed. The porosity of an FFF part is dependent on the temperature history at the interfaces between filaments. Thus, it is important to predict the temperature evolution of filaments for estimating the final mesostructure of the printed part. The analytical solution proposed by Costa et al. [7] for transient heat transfer during the printing process in FFF is used to predict the temperature evolution of filaments. A physics-based sintering model is developed, which considers realistic filament geometry, and allows the filament geometry to change during the printing process [24]. This model is used to predict the porosity of the FFF part using the temperature evolution of filaments, material properties, part geometry, and process parameters as inputs. Thus the mapping from input to output is a multi-physics model, i.e., models of two physical phenomena (heat transfer and sintering) are combined to predict the porosity given the values of two process parameters: nozzle temperature and nozzle speed.

The statistical properties of the QoI were observed to have negligible variability along the length of the specimens; therefore only the porosity measurements taken at the midpoint cross-section (see Fig. 3) are discussed here. These measurements were based on microscopy images processed through the ImageJ software [49]. Filaments were extruded through a nozzle with 0.8 mm diameter. The build plate temperature was constant and set to 110110^{\circ}C. Using Latin hypercube sampling, 39 sets of process parameters 𝐗\mathbf{X} were generated, and experiments were conducted at these 39 values. The ranges considered for the two process variables were: nozzle temperature TT: (210C{}^{\circ}C - 260C260^{\circ}C), and nozzle speed SS: (15 mm/s - 46 mm/s).

Refer to caption
Figure 3: Cross-sectional geometry of an FFF specimen printed with nozzle temperature 240C and speed 42 mm/s.

4.1.2 Training details of the ML models

The basic ML models, namely Model 1 (for GP) and Model 5 (for DNN) are simply trained with the 39 sets of process inputs (temperature and speed) and output (porosity).

In the training of Model 2 (GPphy\mathbf{\rm GP^{\mathcal{L}_{\rm phy}}}) and Model 6 (DNNphy\mathbf{\rm DNN^{\mathcal{L}_{\rm phy}}}), we impose two physics constraints (i.e., two separate loss function terms, phy,k(𝐘^)\mathcal{L}_{{\rm phy},k}(\mathbf{\hat{Y}}), where k={1,2}k=\{1,2\} and 𝐘^\mathbf{\hat{Y}} is the porosity prediction). The corresponding loss function terms are defined as

phy,1(𝐘^)=1Ni=1NReLU(Y^i),\displaystyle{}\mathcal{L}_{{\rm phy},1}(\mathbf{\hat{Y}})=\frac{1}{N}\sum_{i=1}^{N}\rm{ReLU}(-\mathnormal{\hat{Y}}_{i}),
phy,2(𝐘^)=1Ni=1NReLU(Y^iϕ0,i),\displaystyle{}\mathcal{L}_{{\rm phy},2}(\mathbf{\hat{Y}})=\frac{1}{N}\sum_{i=1}^{N}\rm{ReLU}(\mathnormal{\hat{Y}}_{i}-\phi_{0,i}), (34)

considering physics violations related to the porosity in all the NN samples. In the first loss function, a negative value of porosity is treated as a physics violation. The second loss function penalizes the model when the predicted final porosity Y^i\mathnormal{\hat{Y}}_{i} is greater than the initial porosity ϕ0,i\phi_{0,i} of the iith part. This is based on the physics knowledge that the total void area decreases as the bond formation takes place. Thus, the porosity predictions are ensured to be physically meaningful with the inclusion of these physics-based penalty terms.

The overall “loss” function of the GP model is

GP¯=GPλphy,1GPphy,1(𝐘^)λphy,2GPphy,2(𝐘^).\displaystyle\mathcal{L_{\mathrm{\overline{GP}}}}=\mathcal{L}_{\rm GP}-\lambda^{\rm GP}_{\mathrm{phy,1}}\mathcal{L}_{\rm phy,1}(\mathbf{\hat{Y}})-\lambda^{\rm GP}_{\mathrm{phy,2}}\mathcal{L}_{\rm phy,2}(\mathbf{\hat{Y}}). (35)

Note that the GP model parameters are obtained by maximizing the above function.

The overall loss function of the DNN model is

DNN¯=DNN+λphy,1DNNphy,1(𝐘^)+λphy,2DNNphy,2(𝐘^).\displaystyle\mathcal{L_{\mathrm{\overline{DNN}}}}=\mathcal{L}_{\rm DNN}+\lambda^{\rm DNN}_{\mathrm{phy,1}}\mathcal{L}_{\rm phy,1}(\mathbf{\hat{Y}})+\lambda^{\rm DNN}_{\mathrm{phy,2}}\mathcal{L}_{\rm phy,2}(\mathbf{\hat{Y}}). (36)

Note that the DNN model parameters are obtained by minimizing the above function.

In Model 3 (GPupd\mathbf{\rm GP^{\rm upd}}) and Model 7 (DNNupd\mathbf{\rm DNN^{\rm upd}}), the ML models are pre-trained using the multi-physics model input-output. The pre-trained ML models are then updated using the experimental data. The training data for pre-training consists of 1310 input parameter combinations over a range of experimental values, i.e., (210C{}^{\circ}C T\leq T\leq 260C260^{\circ}C, 15 mm/s S\leq S\leq 46 mm/s ). Note that there are only 39 physical experiments available; this is one of the advantages of the pre-training/updating strategy, where the pre-training can be over a much larger set of input combinations, thus improving the generalization performance of the updated model. The input data are normalized prior to the training of the ML models (i.e., the output quantity porosity is dimensionless and between 0 and 1).

Model 4 (GPupd,phy\mathbf{\rm GP^{\rm upd,\mathcal{L}_{\rm phy}}}) combines both PIML strategies for GP, and consists of two GP models: (i) the first GP model is trained using the physics model input-output samples consisting of 1310 input parameter combinations; and (ii) the second GP model is built for the discrepancy between the first GP model prediction and the actual system response using the experimental data, by maximizing the function shown in Eq. (35) to optimize the hyperparameters of the second GP model.

Model 8 DNNupd,phy\mathbf{\rm DNN^{\rm upd,\mathcal{L}_{\rm phy}}}, which is a combination of the two PIML strategies, uses the DNN model parameters trained using the physics model input-output as the initial values. Then, during the updating phase with the experimental data, these parameters are updated by minimizing the loss function shown in Eq. (36).

The four GP models (Models 1 to 4) were implemented using Python. The optimization of the hyperparameters were performed using the scikit-optimize package. The multipliers of the physics constraint terms of models 2 (GPphy\mathbf{\rm GP^{\mathcal{L}_{\rm phy}}}) and 4 (GPupd,phy\mathbf{\rm GP^{\rm upd,\mathcal{L}_{\rm phy}}}) were chosen as (λphy,1GP,λphy,2GP)=(50,50)(\lambda^{\rm GP}_{\rm phy,1},\lambda^{\rm GP}_{\rm phy,2})=(50,50) based on a cross-validation test. The Automatic Relevance Determination (ARD) squared exponential function [43] was used as the covariance function for all the GP models.

The four DNN models (Models 5 to 8) were implemented using the Keras package [6] with Tensorflow in the backend. The hyperparameters of each model were tuned with grid search and the multipliers of the physics constraint terms in Model 6 (DNNphy\mathbf{\rm DNN^{\mathcal{L}_{\rm phy}}}) and Model 8 (DNNupd,phy\mathbf{\rm DNN^{\rm upd,\mathcal{L}_{\rm phy}}}) were chosen as (λphy,1DNN,λphy,2DNN)=(0.01,0.01)(\lambda^{\rm DNN}_{\rm phy,1},\lambda^{\rm DNN}_{\rm phy,2})=(0.01,0.01) based on a cross-validation test. Fully-connected DNN models with 2 hidden layers and 5 neurons in each hidden layer were constructed. The Rectified Linear Unit (ReLU) activation function and Adam optimizer were used to perform stochastic gradient descent for 300 epochs in learning the model parameters. The dropout rate for the DNN models was chosen to be 0.05, for reasons as explained below.

4.1.3 Comparison of computational effort

The computational costs of different models for training and estimation of Sobol’ indices based on 5000 MC samples with a fixed number of experimental data (n=39n=39) is given in Table. 1. Among the GP models, the time it takes for training as well as computation of Sobol’ indices using Models 2-4 is significantly greater than Model 1. The reason for the difference between the training time of GP\mathbf{\rm GP} and GPupd\mathbf{\rm GP^{\rm upd}} is the pre-training phase, where a large amount of physics input-output samples used. Whereas, the difference between the training time of GP\mathbf{\rm GP} and GPphy\mathbf{\rm GP^{\mathcal{L}_{\rm phy}}} is due to the inclusion of physics constraints, which makes it harder for the optimization to find optimal hyperparameters. Interestingly, the training time for the DNN models ranges from 20 to 55 sec on the same desktop computer as used for the GP model (Intel® Xeon® CPU E5-1660 v4@@3.20GHz with 32 GB RAM and GPU NVIDIA Quadro K620 with 2 GB). Among the DNN models, the reasons for the increased training time of models 6-8 compared to Model 5 are the same as for the GP models. The Sobol’ index estimations based on 5000 samples take approximately 1-2 minutes for the DNN models (models 5-8), whereas the GP predictions take much longer because the covariance matrix needs to be stored and inverted.

Table 1: Computational effort of eight models for training and estimation of first-order and total effect Sobol’ indices using 5000 MC samples with n=39n=39 number of observations.
Models Training [in minutes] Sobol’ indices calculation [in minutes]
1. GP\mathbf{\rm GP} 1 3
2. GPphy\mathbf{\rm GP^{\mathcal{L}_{\rm phy}}} 2 5
3. GPupd\mathbf{\rm GP^{\rm upd}} 3 7
4. GPupd,phy\mathbf{\rm GP^{\rm upd,\mathcal{L}_{\rm phy}}} 3 8
5. DNN\mathbf{\rm DNN} .3 1
6. DNNphy\mathbf{\rm DNN^{\mathcal{L}_{\rm phy}}} .7 2
7. DNNupd\mathbf{\rm DNN^{\rm upd}} .5 2
8. DNNupd,phy\mathbf{\rm DNN^{\rm upd,\mathcal{L}_{\rm phy}}} 1 2

4.1.4 Comparison of accuracy

In order to compare the accuracy of the eight different models, the models are trained with different amounts of experimental observations (n=(5,10,15,20,30)n=(5,10,15,20,30)), and the remaining 9 observations are used to compute the errors; the root mean square error (RMSE) based on the 9 validation samples is reported as the accuracy measure for comparison. The mean and one standard deviation RMSE values for the four GP models and the four DNN models are shown in Tables 2 and 3 respectively, for different values of nn. To further validate the accuracy of the models, the data set is divided into two subsets for cross-validation; kk-fold cross-validation is performed by splitting the data set into sets for model training and cross-validation, and these sets are selected randomly k=10k=10 different times. The average cross-validation accuracy of the models over the 10 folds (random shuffles) is assessed by evaluating the average RMSE (see Table 4).

The results in Tables 23 and 4 show that the use of PIML strategies in DNN models improves the performance, and the improvement is relatively larger as the amount of observed data nn gets smaller. For nn=20 and nn=30, the basic DNN model is as accurate as the DNN models with the PIML strategies; whereas for smaller values of nn, the DNN models with the PIML strategies are significantly more accurate. This clearly indicates the benefit of PIML over basic ML for the DNN models. However, the GP models incorporating PIML strategies do not show significant improvement. This is because the GP models have a much smaller number of parameters compared to the DNN models, and the achievable accuracy of any ML model is constrained by the number of model parameters (in addition to model form).

Table 2: Effect of different amounts of training data on the RMSE of the GP models.
Model n=5n=5 n=10n=10 n=15n=15 n=20n=20 n=30n=30
1. GP\mathbf{\rm GP} 0.020(±\pm0.004) 0.026(±\pm0.005) 0.021(±\pm0.001) 0.021(±\pm0.002) 0.020(±\pm0.001)
2. GPphy\mathbf{\rm GP^{\mathcal{L}_{\rm phy}}} 0.019(±\pm0.004) 0.026(±\pm0.004) 0.024(±\pm0.004) 0.021(±\pm0.002) 0.019(±\pm0.001)
3. GPupd\mathbf{\rm GP^{\rm upd}} 0.021(±\pm0.003) 0.028(±\pm0.003) 0.020(±\pm0.001) 0.020(±\pm0.001) 0.019(±\pm0.001)
4. GPupd,phy\mathbf{\rm GP^{\rm upd,\mathcal{L}_{\rm phy}}} 0.021(±\pm0.005) 0.023(±\pm0.003) 0.022(±\pm0.003) 0.020(±\pm0.002) 0.019(±\pm0.001)
Table 3: Effect of different amounts of training data on the RMSE of the DNN models.
Model n=5n=5 n=10n=10 n=15n=15 n=20n=20 n=30n=30
5. DNN\mathbf{\rm DNN} 0.027(±\pm0.007) 0.017(±\pm0.009) 0.019(±\pm0.006) 0.013(±\pm0.003) 0.013(±\pm0.003)
6. DNNphy\mathbf{\rm DNN^{\mathcal{L}_{\rm phy}}} 0.017(±\pm0.007) 0.015(±\pm0.008) 0.014(±\pm0.005) 0.014(±\pm0.003) 0.013(±\pm0.002)
7. DNNupd\mathbf{\rm DNN^{\rm upd}} 0.014(±\pm0.002) 0.009(±\pm0.002) 0.014(±\pm0.001) 0.013(±\pm0.001) 0.013(±\pm0.001)
8. DNNupd,phy\mathbf{\rm DNN^{\rm upd,\mathcal{L}_{\rm phy}}} 0.014(±\pm0.002) 0.009(±\pm0.001) 0.014(±\pm0.001) 0.014(±\pm0.001) 0.013(±\pm0.001)
Table 4: Tenfold cross-validation average RMSE results of GP and DNN models
Models
1. GP\mathbf{\rm GP} 2. GPphy\mathbf{\rm GP^{\mathcal{L}_{\rm phy}}} 3. GPupd\mathbf{\rm GP^{\rm upd}} 4. GPupd,phy\mathbf{\rm GP^{\rm upd,\mathcal{L}_{\rm phy}}} 5. DNN\mathbf{\rm DNN} 6. DNNphy\mathbf{\rm DNN^{\mathcal{L}_{\rm phy}}} 7. DNNupd\mathbf{\rm DNN^{\rm upd}} 8. DNNupd,phy\mathbf{\rm DNN^{\rm upd,\mathcal{L}_{\rm phy}}}
n=39n=39 0.021(±\pm0.002) 0.020(±\pm0.002) 0.020(±\pm0.001) 0.019(±\pm0.002) 0.015(±\pm0.004) 0.013(±\pm0.004) 0.013(±\pm0.003) 0.013(±\pm0.003)

In addition to the increased number of parameters, the DNN models have additional advantages in terms of training epochs and dropout rate that affect the prediction accuracy. As mentioned earlier, the optimum number of training epochs was found to be 300. Regarding dropout rate, the RMSE values (based on 9 validation samples) of DNN models with MC dropout for different dropout rates are shown in Fig. 4. The lowest RMSE values for all four models are obtained between 0.005-0.05. On the other hand, the Sobol’ index estimates were found to be similar within this range of dropout rate, for each of the four DNN models. Therefore, a dropout rate of 0.05 was chosen for the reporting of GSA results, since a higher dropout rate results in smaller sub-networks, therefore a smaller number of parameters and faster training. By comparing Tables 2 and 3, it is seen that at the dropout rate of 0.05, the DNN models are more accurate compared to the GP models.

Figure 4: RMSE values of DNN models with varying dropout rates.

The Sobol’ indices estimates obtained using the two approaches of the second PIML strategy are compared in Figs. 5 and 6. The results show that both approaches converge to similar first-order and total effect sensitivity index estimates. Thus, in the rest of the paper the first approach of the second PIML strategy is used for both GP and DNN models, i.e., GPupd\mathbf{\rm GP^{\rm upd}} and DNNupd\mathbf{\rm DNN^{\rm upd}}.

Figure 5: First-order sensitivity index estimators for (a) nozzle temperature, and (b) nozzle speed, using two different pre-training and updating approaches for GP.
Figure 6: Total effect sensitivity index estimates for (a) nozzle temperature, and (b) nozzle speed, using two different pre-training and updating approaches for GP.

4.1.5 GSA results using GP models

The Sobol’ index computations with the GP models (1-4) are based on 5000 MC samples and 100 realizations of the Gaussian process. The effect of the number of experimental observations (used to train the GP models) on the first-order Sobol’ index estimates from the four GP models is illustrated in Fig. 7. And the total effect Sobol’ index estimates from the GP models for different numbers of experimental training data are shown in Fig. 8. The mean values of sensitivity estimates based on the GP model predictions are denoted with solid dots at a given number of observations nn. The sensitivity results are reported for two input variables, nozzle temperature and nozzle speed; the output quantity of interest is porosity.

The 95% prediction intervals are represented with bars above and below the solid dots for the corresponding model. The bounds in the sensitivity estimates are calculated using the mean predictions based on the 100 realizations of the GP models. As expected, the prediction intervals decrease as increasing amounts of experimental data are used to train the GP models. Further, all four models converge to similar first-order and total effect sensitivity estimates for both printer nozzle temperature and speed. The relative individual contribution (at nn=39) of nozzle speed to the variance of the porosity (\approx 0.65) is greater than that of the nozzle temperature (\approx 0.25) and their sum is \approx 0.9. And the sum of their total effect indices (which capture parameter interactions) is slightly above 1.0, indicating that the interaction effect is small.

Figure 7: First-order sensitivity index estimates for (a) nozzle temperature, and (b) nozzle speed, using the GP models.
Figure 8: Total effect sensitivity index estimates for (a) nozzle temperature, and (b) nozzle speed, using the GP models.

For further clarity regarding uncertainty, numerical values of the prediction bounds of first-order sensitivity estimates of nozzle temperature obtained using 100 realizations of the GP models are shown in Table 5. The results indicate that prediction intervals obtained using the PIML models 3 and 4 (GPupd\mathbf{\rm GP^{\rm upd}} and GPupd,phy\mathbf{\rm GP^{\rm upd,\mathcal{L}_{\rm phy}}}) converge to the bounds obtained using 39 number of observations for training the models faster than the first two models. Note that the upper 95% bound for Model 2 (GPphy\mathbf{\rm GP^{\mathcal{L}_{\rm phy}}}) converges to its final value (0.33) within 10 experimental observations.

Table 5: First-order sensitivity estimate prediction bounds of nozzle temperature for different amounts of experimental training data, using the GP models.
Models Lower 95% confidence limit Upper 95% confidence limit
n=5 n=10 n=20 n=30 n=39 n=5 n=10 n=20 n=30 n=39
1. GP\mathbf{\rm GP} 0.00 0.08 0.13 0.20 0.19 0.37 0.25 0.34 0.35 0.33
2. GPphy\mathbf{\rm GP^{\mathcal{L}_{\rm phy}}} 0.00 0.00 0.05 0.16 0.18 0.55 0.33 0.43 0.34 0.33
3. GPupd\mathbf{\rm GP^{\rm upd}} 0.03 0.14 0.10 0.16 0.17 0.77 0.33 0.34 0.31 0.29
4. GPupd,phy\mathbf{\rm GP^{\rm upd,\mathcal{L}_{\rm phy}}} 0.06 0.11 0.14 0.18 0.20 0.71 0.38 0.34 0.31 0.32

4.1.6 GSA results using DNN models with MC dropout

The Sobol’ index computations with the DNN models (5-8) are based on 5000 MC samples and 100 stochastic forward passes through the networks. The calculated first-order sensitivity estimates of temperature and speed, STS_{T} and SSS_{S} respectively, for different numbers of experimental observations (training data) n=(5,10,20,30,39)n=(5,10,20,30,39) are shown in Fig. 9. The distributions of sensitivity estimates are obtained using MC dropout predictions based on 100 stochastic forward passes through the networks for different number of observations. The mean values of sensitivity estimates are represented with solid dots and the 95% bounds are denoted with bars above and below the solid dots for the corresponding model. Similarly, the calculated total effect sensitivity estimates STS_{T} and SSS_{S} for different values of nn are illustrated in Fig. 10. Similar to the GP results, the difference between the total effect and first-order indices of process inputs is negligible, which indicates that their interaction is not significant.

Figure 9: First-order sensitivity index estimators for (a) nozzle temperature, and (b) nozzle speed, using DNN models with MC dropout.
Figure 10: Total effect sensitivity index estimators for (a) nozzle temperature, and (b) nozzle speed, using DNN models with MC dropout.

All DNN models converge to similar first-order and total effect sensitivity estimates for both inputs, and these values are consistent with the results obtained using GP models. For this problem with two inputs and one output, 39 experimental observations appear adequate to train even the basic DNN model to achieve similar performance as the other physics-informed models; in fact, the results are similar even at 20 observations. However, the superior accuracy of the physics-informed models becomes apparent if only a small number of experiments are available, say n=5n=5 or n=10n=10, as shown in Table 3 and discussed earlier in Section 4.1.4.

For further clarity regarding uncertainty, numerical values of the prediction bounds of first-order sensitivity estimates of nozzle temperature obtained using 100 forward passes through the DNN models are given in Table 6. The results show that prediction intervals obtained using all models show a similar trend. The 95% bounds for all models are significantly narrower than the ones obtained using the GP models. The uncertainty in the sensitivity estimates due to the DNN models is almost negligible when more than 10 number of observations are used to train the models.

Table 6: First-order sensitivity estimate prediction bounds of nozzle temperature for different amounts of experimental training data, using the DNN models.
Models Lower 95% confidence limit Upper 95% confidence limit
n=5 n=10 n=20 n=30 n=39 n=5 n=10 n=20 n=30 n=39
5. DNN\mathbf{\rm DNN} 0.45 0.22 0.17 0.23 0.30 0.50 0.23 0.18 0.25 0.32
6. DNNphy\mathbf{\rm DNN^{\mathcal{L}_{\rm phy}}} 0.52 0.18 0.15 0.17 0.22 0.59 0.19 0.17 0.18 0.24
7. DNNupd\mathbf{\rm DNN^{\rm upd}} 0.78 0.30 0.12 0.22 0.25 0.81 0.32 0.15 0.24 0.27
8. DNNupd,phy\mathbf{\rm DNN^{\rm upd,\mathcal{L}_{\rm phy}}} 0.78 0.29 0.10 0.18 0.22 0.82 0.33 0.12 0.21 0.25

The 95% prediction intervals (upper limit-lower limit) decrease as increasing amounts of experimental data are used to train the DNN models. However, the prediction intervals obtained using the DNN models are much smaller than the ones obtained using the GP models since the DNN models has more degrees of freedom that can be optimized. For example, for n=39n=39, the prediction interval width is 0.02-0.03 for the DNN models, whereas it is 0.12-0.15 for the GP models. In addition to the larger number of parameters, the number of training epochs, which is the number of complete passes through a batch of training dataset, is optimized for the DNN models, thus maximizing their prediction accuracy. The prediction accuracy is further improved by choosing the appropriate dropout rate as discussed earlier. The number of parameters to be learned reduces with the use of dropout, which helps with regularization and prevents ill-conditioning. Further, the number of training epochs is also observed to affect both the accuracy and uncertainty of the sensitivity estimates. It was found that at a smaller number of epochs, the model was not fully trained resulting in underfitting, leading to larger bias and variance in the prediction. As the number of epochs was increased, both the bias and the variance were reduced.

4.2 Illustrative example 2

4.2.1 Problem setup

In order to further illustrate the effectiveness of the proposed method and how different combinations of methods affect the accuracy and computational effort, a more complex problem involving eleven random variables is considered. The data set used by Karpatne et al. [26] for lake temperature modeling is considered, at Lake Mendota in Wisconsin, USA.

The overall data for Lake Mendota comprised of 13,543 temperature observations from 30 April 1980 to 02 Nov 2015. The modeling uses used 11 meteorological drivers as input variables. The original physics-based model, referred to as the General Lake Model (GLM), modeled the lake temperature by performing 1-D analysis (along depth) considering a variety of lake variables, and produced a total of 662,781 training samples (input-output). The physical non-linear relationship between temperature, depth and density of water is used to evaluate the physical violations across every consecutive depth-pair and time step. A more detailed description of the physics-based loss function and data can be found in the work by Karpatne et al. [26].

4.2.2 Comparison of computational effort

The computational costs of different models for training and estimation of Sobol’ indices based on 5000 MC samples with a fixed number of experimental data (n=1000n=1000) is given in Table. 7. The desktop computer used for the illustrative example 1 (Intel® Xeon® CPU E5-1660 v4@@3.20GHz with 32 GB RAM and GPU NVIDIA Quadro K620 with 2 GB) is used for the computations of Sobol’ indices. Among the GP models, the time it takes for training as well as computation of Sobol’ indices using Models 2-4 is similar to Model 1. The Sobol’ index estimations based on 5000 samples take approximately 1-3 minutes for the DNN models (Models 5-8). The training time and the computation of Sobol’ indices using DNN models are significantly less than Models 1-4, which use the GP models, since the GP predictions require the covariance matrix to be inverted.

Table 7: Computational effort of eight models for training and estimation of first-order and total effect Sobol’ indices using 5000 MC samples with n=1000n=1000 number of temperature observations.
Models Training [in minutes] Sobol’ indices calculation [in minutes]
1. GP\mathbf{\rm GP} 37.5 40.1
2. GPphy\mathbf{\rm GP^{\mathcal{L}_{\rm phy}}} 37.9 41.2
3. GPupd\mathbf{\rm GP^{\rm upd}} 36.8 39.7
4. GPupd,phy\mathbf{\rm GP^{\rm upd,\mathcal{L}_{\rm phy}}} 36.9 39.8
5. DNN\mathbf{\rm DNN} 1.3 2.8
6. DNNphy\mathbf{\rm DNN^{\mathcal{L}_{\rm phy}}} 2.7 5.7
7. DNNupd\mathbf{\rm DNN^{\rm upd}} 1.4 2.8
8. DNNupd,phy\mathbf{\rm DNN^{\rm upd,\mathcal{L}_{\rm phy}}} 2.8 6.1

4.2.3 GSA results using GP models

The effect of the number of experimental observations on the first-order and total effect Sobol’ index estimates from the four GP models of the lake temperature modeling is illustrated in Figs. 11 and 12.

Figure 11: First-order sensitivity index estimators for the eleven variables of the lake temperature modeling using the GP models.

The 95% prediction intervals are represented with bars above and below the solid dots for the corresponding model. The prediction intervals decrease as increasing amounts of experimental data are used to train the GP models. In addition, all four models converge to similar first-order and total effect sensitivity estimates for all input variables.

Figure 12: Total effect sensitivity index estimates for the eleven variables of the lake temperature modeling using the GP models.

4.2.4 GSA results using DNN models with MC dropout

The Sobol’ index computations with the DNN models (5-8) are based on 5000 MC samples and 100 stochastic forward passes through the networks. The calculated first-order sensitivity estimates of eleven input variables, for different numbers of experimental observations (training data) n=(100,250,500,750,1000)n=(100,250,500,750,1000) are shown in Figs. 13 and 14.

Figure 13: First-order sensitivity index estimators for the eleven variables of the lake temperature modeling using the DNN models.
Figure 14: Total effect sensitivity index estimates for the eleven variables of the lake temperature modeling using the DNN models.

All DNN models converge to similar first-order and total effect sensitivity estimates for all eleven inputs, and these values are consistent with the results obtained using GP models. The total effect sensitivity estimates obtained using the basic GP and DNN models for most of the input variables converge to a slightly different value than the ones obtained using the proposed PIML models. Note that the mean estimates of the PIML models converge more smoothly than the basic ML models.

The results show that prediction intervals obtained using all models show a similar trend. The 95% bounds for all DNN models are significantly narrower than the ones obtained using the GP models. The results indicate that the mean estimates and prediction intervals obtained using the PIML models 4 and 8 (GPupd,phy\mathbf{\rm GP^{\rm upd,\mathcal{L}_{\rm phy}}} and DNNupd,phy\mathbf{\rm DNN^{\rm upd,\mathcal{L}_{\rm phy}}}) converge to the mean estimates and bounds obtained using 1000 number of observations for training the models faster than the other models. Note that the mean estimates for Models 4 and 8 (GPupd,phy\mathbf{\rm GP^{\rm upd,\mathcal{L}_{\rm phy}}} and DNNupd,phy\mathbf{\rm DNN^{\rm upd,\mathcal{L}_{\rm phy}}}) converge to their final values within 250 experimental observations for almost of the variables. The prediction bounds of DNN models do not change significantly as more experimental observations are used to train the models. However, the prediction bounds get smaller as more number of training data is used to train the GP models. Moreover, the prediction bounds of physics-informed models are slightly narrower than the basic GP model. For further clarity regarding uncertainty, numerical values of the prediction bounds of first-order sensitivity estimates of X1X_{1} (day of year) obtained using 100 realizations of the GP models and 100 forward passes through the DNN models are shown in Table 8.

Table 8: First-order sensitivity estimate prediction bounds of X1X_{1} (day of year) for different amounts of experimental training data, using the GP and DNN models.
Models Lower 95% confidence limit Upper 95% confidence limit
n=100 n=250 n=500 n=750 n=1000 n=100 n=250 n=500 n=750 n=1000
1. GP\mathbf{\rm GP} 0.00 0.27 0.67 0.61 0.24 0.38 0.71 0.82 0.77 0.53
2. GPphy\mathbf{\rm GP^{\mathcal{L}_{\rm phy}}} 0.01 0.51 0.60 0.63 0.32 0.36 0.76 0.77 0.77 0.55
3. GPupd\mathbf{\rm GP^{\rm upd}} 0.54 0.48 0.70 0.65 0.49 0.82 0.78 0.82 0.80 0.68
4. GPupd,phy\mathbf{\rm GP^{\rm upd,\mathcal{L}_{\rm phy}}} 0.46 0.40 0.59 0.55 0.42 0.69 0.66 0.69 0.68 0.57
5. DNN\mathbf{\rm DNN} 0.06 0.14 0.08 0.45 0.16 0.08 0.16 0.12 0.49 0.19
6. DNNphy\mathbf{\rm DNN^{\mathcal{L}_{\rm phy}}} 0.06 0.12 0.18 0.30 0.30 0.09 0.15 0.21 0.33 0.33
7. DNNupd\mathbf{\rm DNN^{\rm upd}} 0.03 0.29 0.15 0.41 0.37 0.06 0.33 0.20 0.45 0.41
8. DNNupd,phy\mathbf{\rm DNN^{\rm upd,\mathcal{L}_{\rm phy}}} 0.00 0.30 0.19 0.29 0.32 0.02 0.33 0.23 0.34 0.37

The results of these numerical examples could be summarized as follows:

  • The GP models required more computational effort than the DNN models, both in training and prediction.

  • The DNN models were able to achieve higher accuracy and lower uncertainty in prediction, due to the optimization of dropout rate and number of training epochs.

  • The physics-informed ML models are able to achieve higher prediction accuracy than the basic ML models, especially when the amount of available experimental data is small.

Overall, for these numerical examples, the DNN models gave higher accuracy and lower uncertainty in the GSA results than the GP models, and also required less computational effort both in training and prediction. However, the first numerical example consisted of only two inputs and a single output. As the number of inputs and outputs increase with the second numerical example, all the ML models considered above were challenged w.r.t. adequacy of training data, computational effort in training and prediction, and the accuracy and uncertainty of the sensitivity estimates. The results showed that the mean estimates of the PIML Models 4 and 8 (GPupd,phy\mathbf{\rm GP^{\rm upd,\mathcal{L}_{\rm phy}}} and DNNupd,phy\mathbf{\rm DNN^{\rm upd,\mathcal{L}_{\rm phy}}}) for both numerical examples converge to the mean estimates obtained using the largest number of observations (i.e., 39 and 1000 observations for the first and second numerical example, respectively) for training the models faster than the other models.

5 Conclusion

This paper developed methodologies for information fusion and machine learning for sensitivity analysis using both physics knowledge and experimental data, while accounting for model uncertainty. Variance-based sensitivity analysis is used to quantify the relative contribution of each uncertainty source to the variability of the output quantity. Two types of ML models were considered, namely, GP and DNN models. Several PIML models were developed by leveraging two strategies for incorporating physics knowledge into ML models: (1) incorporating physics constraints within the loss functions used in training the ML models, and (2) pre-training an ML model with simulation data and then updating it with experimental data. The first strategy does not use the physics model, whereas the second strategy does.

The calculation of the Sobol’ indices with the GP model simply uses the proposed estimator (Eq. 26). On the other hand, with respect to the DNN model, we use the Monte Carlo dropout strategy to compute prediction bounds on the Sobol’ indices; previous work in this regard has only considered prediction bounds of the model output. Prediction bounds are computed for the sensitivity index estimates to account for the model uncertainty in the trained models, and the accuracy and computational effort of the various PIML models are compared.

The results show that the application of PIML strategies to both GP and DNN enables accurate Sobol’ index computations even with smaller amounts of experimental data while producing physically meaningful results. Thus, the proposed approach helps to fill the physics knowledge gap in the ML models while estimating the Sobol’ indices, by correcting for the approximation in the physics-based models. The numerical examples show that training the GP models and estimating the Sobol’ indices require more computational effort than the DNN models. The uncertainty regarding the sensitivity estimates obtained using the DNN models is smaller than the results obtained using the GP models. In the numerical examples, the DNN models are found to be more accurate compared to the GP models. The higher accuracy, lower uncertainty, and lower computational effort of the DNN models is attributed to their flexibility in terms of number of parameters, training epochs and dropout rate.

In future work, the proposed PIML approaches need to be tested for problems with a larger number of dimensions both in the input and output, with multiple combinations to further analyze the convergence of Sobol’ index estimates. Future work can also explore the weighting of the two sources of information, since the data produced by physics-based models and experiments have different levels of credibility. The proposed approach for GP models can also be extended by using different kernels with varying smoothness. We note that only one kernel, namely the Gaussian kernel, is used in this paper. In order to have a more complete comparison between the GP and DNN models, different kernels with varying smoothness can be considered for future work.

References

  • [1] G. N. Absi and S. Mahadevan (2016) Multi-fidelity approach to dynamics model calibration. Mechanical Systems and Signal Processing 68, pp. 189–206. External Links: Document Cited by: §3.2.1.
  • [2] G. E. B. Archer, A. Saltelli, and I. M. Sobol (1997) Sensitivity measures, anova-like techniques and the use of bootstrap. Journal of Statistical Computation and Simulation 58 (2), pp. 99–120. External Links: Document, Link, https://doi.org/10.1080/00949659708811825 Cited by: §1.
  • [3] C. Blundell, J. Cornebise, K. Kavukcuoglu, and D. Wierstra (2015) Weight uncertainty in neural networks. External Links: 1505.05424 Cited by: §3.3.
  • [4] E. Borgonovo and E. Plischke (2016) Sensitivity analysis: a review of recent advances. European Journal of Operational Research 248 (3), pp. 869 – 887. External Links: ISSN 0377-2217, Document, Link Cited by: §1.
  • [5] W. Chen, R. Jin, and A. Sudjianto (2004) Analytical Variance-Based Global Sensitivity Analysis in Simulation-Based Design Under Uncertainty. Journal of Mechanical Design 127 (5), pp. 875–886. External Links: ISSN 1050-0472, Document, Link, https://asmedigitalcollection.asme.org/mechanicaldesign/article-pdf/127/5/875/5922817/875_1.pdf Cited by: §1.
  • [6] F. Chollet et al. (2015) Keras. GitHub. External Links: Link Cited by: §4.1.2.
  • [7] S.F. Costa, F.M. Duarte, and J.A. Covas (2017) Estimation of filament temperature and adhesion development in fused deposition techniques. Journal of Materials Processing Technology 245, pp. 167 – 179. External Links: ISSN 0924-0136, Document, Link Cited by: §4.1.1.
  • [8] A. Cousin, H. Maatouk, and D. Rullière (2016) Kriging of financial term-structures. European Journal of Operational Research 255 (2), pp. 631 – 648. External Links: ISSN 0377-2217, Document, Link Cited by: §3.2.1.
  • [9] S. Da Veiga and A. Marrel (2012) Gaussian process modeling with inequality constraints. Annales de la Faculté des sciences de Toulouse : Mathématiques Ser. 6, 21 (3), pp. 529–555 (en). External Links: Document, Link, MathReview Entry Cited by: §3.2.1.
  • [10] E. C. DeCarlo, S. Mahadevan, and B. P. Smarslok (2018) Efficient global sensitivity analysis with correlated variables. Structural and Multidisciplinary Optimization 58 (6), pp. 2325–2340. External Links: ISSN 1615-1488, Document Cited by: §1.
  • [11] J. S. Denker and Y. LeCun (1990) Transforming neural-net output levels to probability distributions. In Proceedings of the 3rd International Conference on Neural Information Processing Systems, NIPS’90, San Francisco, CA, USA, pp. 853–859. External Links: ISBN 1558601848 Cited by: §3.3.
  • [12] Y. Gal and Z. Ghahramani (2015) Bayesian convolutional neural networks with bernoulli approximate variational inference. External Links: 1506.02158 Cited by: §3.3.
  • [13] Y. Gal and Z. Ghahramani (2016) Dropout as a bayesian approximation: representing model uncertainty in deep learning. In Proceedings of the 33rd International Conference on International Conference on Machine Learning - Volume 48, ICML’16, pp. 1050–1059. Cited by: §3.3, §3.4.
  • [14] V. Ginot, S. Gaba, R. Beaudouin, F. Aries, and H. Monod (2006) Combined use of local and anova-based global sensitivity analyses for the investigation of a stochastic dynamic model: application to the case study of an individual-based model of a fish population. Ecological Modelling 193 (3), pp. 479 – 491. External Links: ISSN 0304-3800, Document, Link Cited by: §1.
  • [15] S. Golchi, D. R. Bingham, H. Chipman, and D. A. Campbell (2015) Monotone emulation of computer experiments. SIAM/ASA Journal on Uncertainty Quantification 3 (1), pp. 370–392. External Links: Link Cited by: §3.2.1.
  • [16] L. L. Gratiet, S. Marelli, and B. Sudret (2015) Metamodel-based sensitivity analysis: polynomial chaos expansions and gaussian processes. Handbook of Uncertainty Quantification, pp. 1–37. External Links: ISBN 9783319112596, Link, Document Cited by: §2.1.
  • [17] A. Graves (2011) Practical variational inference for neural networks. In Advances in Neural Information Processing Systems 24, J. Shawe-Taylor, R. S. Zemel, P. L. Bartlett, F. Pereira, and K. Q. Weinberger (Eds.), pp. 2348–2356. External Links: Link Cited by: §3.3.
  • [18] J. Hernandez-Lobato, Y. Li, M. Rowland, T. Bui, D. Hernandez-Lobato, and R. Turner (2016) Black-box alpha divergence minimization. Proceedings of Machine Learning Research, Vol. 48, pp. 1511–1520. External Links: Link Cited by: §3.3.
  • [19] Z. Hu and X. Du (2015) Mixed Efficient Global Optimization for Time-Dependent Reliability Analysis. Journal of Mechanical Design 137 (5). Note: 051401 External Links: ISSN 1050-0472, Document, Link, https://asmedigitalcollection.asme.org/mechanicaldesign/article-pdf/137/5/051401/6226662/md_137_05_051401.pdf Cited by: §2.1.
  • [20] Z. Hu and S. Mahadevan (2019) Probability models for data-driven global sensitivity analysis. Reliability Engineering & System Safety 187, pp. 40 – 57. Note: Sensitivity Analysis of Model Output External Links: ISSN 0951-8320, Document, Link Cited by: §1.
  • [21] A. Janon, M. Nodet, and C. Prieur (2014) UNCERTAINTIES assessment in global sensitivity indices estimation from metamodels. International Journal for Uncertainty Quantification 4 (1), pp. 21–36. External Links: ISSN 2152-5080 Cited by: §2.1.
  • [22] X. Jia, J. Willard, A. Karpatne, J. S. Read, J. A. Zwart, M. Steinbach, and V. Kumar (2020) Physics-Guided Machine Learning for Scientific Discovery: An Application in Simulating Lake Temperature Profiles. External Links: 2001.11086 Cited by: §1.
  • [23] M. I. Jordan, Z. Ghahramani, T. S. Jaakkola, and L. K. Saul (1999) An introduction to variational methods for graphical models. Machine learning 37 (2), pp. 183–233. External Links: Document Cited by: §3.4.
  • [24] B. Kapusuzoglu and S. Mahadevan (2020) Physics-informed and hybrid machine learning in additive manufacturing: application to fused filament fabrication. JOM, pp. 1–11. External Links: Document Cited by: §1, §4.1.1.
  • [25] B. Kapusuzoglu, M. Sato, S. Mahadevan, and P. Witherell (2020) Process Optimization under Uncertainty for Improving the Bond Quality of Polymer Filaments in Fused Filament Fabrication. Journal of Manufacturing Science and Engineering, pp. 1–46. External Links: ISSN 1087-1357, Link Cited by: §3.2.1.
  • [26] A. Karpatne, W. Watkins, J. Read, and V. Kumar (2017) Physics-guided Neural Networks (PGNN): An Application in Lake Temperature Modeling. External Links: 1710.11431 Cited by: §1, §3.1.1, §3.1.1, §4.2.1, §4.2.1.
  • [27] M. C. Kennedy and A. O’Hagan (2001) Bayesian calibration of computer models. Journal of the Royal Statistical Society: Series B (Statistical Methodology) 63 (3), pp. 425–464. External Links: Document, Link, https://rss.onlinelibrary.wiley.com/doi/pdf/10.1111/1467-9868.00294 Cited by: §3.2.1, §3.2.1.
  • [28] L. Le Gratiet, C. Cannamela, and B. Iooss (2014) A bayesian approach for global sensitivity analysis of (multifidelity) computer codes. SIAM/ASA Journal on Uncertainty Quantification 2 (1), pp. 336–363. External Links: Document Cited by: §1, §1, §3.4.
  • [29] C. Li and S. Mahadevan (2016) An efficient modularized sample-based method to estimate the first-order sobol index. Reliability Engineering & System Safety 153, pp. 110 – 121. External Links: ISSN 0951-8320, Document, Link Cited by: §1.
  • [30] C. Li and S. Mahadevan (2016) Relative contributions of aleatory and epistemic uncertainty sources in time series prediction. International Journal of Fatigue 82, pp. 474 – 486. External Links: ISSN 0142-1123, Document, Link Cited by: §1, §1.
  • [31] Y. Ling, J. Mullins, and S. Mahadevan (2014) Selection of model discrepancy priors in Bayesian calibration. Journal of Computational Physics 276, pp. 665 – 680. External Links: ISSN 0021-9991, Document, Link Cited by: §3.2.1.
  • [32] A. F. López-Lopera, F. Bachoc, N. Durrande, and O. Roustant (2018) Finite-dimensional gaussian approximation with linear inequality constraints. SIAM/ASA Journal on Uncertainty Quantification 6 (3), pp. 1224–1255. External Links: Link Cited by: §3.2.1.
  • [33] D. J. MacKay (1992) A practical bayesian framework for backpropagation networks. Neural Computation 4 (3), pp. 448–472. Cited by: §3.3.
  • [34] T. A. Mara and S. Tarantola (2012) Variance-based sensitivity indices for models with dependent inputs. Reliability Engineering & System Safety 107, pp. 115 – 121. Note: SAMO 2010 External Links: ISSN 0951-8320, Document, Link Cited by: §1.
  • [35] A. Marrel, B. Iooss, S. Da Veiga, and M. Ribatet (2012) Global sensitivity analysis of stochastic computer models with joint metamodels. Statistics and Computing 22 (3), pp. 833–847. External Links: ISSN 1573-1375, Document, Link Cited by: §2.1.
  • [36] A. Marrel, B. Iooss, B. Laurent, and O. Roustant (2009) Calculations of sobol indices for the gaussian process metamodel. Reliability Engineering & System Safety 94 (3), pp. 742 – 751. External Links: ISSN 0951-8320, Document, Link Cited by: §1.
  • [37] A. Marrel, B. Iooss, F. Van Dorpe, and E. Volkova (2008) An efficient methodology for modeling complex computer codes with gaussian processes. Computational Statistics & Data Analysis 52 (10), pp. 4731 – 4744. External Links: ISSN 0167-9473, Document, Link Cited by: §1.
  • [38] N. Muralidhar, M. R. Islam, M. Marwah, A. Karpatne, and N. Ramakrishnan (2018) Incorporating prior domain knowledge into deep neural networks. In 2018 IEEE International Conference on Big Data (Big Data), Vol. , pp. 36–45. Cited by: §3.1.1.
  • [39] R. M. Neal (1996) Bayesian learning for neural networks. Lecture Notes in Statistics (), pp. . External Links: ISSN , Link, Document Cited by: §3.3.
  • [40] J. E. Oakley and A. O’Hagan (2004) Probabilistic sensitivity analysis of complex models: a bayesian approach. Journal of the Royal Statistical Society: Series B (Statistical Methodology) 66 (3), pp. 751–769. External Links: Document, Link, https://rss.onlinelibrary.wiley.com/doi/pdf/10.1111/j.1467-9868.2004.05304.x Cited by: §1.
  • [41] A. O’Hagan (2006) Bayesian analysis of computer code outputs: a tutorial. Reliability Engineering & System Safety 91 (10), pp. 1290 – 1300. Note: The Fourth International Conference on Sensitivity Analysis of Model Output (SAMO 2004) External Links: ISSN 0951-8320, Document, Link Cited by: §1.
  • [42] B. Peherstorfer, K. Willcox, and M. Gunzburger (2018) Survey of multifidelity methods in uncertainty propagation, inference, and optimization. Siam Review 60 (3), pp. 550–591. Cited by: §3.2.1.
  • [43] C. E. Rasmussen and C. K. Williams (2006) Gaussian processes for machine learning. Vol. 2, MIT press Cambridge, MA. Cited by: §2.2, §4.1.2.
  • [44] J. Riihimäki and A. Vehtari (2010) Gaussian processes with monotonicity information. Y. W. Teh and M. Titterington (Eds.), Proceedings of Machine Learning Research, Vol. 9, Chia Laguna Resort, Sardinia, Italy, pp. 645–652. External Links: Link Cited by: §3.2.1.
  • [45] A. Saltelli, S. Tarantola, and K. P.-S. Chan (1999) A quantitative model-independent method for global sensitivity analysis of model output. Technometrics 41 (1), pp. 39–56. External Links: Document, Link, https://www.tandfonline.com/doi/pdf/10.1080/00401706.1999.10485594 Cited by: §1, §1.
  • [46] A. Saltelli, M. Ratto, T. Andres, F. Campolongo, J. Cariboni, D. Gatelli, M. Saisana, and S. Tarantola (2008) Global sensitivity analysis: the primer. John Wiley & Sons. Cited by: §1.
  • [47] S. Sankararaman and S. Mahadevan (2013) Separating the contributions of variability and parameter uncertainty in probability distributions. Reliability Engineering & System Safety 112, pp. 187 – 199. External Links: ISSN 0951-8320, Document, Link Cited by: §1, §1.
  • [48] F. E. Satterthwaite (1959) Random balance experimentation. Technometrics 1 (2), pp. 111–137. External Links: Document, Link, https://www.tandfonline.com/doi/pdf/10.1080/00401706.1959.10489853 Cited by: §1.
  • [49] C. A. Schneider, W. S. Rasband, and K. W. Eliceiri (2012) NIH Image to ImageJ: 25 years of image analysis. Nature methods 9 (7), pp. 671–675. Cited by: §4.1.1.
  • [50] I. Sobol (2001) Global sensitivity indices for nonlinear mathematical models and their monte carlo estimates. Mathematics and Computers in Simulation 55 (1), pp. 271 – 280. Note: The Second IMACS Seminar on Monte Carlo Methods External Links: ISSN 0378-4754, Document, Link Cited by: §1, §2.1, §2.1.
  • [51] B. Sudret (2008) Global sensitivity analysis using polynomial chaos expansions. Reliability Engineering & System Safety 93 (7), pp. 964 – 979. Note: Bayesian Networks in Dependability External Links: ISSN 0951-8320, Document, Link Cited by: §1.
  • [52] S. Tarantola, D. Gatelli, and T.A. Mara (2006) Random balance designs for the estimation of first order global sensitivity indices. Reliability Engineering & System Safety 91 (6), pp. 717 – 727. External Links: ISSN 0951-8320, Document, Link Cited by: §1.
  • [53] J. Willard, X. Jia, S. Xu, M. Steinbach, and V. Kumar (2020) Integrating physics-based modeling with machine learning: a survey. External Links: 2003.04919 Cited by: §1, §3.1.
  • [54] D. Xiu and G. E. Karniadakis (2002) The wiener–askey polynomial chaos for stochastic differential equations. SIAM journal on scientific computing 24 (2), pp. 619–644. External Links: ISSN 1095-7197, Document, Link Cited by: §2.1.
  • [55] X. Zhang and S. Mahadevan (2020) Bayesian neural networks for flight trajectory prediction and safety assessment. Decision Support Systems 131, pp. 113246. External Links: ISSN 0167-9236, Document, Link Cited by: §3.3.