Sparse Approximation of Data-Driven Polynomial Chaos Expansions: An Induced Sampling Approach
From MaRDI portal
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 minimization in order to quantify the forward uncertainty. To enhance the performance of the preconditioned 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.
Recommendations
- A near-optimal sampling strategy for sparse recovery of polynomial chaos expansions
- A generalized sampling and preconditioning scheme for sparse approximation of polynomial chaos expansions
- Sparse polynomial chaos expansions: literature survey and benchmark
- Data-driven polynomial chaos expansions: a weighted least-square approximation
- A gradient enhanced \(\ell_{1}\)-minimization for sparse approximation of polynomial chaos expansions
- Divide and conquer: an incremental sparsity promoting compressive sampling approach for polynomial chaos expansions
- Compressive sampling of polynomial chaos expansions: convergence analysis and sampling strategies
- Sparse polynomial chaos expansions via compressed sensing and D-optimal design
- A weighted _1-minimization approach for sparse polynomial chaos expansions
- A preconditioning approach for improved estimation of sparse polynomial chaos expansions
Cited in
(5)- Optimal design for kernel interpolation: applications to uncertainty quantification
- Data-driven polynomial chaos expansions: a weighted least-square approximation
- Non-intrusive framework of reduced-order modeling based on proper orthogonal decomposition and polynomial chaos expansion
- Sparse polynomial chaos expansions: literature survey and benchmark
- A Bayesian scheme for reconstructing obstacles in acoustic waveguides
This page was built for publication: Sparse Approximation of Data-Driven Polynomial Chaos Expansions: An Induced Sampling Approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5142965)
