Uncertainty quantification

Uncertainty quantification (UQ) is the science of quantitative characterization and estimation of uncertainties in both computational and real world applications. It tries to determine how likely certain outcomes are if some aspects of the system are not exactly known. An example would be to predict the acceleration of a human body in a head-on crash with another car: even if the speed was exactly known, small differences in the manufacturing of individual cars, how tightly every bolt has been tightened, etc., will lead to different results that can only be predicted in a statistical sense.

Many problems in the natural sciences and engineering are also rife with sources of uncertainty. Computer experiments on computer simulations are the most common approach to study problems in uncertainty quantification.

Aleatoric and epistemic
Uncertainty is sometimes classified into two categories, prominently seen in medical applications.


 * Aleatoric: Aleatoric uncertainty is also known as stochastic uncertainty, and is representative of unknowns that differ each time we run the same experiment. For example, a single arrow shot with a mechanical bow that exactly duplicates each launch (the same acceleration, altitude, direction and final velocity) will not all impact the same point on the target due to random and complicated vibrations of the arrow shaft, the knowledge of which cannot be determined sufficiently to eliminate the resulting scatter of impact points. The argument here is obviously in the definition of "cannot".  Just because we cannot measure sufficiently with our currently available measurement devices does not preclude necessarily the existence of such information, which would move this uncertainty into the below category. Aleatoric is derived from the Latin alea or dice, referring to a game of chance.
 * Epistemic uncertainty: Epistemic uncertainty is also known as systematic uncertainty, and is due to things one could in principle know but does not in practice. This may be because a measurement is not accurate, because the model neglects certain effects, or because particular data have been deliberately hidden. An example of a source of this uncertainty would be the drag in an experiment designed to measure the acceleration of gravity near the earth's surface. The commonly used gravitational acceleration of 9.8 m/s² ignores the effects of air resistance, but the air resistance for the object could be measured and incorporated into the experiment to reduce the resulting uncertainty in the calculation of the gravitational acceleration.
 * Combined occurrence and interaction of aleatoric and epistemic uncertainty: Aleatoric and epistemic uncertainty can also occur simultaneously in a single term E.g., when experimental parameters show aleatoric uncertainty, and those experimental parameters are input to a computer simulation. If then for the uncertainty quantification a surrogate model, e.g. a Gaussian process or a Polynomial Chaos Expansion, is learnt from computer experiments, this surrogate exhibits epistemic uncertainty that depends on or interacts with the aleatoric uncertainty of the experimental parameters. Such an uncertainty cannot solely be classified as aleatoric or epistemic any more, but is a more general inferential uncertainty.

In real life applications, both kinds of uncertainties are present. Uncertainty quantification intends to explicitly express both types of uncertainty separately. The quantification for the aleatoric uncertainties can be relatively straightforward, where traditional (frequentist) probability is the most basic form. Techniques such as the Monte Carlo method are frequently used. A probability distribution can be represented by its moments (in the Gaussian case, the mean and covariance suffice, although, in general, even knowledge of all moments to arbitrarily high order still does not specify the distribution function uniquely), or more recently, by techniques such as Karhunen–Loève and polynomial chaos expansions. To evaluate epistemic uncertainties, the efforts are made to understand the (lack of) knowledge of the system, process or mechanism. Epistemic uncertainty is generally understood through the lens of Bayesian probability, where probabilities are interpreted as indicating how certain a rational person could be regarding a specific claim.

Mathematical perspective
In mathematics, uncertainty is often characterized in terms of a probability distribution. From that perspective, epistemic uncertainty means not being certain what the relevant probability distribution is, and aleatoric uncertainty means not being certain what a random sample drawn from a probability distribution will be.

Types of problems
There are two major types of problems in uncertainty quantification: one is the forward propagation of uncertainty (where the various sources of uncertainty are propagated through the model to predict the overall uncertainty in the system response) and the other is the inverse assessment of model uncertainty and parameter uncertainty (where the model parameters are calibrated simultaneously using test data). There has been a proliferation of research on the former problem and a majority of uncertainty analysis techniques were developed for it. On the other hand, the latter problem is drawing increasing attention in the engineering design community, since uncertainty quantification of a model and the subsequent predictions of the true system response(s) are of great interest in designing robust systems.

Forward
Uncertainty propagation is the quantification of uncertainties in system output(s) propagated from uncertain inputs. It focuses on the influence on the outputs from the parametric variability listed in the sources of uncertainty. The targets of uncertainty propagation analysis can be:
 * To evaluate low-order moments of the outputs, i.e. mean and variance.
 * To evaluate the reliability of the outputs. This is especially useful in reliability engineering where outputs of a system are usually closely related to the performance of the system.
 * To assess the complete probability distribution of the outputs. This is useful in the scenario of utility optimization where the complete distribution is used to calculate the utility.

Inverse
Given some experimental measurements of a system and some computer simulation results from its mathematical model, inverse uncertainty quantification estimates the discrepancy between the experiment and the mathematical model (which is called bias correction), and estimates the values of unknown parameters in the model if there are any (which is called parameter calibration or simply calibration). Generally this is a much more difficult problem than forward uncertainty propagation; however it is of great importance since it is typically implemented in a model updating process. There are several scenarios in inverse uncertainty quantification:

Bias correction only
Bias correction quantifies the model inadequacy, i.e. the discrepancy between the experiment and the mathematical model. The general model updating formula for bias correction is:
 * $$ y^e(\mathbf{x})=y^m(\mathbf{x})+\delta(\mathbf{x})+\varepsilon $$

where $$ y^e(\mathbf{x}) $$ denotes the experimental measurements as a function of several input variables $$ \mathbf{x} $$, $$ y^m(\mathbf{x}) $$ denotes the computer model (mathematical model) response, $$ \delta(\mathbf{x}) $$ denotes the additive discrepancy function (aka bias function), and $$ \varepsilon $$ denotes the experimental uncertainty. The objective is to estimate the discrepancy function $$ \delta(\mathbf{x}) $$, and as a by-product, the resulting updated model is $$ y^m(\mathbf{x})+\delta(\mathbf{x}) $$. A prediction confidence interval is provided with the updated model as the quantification of the uncertainty.

Parameter calibration only
Parameter calibration estimates the values of one or more unknown parameters in a mathematical model. The general model updating formulation for calibration is:
 * $$ y^e(\mathbf{x})=y^m(\mathbf{x},\boldsymbol{\theta}^*)+\varepsilon $$

where $$ y^m(\mathbf{x},\boldsymbol{\theta}) $$ denotes the computer model response that depends on several unknown model parameters $$ \boldsymbol{\theta} $$, and $$ \boldsymbol{\theta}^* $$ denotes the true values of the unknown parameters in the course of experiments. The objective is to either estimate $$ \boldsymbol{\theta}^* $$, or to come up with a probability distribution of $$ \boldsymbol{\theta}^* $$ that encompasses the best knowledge of the true parameter values.

Bias correction and parameter calibration
It considers an inaccurate model with one or more unknown parameters, and its model updating formulation combines the two together:
 * $$ y^e(\mathbf{x})=y^m(\mathbf{x},\boldsymbol{\theta}^*)+\delta(\mathbf{x})+\varepsilon $$

It is the most comprehensive model updating formulation that includes all possible sources of uncertainty, and it requires the most effort to solve.

Selective methodologies
Much research has been done to solve uncertainty quantification problems, though a majority of them deal with uncertainty propagation. During the past one to two decades, a number of approaches for inverse uncertainty quantification problems have also been developed and have proved to be useful for most small- to medium-scale problems.

Forward propagation
Existing uncertainty propagation approaches include probabilistic approaches and non-probabilistic approaches. There are basically six categories of probabilistic approaches for uncertainty propagation: For non-probabilistic approaches, interval analysis, Fuzzy theory, Possibility theory and evidence theory are among the most widely used.
 * Simulation-based methods: Monte Carlo simulations, importance sampling, adaptive sampling, etc.
 * General surrogate-based methods: In a non-instrusive approach, a surrogate model is learnt in order to replace the experiment or the simulation with a cheap and fast approximation. Surrogate-based methods can also be employed in a fully Bayesian fashion. This approach has proven particularly powerful when the cost of sampling, e.g. computationally expensive simulations, is prohibitively high.
 * Local expansion-based methods: Taylor series, perturbation method, etc. These methods have advantages when dealing with relatively small input variability and outputs that don't express high nonlinearity. These linear or linearized methods are detailed in the article Uncertainty propagation.
 * Functional expansion-based methods: Neumann expansion, orthogonal or Karhunen–Loeve expansions (KLE), with polynomial chaos expansion (PCE) and wavelet expansions as special cases.
 * Most probable point (MPP)-based methods: first-order reliability method (FORM) and second-order reliability method (SORM).
 * Numerical integration-based methods: Full factorial numerical integration (FFNI) and dimension reduction (DR).

The probabilistic approach is considered as the most rigorous approach to uncertainty analysis in engineering design due to its consistency with the theory of decision analysis. Its cornerstone is the calculation of probability density functions for sampling statistics. This can be performed rigorously for random variables that are obtainable as transformations of Gaussian variables, leading to exact confidence intervals.

Frequentist
In regression analysis and least squares problems, the standard error of parameter estimates is readily available, which can be expanded into a confidence interval.

Bayesian
Several methodologies for inverse uncertainty quantification exist under the Bayesian framework. The most complicated direction is to aim at solving problems with both bias correction and parameter calibration. The challenges of such problems include not only the influences from model inadequacy and parameter uncertainty, but also the lack of data from both computer simulations and experiments. A common situation is that the input settings are not the same over experiments and simulations. Another common situation is that parameters derived from experiments are input to simulations. For computationally expensive simulations, then often a surrogate model, e.g. a Gaussian process or a Polynomial Chaos Expansion, is necessary, defining an inverse problem for finding the surrogate model that best approximates the simulations.

Modular approach
An approach to inverse uncertainty quantification is the modular Bayesian approach. The modular Bayesian approach derives its name from its four-module procedure. Apart from the current available data, a prior distribution of unknown parameters should be assigned.


 * Module 1: Gaussian process modeling for the computer model

To address the issue from lack of simulation results, the computer model is replaced with a Gaussian process (GP) model
 * $$ y^m(\mathbf{x},\boldsymbol{\theta})\sim\mathcal{GP}\big(\mathbf{h}^m(\cdot)^T\boldsymbol{\beta}^m,\sigma_m^2R^m(\cdot,\cdot)\big) $$

where
 * $$ R^m\big((\mathbf{x},\boldsymbol{\theta}),(\mathbf{x}',\boldsymbol{\theta}')\big)=\exp\left\{-\sum_{k=1}^d \omega_k^m(x_k-x_k')^2\right\}\exp\left\{-\sum_{k=1}^r \omega_{d+k}^m(\theta_k-\theta_k')^2 \right\}. $$

$$ d $$ is the dimension of input variables, and $$ r $$ is the dimension of unknown parameters. While $$ \mathbf{h}^m(\cdot) $$ is pre-defined, $$ \left\{\boldsymbol{\beta}^m, \sigma_m, \omega_k^m, k=1,\ldots,d+r\right\} $$, known as hyperparameters of the GP model, need to be estimated via maximum likelihood estimation (MLE). This module can be considered as a generalized kriging method.

Similarly with the first module, the discrepancy function is replaced with a GP model
 * Module 2: Gaussian process modeling for the discrepancy function
 * $$ \delta(\mathbf{x})\sim\mathcal{GP}\big(\mathbf{h}^\delta(\cdot)^T\boldsymbol{\beta}^\delta,\sigma_\delta^2R^\delta(\cdot,\cdot)\big) $$

where
 * $$ R^\delta(\mathbf{x},\mathbf{x}')=\exp\left\{-\sum_{k=1}^d \omega_k^\delta(x_k-x_k')^2 \right\}. $$

Together with the prior distribution of unknown parameters, and data from both computer models and experiments, one can derive the maximum likelihood estimates for $$ \left\{\boldsymbol{\beta}^\delta, \sigma_\delta, \omega_k^\delta, k=1,\ldots,d\right\} $$. At the same time, $$ \boldsymbol{\beta}^m $$ from Module 1 gets updated as well.

Bayes' theorem is applied to calculate the posterior distribution of the unknown parameters:
 * Module 3: Posterior distribution of unknown parameters
 * $$ p(\boldsymbol{\theta}\mid\text{data},\boldsymbol{\varphi})\propto p(\rm{data}\mid\boldsymbol{\theta},\boldsymbol{\varphi})p(\boldsymbol{\theta}) $$

where $$ \boldsymbol{\varphi} $$ includes all the fixed hyperparameters in previous modules.


 * Module 4: Prediction of the experimental response and discrepancy function

Full approach
Fully Bayesian approach requires that not only the priors for unknown parameters $$ \boldsymbol{\theta} $$ but also the priors for the other hyperparameters $$ \boldsymbol{\varphi} $$ should be assigned. It follows the following steps:


 * 1) Derive the posterior distribution $$ p(\boldsymbol{\theta},\boldsymbol{\varphi}\mid\text{data}) $$;
 * 2) Integrate $$ \boldsymbol{\varphi} $$ out and obtain $$ p(\boldsymbol{\theta}\mid\text{data}) $$. This single step accomplishes the calibration;
 * 3) Prediction of the experimental response and discrepancy function.

However, the approach has significant drawbacks:
 * For most cases, $$ p(\boldsymbol{\theta},\boldsymbol{\varphi}\mid\text{data}) $$ is a highly intractable function of $$ \boldsymbol{\varphi} $$. Hence the integration becomes very troublesome. Moreover, if priors for the other hyperparameters $$ \boldsymbol{\varphi} $$ are not carefully chosen, the complexity in numerical integration increases even more.
 * In the prediction stage, the prediction (which should at least include the expected value of system responses) also requires numerical integration. Markov chain Monte Carlo (MCMC) is often used for integration; however it is computationally expensive.

The fully Bayesian approach requires a huge amount of calculations and may not yet be practical for dealing with the most complicated modelling situations.

Known issues
The theories and methodologies for uncertainty propagation are much better established, compared with inverse uncertainty quantification. For the latter, several difficulties remain unsolved:
 * 1) Dimensionality issue: The computational cost increases dramatically with the dimensionality of the problem, i.e. the number of input variables and/or the number of unknown parameters.
 * 2) Identifiability issue: Multiple combinations of unknown parameters and discrepancy function can yield the same experimental prediction. Hence different values of parameters cannot be distinguished/identified. This issue is circumvented in a Bayesian approach, where such combinations are averaged over.
 * 3) Incomplete model response: Refers to a model not having a solution for some combinations of the input variables.
 * 4) Quantifying uncertainty in the input quantities: Crucial events missing in the available data or critical quantities unidentified to analysts due to, e.g., limitations in existing models.
 * 5) Little consideration of the impact of choices made by analysts.