An adaptive data-driven subspace polynomial dimensional decomposition for high-dimensional uncertainty quantification based on maximum entropy method and sparse Bayesian learning

Abstract

Polynomial dimensional decomposition (PDD) is a surrogate method originated from the ANOVA (analysis of variance) decomposition, and has shown powerful performance in uncertainty quantification (UQ) accuracy and convergence recently. However, complex high-dimensional problems result in a large number of polynomial basis functions, leading to heavy computational burden, and the probability distributions of the input random variables are indispensable for PDD modeling and UQ, which may be unavailable in practical engineering. This study establishes an adaptive data-driven subspace PDD (ADDSPDD) for high-dimensional UQ, which employs two types of data for modeling the PDD basis function and the low-dimensional subspace directly, namely, the data of input random variables and the input-response samples. Firstly, we propose a data-driven zero-entropy criterion-based maximum entropy method for reconstructing the probability density functions (PDF) of input variables. Then, with the aid of the established PDFs, a data-driven subspace PDD (DDSPDD) is proposed based on the whitening transformation. To recover the subspace of the function of interest accurately and efficiently, we put forward an approximate active subspace method (AAS) based on the Taylor expansion under some mild premises. Finally, we integrate an adaptive learning algorithm into the DDSPDD framework based on the sparse Bayesian learning theory, obtaining our ADDSPDD; thus, the real subspace and the significant PDD basis functions can be identified with limited computational budget. We validate the proposed method by using four examples, and systematically compare four existing dimension-reduction methods with the AAS. Results show that the proposed framework is effective and the AAS is a good choice when the corresponding assumptions are satisfied.