Data-driven polynomial chaos expansion for machine learning regression

被引:94
|
作者
Torre, Emiliano [1 ,2 ,3 ]
Marelli, Stefano [2 ]
Embrechts, Paul [1 ,3 ,4 ]
Sudret, Bruno [2 ,3 ]
机构
[1] Swiss Fed Inst Technol, RiskLab, Zurich, Switzerland
[2] Swiss Fed Inst Technol, Chair Risk Safety & Uncertainty Quantificat, Zurich, Switzerland
[3] Swiss Fed Inst Technol, Risk Ctr, Zurich, Switzerland
[4] Swiss Fed Inst Technol, Swiss Finance Inst, Zurich, Switzerland
关键词
Polynomial chaos expansions; Machine learning; Regression; Sparse representations; Uncertainty quantification; Copulas; PAIR-COPULA CONSTRUCTIONS; UNCERTAINTY; CONVERGENCE; SELECTION; MODEL;
D O I
10.1016/j.jcp.2019.03.039
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
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) regression is a research field that focuses on providing purely data-driven input-output maps, with the focus on pointwise prediction accuracy. We show that a PCE metamodel purely trained on data can yield pointwise predictions whose accuracy is comparable to that of other ML regression models, such as neural networks and support vector machines. The comparisons are performed on benchmark datasets available from the literature. The methodology also enables the quantification of the output uncertainties, and is robust to noise. Furthermore, it enjoys additional desirable properties, such as good performance for small training sets and simplicity of construction, with only little parameter tuning required. (C) 2019 Elsevier Inc. All rights reserved.
引用
收藏
页码:601 / 623
页数:23
相关论文
共 50 条
  • [1] A SPARSE DATA-DRIVEN POLYNOMIAL CHAOS EXPANSION METHOD FOR UNCERTAINTY PROPAGATION
    Wang, F.
    Xiong, F.
    Yang, S.
    Xiong, Y.
    [J]. PROCEEDINGS OF THE ASME INTERNATIONAL DESIGN ENGINEERING TECHNICAL CONFERENCES AND COMPUTERS AND INFORMATION IN ENGINEERING CONFERENCE, 2016, VOL 2A, 2016,
  • [2] Data-driven sparse polynomial chaos expansion for models with dependent inputs
    Liu, Zhanlin
    Choe, Youngjun
    [J]. JOURNAL OF SAFETY SCIENCE AND RESILIENCE, 2023, 4 (04): : 358 - 365
  • [3] Data-driven uncertainty quantification using the arbitrary polynomial chaos expansion
    Oladyshkin, S.
    Nowak, W.
    [J]. RELIABILITY ENGINEERING & SYSTEM SAFETY, 2012, 106 : 179 - 190
  • [4] Data-Driven Global Sensitivity Analysis Using the Arbitrary Polynomial Chaos Expansion Model
    Li, Qizhe
    Huang, Hanyan
    [J]. 2022 6TH INTERNATIONAL CONFERENCE ON SYSTEM RELIABILITY AND SAFETY, ICSRS, 2022, : 274 - 278
  • [5] Sparse Bayesian learning for data driven polynomial chaos expansion with application to chemical processes
    Pham Luu Trung Duong
    Le Quang Minh
    Qyyum, Muhammad Abdul
    Lee, Moonyong
    [J]. CHEMICAL ENGINEERING RESEARCH & DESIGN, 2018, 137 : 553 - 565
  • [6] Data-Driven Arbitrary Polynomial Chaos for Uncertainty Quantification in Filters
    Alkhateeb, Osama J.
    Ida, Nathan
    [J]. APPLIED COMPUTATIONAL ELECTROMAGNETICS SOCIETY JOURNAL, 2018, 33 (09): : 1048 - 1051
  • [7] An enhanced data-driven polynomial chaos method for uncertainty propagation
    Wang, Fenggang
    Xiong, Fenfen
    Jiang, Huan
    Song, Jianmei
    [J]. ENGINEERING OPTIMIZATION, 2018, 50 (02) : 273 - 292
  • [8] Uncertainty Quantification of Crosstalk for MTLs in the Context of Industry 4.0 Based on Data-Driven Polynomial Chaos Expansion
    Wu, Dayong
    Lv, Gang
    Yu, Quanyi
    Yu, Shengbao
    [J]. IEEE SYSTEMS JOURNAL, 2023, 17 (04): : 5142 - 5151
  • [9] A novel data-driven sparse polynomial chaos expansion for high-dimensional problems based on active subspace and sparse Bayesian learning
    Wanxin He
    Gang Li
    Changting Zhong
    Yixuan Wang
    [J]. Structural and Multidisciplinary Optimization, 2023, 66
  • [10] A novel data-driven sparse polynomial chaos expansion for high-dimensional problems based on active subspace and sparse Bayesian learning
    He, Wanxin
    Li, Gang
    Zhong, Changting
    Wang, Yixuan
    [J]. STRUCTURAL AND MULTIDISCIPLINARY OPTIMIZATION, 2023, 66 (01)