EXTENDING CLASSICAL SURROGATE MODELING TO HIGH DIMENSIONS THROUGH SUPERVISED DIMENSIONALITY REDUCTION: A DATA-DRIVEN APPROACH

被引:56
作者
Lataniotis, Christos [1 ]
Marelli, Stefano [1 ]
Sudret, Bruno [1 ]
机构
[1] Swiss Fed Inst Technol, Chair Risk Safety & Uncertainty Quantificat, Stefano Franscini Pl 5, CH-8093 Zurich, Switzerland
关键词
dimensionality reduction; surrogate modeling; Kriging; polynomial chaos expansions; kernel principal component analysis; PRINCIPAL COMPONENT ANALYSIS; POLYNOMIAL CHAOS; CROSS-VALIDATION; SENSITIVITY-ANALYSIS; ADAPTATION; PARAMETERS;
D O I
10.1615/Int.J.UncertaintyQuantification.2020031935
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Thanks to their versatility, ease of deployment, and high performance, surrogate models have become staple tools in the arsenal of uncertainty quantification (UQ). From local interpolants to global spectral decompositions, surrogates are characterized by their ability to efficiently emulate complex computational models based on a small set of model runs used for training. An inherent limitation of many surrogate models is their susceptibility to the curse of dimensionality, which traditionally limits their applicability to a maximum of O(10(2)) input dimensions. We present a novel approach at high-dimensional surrogate modeling that is model-, dimensionality reduction-, and surrogate model-agnostic (black box), and can enable the solution of high-dimensional [i.e., up to O(10(4))] problems. After introducing the general algorithm, we demonstrate its performance by combining Kriging and polynomial chaos expansion surrogates and kernel principal component analysis. In particular, we compare the generalization performance that the resulting surrogates achieve to the classical sequential application of dimensionality reduction followed by surrogate modeling on several benchmark applications, comprising an analytical function and two engineering applications of increasing dimensionality and complexity.
引用
收藏
页码:55 / 82
页数:28
相关论文
共 73 条
  • [1] Alam M.A., 2014, Journal of Computer Science, V10, P1139, DOI DOI 10.3844/JCSSP.2014.1139.1150
  • [2] [Anonymous], AMSTER658
  • [3] [Anonymous], 2003, QUAL ENG
  • [4] [Anonymous], 2012, Annales de la Faculte des sciences de Toulouse: Mathematiques, DOI [DOI 10.5802/AFST.1342, 10.5802/afst.1342]
  • [5] [Anonymous], 2004, ORTHOGONAL POLYNOMIA, DOI DOI 10.1093/OSO/9780198506720.001.0001, Patent No. 220512815
  • [6] [Anonymous], 2011, PATTERN RECOGN
  • [7] [Anonymous], 2008, GLOBAL SENSITIVITY A
  • [8] [Anonymous], 2004, ENCY STAT SCI
  • [9] [Anonymous], 2018, J. Soft Comput. Civ. Eng., DOI DOI 10.22115/SCCE.2018.129323.1062
  • [10] [Anonymous], 1991, STOCHASTIC FINITE EL, DOI DOI 10.1007/978-1-4612-3094-6