Sparse Polynomial Chaos Expansions via Compressed Sensing and D-optimal Design

Abstract

In the field of uncertainty quantification, sparse polynomial chaos (PC) expansions are commonly used by researchers for a variety of purposes, such as surrogate modeling. Ideas from compressed sensing may be employed to exploit this sparsity in order to reduce computational costs. A class of greedy compressed sensing algorithms use least squares minimization to approximate PC coefficients. This least squares problem lends itself to the theory of optimal design of experiments (ODE). Our work focuses on selecting an experimental design that improves the accuracy of sparse PC approximations for a fixed computational budget. We propose DSP, a novel sequential design, greedy algorithm for sparse PC approximation. The algorithm sequentially augments an experimental design according to a set of the basis polynomials deemed important by the magnitude of their coefficients, at each iteration. Our algorithm incorporates topics from ODE to estimate the PC coefficients. A variety of numerical simulations are performed on three physical models and manufactured sparse PC expansions to provide a comparative study between our proposed algorithm and other non-adaptive methods. Further, we examine the importance of sampling by comparing different strategies in terms of their ability to generate a candidate pool from which an optimal experimental design is chosen. It is demonstrated that the most accurate PC coefficient approximations, with the least variability, are produced with our design-adaptive greedy algorithm and the use of a studied importance sampling strategy. We provide theoretical and numerical results which show that using an optimal sampling strategy for the candidate pool is key, both in terms of accuracy in the approximation, but also in terms of constructing an optimal design.

References in corpus (16)

• User-friendly tail bounds for sums of random matrices
• A non-adapted sparse approximation of PDEs with stochastic inputs
• Optimal experimental design and some related control problems
• Compressive Sampling of Polynomial Chaos Expansions: Convergence Analysis and Sampling Strategies
• A weighted L1-minimization approach for sparse polynomial chaos expansions
• Enhancing ${\ell }_1$-minimization estimates of polynomial chaos expansions using basis selection
• Least Squares Polynomial Chaos Expansion: A Review of Sampling Strategies
• Coherence Motivated Sampling and Convergence Analysis of Least-Squares Polynomial Chaos Regression
• Polynomial approximation via compressed sensing of high-dimensional functions on lower sets
• On Polynomial Chaos Expansion via Gradient-enhanced ${\ell }_1$-minimization
• A generalized sampling and preconditioning scheme for sparse approximation of polynomial chaos expansions
• Enhancing Sparsity of Hermite Polynomial Expansions by Iterative Rotations
• Basis Adaptive Sample Efficient Polynomial Chaos (BASE-PC)
• Constrained adaptive sensing
• A Near-Optimal Sampling Strategy for Sparse Recovery of Polynomial Chaos Expansions
• On optimal experimental designs for Sparse Polynomial Chaos Expansions

Cited by in corpus (15)

• Sparse Polynomial Chaos Expansions: Literature Survey and Benchmark
• On the influence of over-parameterization in manifold based surrogates and deep neural operators
• Manifold learning-based polynomial chaos expansions for high-dimensional surrogate models
• Optimal Bayesian experimental design for subsurface flow problems
• Sensitivity-enhanced generalized polynomial chaos for efficient uncertainty quantification
• Multivariate sensitivity-adaptive polynomial chaos expansion for high-dimensional surrogate modeling and uncertainty quantification
• Robust Adaptive Least Squares Polynomial Chaos Expansions in High-Frequency Applications
• Active Learning-based Domain Adaptive Localized Polynomial Chaos Expansion
• A data-driven framework for sparsity-enhanced surrogates with arbitrary mutually dependent randomness
• Power Module Heat Sink Design Optimization with Ensembles of Data-Driven Polynomial Chaos Surrogate Models
• Polynomial Chaos Expansions on Principal Geodesic Grassmannian Submanifolds for Surrogate Modeling and Uncertainty Quantification
• High-Dimensional Uncertainty Quantification of Electronic and Photonic IC with Non-Gaussian Correlated Process Variations
• Gradient Descent-based D-optimal Design for the Least-Squares Polynomial Approximation
• Quadrature Sampling of Parametric Models with Bi-fidelity Boosting
• Uncertainty Quantification of Electronic and Photonic ICs with Non-Gaussian Correlated Process Variations