skip to main content

Title: Probabilistic surrogate models for uncertainty analysis: Dimension reduction‐based polynomial chaos expansion

This paper presents an approach for efficient uncertainty analysis (UA) using an intrusive generalized polynomial chaos (gPC) expansion. The key step of the gPC‐based uncertainty quantification(UQ) is the stochastic Galerkin (SG) projection, which can convert a stochastic model into a set of coupled deterministic models. The SG projection generally yields a high‐dimensional integration problem with respect to the number of random variables used to describe the parametric uncertainties in a model. However, when the number of uncertainties is large and when the governing equation of the system is highly nonlinear, the SG approach‐based gPC can be challenging to derive explicit expressions for the gPC coefficients because of the low convergence in the SG projection. To tackle this challenge, we propose to use a bivariate dimension reduction method (BiDRM) in this work to approximate a high‐dimensional integral in SG projection with a few one‐ and two‐dimensional integrations. The efficiency of the proposed method is demonstrated with three different examples, including chemical reactions and cell signaling. As compared to other UA methods, such as the Monte Carlo simulations and nonintrusive stochastic collocation (SC), the proposed method shows its superior performance in terms of computational efficiency and UA accuracy.

more » « less
Award ID(s):
Author(s) / Creator(s):
Publisher / Repository:
Wiley Blackwell (John Wiley & Sons)
Date Published:
Journal Name:
International Journal for Numerical Methods in Engineering
Page Range / eLocation ID:
p. 1198-1217
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. null (Ed.)
    Uncertainty quantification (UQ) is an important part of mathematical modeling and simulations, which quantifies the impact of parametric uncertainty on model predictions. This paper presents an efficient approach for polynomial chaos expansion (PCE) based UQ method in biological systems. For PCE, the key step is the stochastic Galerkin (SG) projection, which yields a family of deterministic models of PCE coefficients to describe the original stochastic system. When dealing with systems that involve nonpolynomial terms and many uncertainties, the SG-based PCE is computationally prohibitive because it often involves high-dimensional integrals. To address this, a generalized dimension reduction method (gDRM) is coupled with quadrature rules to convert a high-dimensional integral in the SG into a few lower dimensional ones that can be rapidly solved. The performance of the algorithm is validated with two examples describing the dynamic behavior of cells. Compared to other UQ techniques (e.g., nonintrusive PCE), the results show the potential of the algorithm to tackle UQ in more complicated biological systems. 
    more » « less
  2. Abstract

    Solidification phenomenon has been an integral part of the manufacturing processes of metals, where the quantification of stochastic variations and manufacturing uncertainties is critically important. Accurate molecular dynamics (MD) simulations of metal solidification and the resulting properties require excessive computational expenses for probabilistic stochastic analyses where thousands of random realizations are necessary. The adoption of inadequate model sizes and time scales in MD simulations leads to inaccuracies in each random realization, causing a large cumulative statistical error in the probabilistic results obtained through Monte Carlo (MC) simulations. In this work, we present a machine learning (ML) approach, as a data-driven surrogate to MD simulations, which only needs a few MD simulations. This efficient yet high-fidelity ML approach enables MC simulations for full-scale probabilistic characterization of solidified metal properties considering stochasticity in influencing factors like temperature and strain rate. Unlike conventional ML models, the proposed hybrid polynomial correlated function expansion here, being a Bayesian ML approach, is data efficient. Further, it can account for the effect of uncertainty in training data by exploiting mean and standard deviation of the MD simulations, which in principle addresses the issue of repeatability in stochastic simulations with low variance. Stochastic numerical results for solidified aluminum are presented here based on complete probabilistic uncertainty quantification of mechanical properties like Young’s modulus, yield strength and ultimate strength, illustrating that the proposed error-inclusive data-driven framework can reasonably predict the properties with a significant level of computational efficiency.

    more » « less
  3. Quantification and propagation of aleatoric uncertainties distributed in complex topological structures remain a challenge. Existing uncertainty quantification and propagation approaches can only handle parametric uncertainties or high dimensional random quantities distributed in a simply connected spatial domain. There lacks a systematic method that captures the topological characteristics of the structural domain in uncertainty analysis. Therefore, this paper presents a new methodology that quantifies and propagates aleatoric uncertainties, such as the spatially varying local material properties and defects, distributed in a topological spatial domain. We propose a new random field-based uncertainty representation approach that captures the topological characteristics using the shortest interior path distance. Parameterization methods like PPCA and β-Variational Autoencoder (βVAE) are employed to convert the random field representation of uncertainty to a small set of independent random variables. Then non-intrusive uncertainties propagation methods such as polynomial chaos expansion and univariate dimension reduction are employed to propagate the parametric uncertainties to the output of the problem. The effectiveness of the proposed methodology is demonstrated by engineering case studies. The accuracy and computational efficiency of the proposed method is confirmed by comparing with the reference values of Monte Carlo simulations with a sufficiently large number of samples. 
    more » « less
  4. This work focuses on the representation of model-form uncertainties in phase-field models of brittle fracture. Such uncertainties can arise from the choice of the degradation function for instance, and their consideration has been unaddressed to date. The stochastic modeling framework leverages recent developments related to the analysis of nonlinear dynamical systems and relies on the construction of a stochastic reduced-order model. In the latter, a POD-based reduced-order basis is randomized using Riemannian projection and retraction operators, as well as an information-theoretic formulation enabling proper concentration in the convex hull defined by a set of model proposals. The model thus obtained is mathematically admissible in the almost sure sense and involves a low-dimensional hyperparameter, the calibration of which is facilitated through the formulation of a quadratic programming problem. The relevance of the modeling approach is further assessed on one- and two-dimensional applications. It is shown that model uncertainties can be efficiently captured and propagated to macroscopic quantities of interest. An extension based on localized randomization is also proposed to handle the case where the forward simulation is highly sensitive to sample localization. This work constitutes a methodological development allowing phase-field predictions to be endowed with statistical measures of confidence, accounting for the variability induced by modeling choices. 
    more » « less
  5. Abstract

    Nowadays, the message diffusion links among users or Web sites drive the development of countless innovative applications. However, in reality, it is easier for us to observe the time stamps when different nodes in the network react on a message, while the connections empowering the diffusion of the message remain hidden. This motivates recent extensive studies on thenetwork inference problem: unveiling the edges from the records of messages disseminated through them. Existing solutions are computationally expensive, which motivates us to develop an efficient two-step general framework,Clustering Embedded Network Inference(CENI). CENI integrates clustering strategies to improve the efficiency of network inference. By clustering nodes directly on the time lines of messages, we propose two naive implementations of CENI:Infection-centric CENIandCascade-centric CENI. Additionally, we point out thecritical dimensionproblem of CENI: Instead of one-dimensional time lines, we need to first project the nodes to an Euclidean space of certain dimension before clustering. A CENI adopting clustering method on the projected space can better preserve the structure hidden in the cascades and generate more accurately inferred links. By addressing the critical dimension problem, we propose the third implementation of the CENI framework:Projection-based CENI. Through extensive experiments on two real datasets, we show that the three CENI models only need around 20–50 % of the running time of state-of-the-art methods. Moreover, the inferred edges of Projection-based CENI preserve or even outperform the effectiveness of state-of-the-art methods.

    more » « less