arrow
Return

A data-driven framework for sparsity-enhanced surrogates with arbitrary mutually dependent randomness

delete2019-06-01
delete4
delete
OA
AI
H
Huan Lei
李静 cover
李静 (Jing Li)
P
Peiyuan Gao
P
Panagiotis Stinis
N
Nathan Baker *
DOI:10.1016/j.cma.2019.03.014delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
The challenge of quantifying uncertainty propagation in real-world systems is rooted in the high-dimensionality of the stochastic input and the frequent lack of explicit knowledge of its probability distribution. Traditional approaches show limitations for such problems, especially when the size of the training data is limited. To address these difficulties, we have developed a general framework of constructing surrogate models on spaces of stochastic input with arbitrary probability measure irrespective of the mutual dependencies between individual components of the random inputs and the analytical form. The present Data-driven Sparsity-enhancing Rotation for Arbitrary Randomness (DSRAR) framework includes a data-driven construction of multivariate polynomial basis for arbitrary mutually dependent probability measures and a sparsity enhancement rotation procedure. This sparsity enhancement method was initially proposed in our previous work (Lei et al., 2015) for Gaussian density distributions, which may not be feasible for non-Gaussian distributions due developed a new data-driven approach to construct orthonormal polynomials for arbitrary mutually dependent randomness, ensuring the constructed basis maintains the orthogonality/near-orthogonality with respect to the density of the rotated random vector, where directly applying the regular polynomial chaos including arbitrary polynomial chaos (aPC) Oladyshkin and Nowak (2012) shows limitations due to the assumption of the mutual independence between the components of the random inputs. The developed DSRAR framework leads to accurate recovery, with only limited training data, of a sparse representation of the target functions. The effectiveness of our method is demonstrated in challenging problems such as partial differential equations and realistic molecular systems within high-dimensional (O(10)) conformational spaces where the underlying density is implicitly represented by a large collection of sample data, as well as systems with explicitly given non-Gaussian probabilistic measures. (C) 2019 Elsevier B.V. All rights reserved.
Keywords:
Data-driven
Arbitrary randomness
Mutual dependence
Compressed sensing
Sparsity enhancement
Uncertainty quantification
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Computer Methods in Applied Mechanics and Engineering cover
Computer Methods in Applied Mechanics and Engineering
IF:
7.3
Papers:
1.3W
Citations:
5.6W

Organization

U
united states department of energy (doe)
Scholars:
11.3W
Papers: 9.6W
Citations: 246