Sparse approximation of data-driven Polynomial Chaos expansions: an induced sampling approach

TL;DR

This paper introduces a novel induced sampling approach combined with data-driven polynomial chaos expansions to improve uncertainty quantification in high-dimensional, data-limited scenarios, demonstrating superior performance over traditional methods.

Contribution

It proposes a new induced sampling technique for sparse polynomial chaos approximation that enhances UQ accuracy with limited data and incomplete distribution information.

Findings

Induced sampling outperforms Monte Carlo sampling in test cases.

The method achieves accurate sparse representations with limited data.

Application to a Kirchhoff problem validates the approach's effectiveness.

Abstract

One of the open problems in the field of forward uncertainty quantification (UQ) is the ability to form accurate assessments of uncertainty having only incomplete information about the distribution of random inputs. Another challenge is to efficiently make use of limited training data for UQ predictions of complex engineering problems, particularly with high dimensional random parameters. We address these challenges by combining data-driven polynomial chaos expansions with a recently developed preconditioned sparse approximation approach for UQ problems. The first task in this two-step process is to employ the procedure developed in (Ahlfeld et al. 2016) to construct an "arbitrary" polynomial chaos expansion basis using a finite number of statistical moments of the random inputs. The second step is a novel procedure to effect sparse approximation via $\ell^1$ minimization in order to quantify the forward uncertainty. To enhance the performance of the preconditioned $\ell^1$ minimization problem, we sample from the so-called induced distribution, instead of using Monte Carlo (MC) sampling from the original, unknown probability measure. We demonstrate on test problems that induced sampling is a competitive and often better choice compared with sampling from asymptotically optimal measures (such as the equilibrium measure) when we have incomplete information about the distribution. We demonstrate the capacity of the proposed induced sampling algorithm via sparse representation with limited data on test functions, and on a Kirchoff plating bending problem with random Young's modulus.