2019
DOI: 10.1016/j.jcp.2019.03.039
|View full text |Cite
|
Sign up to set email alerts
|

Data-driven polynomial chaos expansion for machine learning regression

Abstract: We present a regression technique for data-driven problems based on polynomial chaos expansion (PCE). PCE is a popular technique in the field of uncertainty quantification (UQ),where it is typically used to replace a runnable but expensive computational model subject to random inputs with an inexpensive-to-evaluate polynomial function. The metamodel obtained enables a reliable estimation of the statistics of the output, provided that a suitable probabilistic model of the input is available.Machine learning (ML… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

4
81
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
9
1

Relationship

3
7

Authors

Journals

citations
Cited by 132 publications
(85 citation statements)
references
References 50 publications
4
81
0
Order By: Relevance
“…The generic PCE metamodel for each of the defined model outputs was calculated using the experimental design with a sample size of 2000. The correlation between the model inputs was not considered for building the metamodel to achieve better metamodeling performance [76]. Afterwards, the constructed PCEs were evaluated on the new sample set of size 1,000,000 using coefficients calculated in the previous step.…”
Section: Step C Uncertainty Propagationmentioning
confidence: 99%
“…The generic PCE metamodel for each of the defined model outputs was calculated using the experimental design with a sample size of 2000. The correlation between the model inputs was not considered for building the metamodel to achieve better metamodeling performance [76]. Afterwards, the constructed PCEs were evaluated on the new sample set of size 1,000,000 using coefficients calculated in the previous step.…”
Section: Step C Uncertainty Propagationmentioning
confidence: 99%
“…In this section, the proposed ranking based sparse PCE is evaluated on four test cases. The first test case is the Ishigami function [71], the second test case is a ten-dimensional Ackley function, the third case is a waterflooding problem with uncertain permeability field and the forth test case utilizes a data-set from simulations of CO2 injection [72]. In all test cases, the proposed PCE approach is compared to two standard techniques for sparse regression-based PCE: Least Angular Regression [73] and the Orthogonal Matching Pursuit (OMP) algorithm [74].…”
Section: Numerical Examplesmentioning
confidence: 99%
“…(53) using the ordinary least squares method (Berveiller et al, 2006). To calculate the PCE coefficients of the final, highaccuracy, surrogate M(g(x; w)), the distributions of the input variables are fitted using kernel-smoothing, while retaining the independence assumption, motivated by the results in Torre et al (2018). In addition, a sparse solution is obtained by solving the optimisation problem in Eq.…”
Section: Polynomial Chaos Expansionsmentioning
confidence: 99%