Classifier-based adaptive polynomial chaos expansion for high-dimensional uncertainty quantification

被引:7
作者
Thapa, Mishal [1 ]
Mulani, Sameer B. [2 ]
Paudel, Achyut [2 ]
Gupta, Subham [2 ]
Walters, Robert W. [3 ]
机构
[1] Univ Alabama, Remote Sensing Ctr, Dept Aerosp Engn & Mech, Tuscaloosa, AL 35487 USA
[2] Univ Alabama, Dept Aerosp Engn & Mech, Tuscaloosa, AL 35487 USA
[3] Virginia Polytech Inst & State Univ, Dept Aerosp & Ocean Engn, Blacksburg, VA 24061 USA
基金
美国海洋和大气管理局;
关键词
High-dimensionality; Adaptive polynomial chaos expansion; Uncertainty quantification; Support vector machine classifier; Stochastic nonlinear buckling; ORTHOGONAL MATCHING PURSUIT; LEARNING ALGORITHM; SIGNAL RECOVERY; SENSITIVITY; EFFICIENT; EQUATIONS; SYSTEMS;
D O I
10.1016/j.cma.2024.116829
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
A novel approach for the construction of polynomial chaos expansion (PCE) is proposed to facilitate high -dimensional uncertainty quantification (UQ). The current PCE techniques are well-known for UQ; however, they are affected by the curse of dimensionality that leads to over -fitting and tractability issues. Although L1 -minimization can be used to deal with overfitting, it is still ineffective for problems with a large number of independent random inputs or requiring a very high -order PCE. Therefore, a classifier -based PCE (CAPCE) is presented to mitigate the factorial growth of basis terms and prevent over -fitting. The adaptive framework includes four basis selection strategies - enrichment, screening, discovery, and recycling - in the inner loop and the enrichment of the training samples in the outer loop. Mainly, an adaptive classifier is trained on the dominant and discarded basis terms obtained from L1 -minimization during discovery. It then allows the judicious selection of new higher -order basis candidates for L1 -solver in the next iteration, thereby alleviating the effect of the curse of dimensionality. The proposed framework has been tested with analytical problems of varying sizes of independent random inputs and an engineering composite laminate problem. The comparison of CAPCE with the available efficient PCE techniques demonstrated improvements in accuracy using fewer samples due to a faster convergence rate.
引用
收藏
页数:23
相关论文
共 60 条
[1]   Adaptive sparse polynomial chaos expansion based on least angle regression [J].
Blatman, Geraud ;
Sudret, Bruno .
JOURNAL OF COMPUTATIONAL PHYSICS, 2011, 230 (06) :2345-2367
[2]   From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images [J].
Bruckstein, Alfred M. ;
Donoho, David L. ;
Elad, Michael .
SIAM REVIEW, 2009, 51 (01) :34-81
[3]   Orthogonal Matching Pursuit for Sparse Signal Recovery With Noise [J].
Cai, T. Tony ;
Wang, Lie .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (07) :4680-4688
[4]   ORTHOGONAL LEAST-SQUARES LEARNING ALGORITHM FOR RADIAL BASIS FUNCTION NETWORKS [J].
CHEN, S ;
COWAN, CFN ;
GRANT, PM .
IEEE TRANSACTIONS ON NEURAL NETWORKS, 1991, 2 (02) :302-309
[5]   Active learning polynomial chaos expansion for reliability analysis by maximizing expected indicator function prediction error [J].
Cheng, Kai ;
Lu, Zhenzhou .
INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, 2020, 121 (14) :3159-3177
[6]   Adaptive sparse polynomial chaos expansions for global sensitivity analysis based on support vector regression [J].
Cheng, Kai ;
Lu, Zhenzhou .
COMPUTERS & STRUCTURES, 2018, 194 :86-96
[7]  
Choi S.-K., 2007, RELIABILITY BASED ST
[8]   Polynomial chaos expansion for sensitivity analysis [J].
Crestaux, Thierry ;
Le Maitre, Olivier ;
Martinez, Jean-Marc .
RELIABILITY ENGINEERING & SYSTEM SAFETY, 2009, 94 (07) :1161-1172
[9]  
Cristianini N., 2000, An Introduction to Support Vector Machines and Other Kernel-based Learning Methods
[10]   Subspace Pursuit for Compressive Sensing Signal Reconstruction [J].
Dai, Wei ;
Milenkovic, Olgica .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (05) :2230-2249