Sparse Polynomial Chaos Expansions: Literature Survey and Benchmark

Abstract

Sparse polynomial chaos expansions (PCE) are a popular surrogate modelling method that takes advantage of the properties of PCE, the sparsity-of-effects principle, and powerful sparse regression solvers to approximate computer models with many input parameters, relying on only few model evaluations. Within the last decade, a large number of algorithms for the computation of sparse PCE have been published in the applied math and engineering literature. We present an extensive review of the existing methods and develop a framework for classifying the algorithms. Furthermore, we conduct a unique benchmark on a selection of methods to identify which approaches work best in practical applications. Comparing their accuracy on several benchmark models of varying dimensionality and complexity, we find that the choice of sparse regression solver and sampling scheme for the computation of a sparse PCE surrogate can make a significant difference, of up to several orders of magnitude in the resulting mean-squared error. Different methods seem to be superior in different regimes of model dimensionality and experimental design size.

References in corpus (34)

• Discussion of "Least angle regression" by Efron et al
• Discussion of "Least angle regression" by Efron et al
• Rejoinder to "Least angle regression" by Efron et al
• Discussion of "Least angle regression" by Efron et al
• Discussion of "Least angle regression" by Efron et al
• Discussion of "Least angle regression" by Efron et al
• Discussion of "Least angle regression" by Efron et al
• Least Angle Regression
• Discussion of "Least angle regression" by Efron et al
• Discussion of "Least angle regression" by Efron et al
• A survey of sparse representation: algorithms and applications
• The generalization of Latin hypercube sampling
• A non-adapted sparse approximation of PDEs with stochastic inputs
• 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
• Sparse Polynomial Chaos Expansions via Compressed Sensing and D-optimal Design
• A Christoffel function weighted least squares algorithm for collocation approximations
• A generalized sampling and preconditioning scheme for sparse approximation of polynomial chaos expansions
• Compressive sensing adaptation for polynomial chaos expansions
• Rectangular maximum-volume submatrices and their applications
• Surrogate modeling based on resampled polynomial chaos expansions
• Basis Adaptive Sample Efficient Polynomial Chaos (BASE-PC)
• Compressive Sensing with Cross-Validation and Stop-Sampling for Sparse Polynomial Chaos Expansions
• Sequential Design for Ranking Response Surfaces
• Regression-based sparse polynomial chaos for uncertainty quantification of subsurface flow models
• Sparse Polynomial Chaos expansions using Variational Relevance Vector Machines
• Divide and Conquer: An Incremental Sparsity Promoting Compressive Sampling Approach for Polynomial Chaos Expansions
• A Near-Optimal Sampling Strategy for Sparse Recovery of Polynomial Chaos Expansions
• A preconditioning approach for improved estimation of sparse polynomial chaos expansions
• Surrogate modeling of indoor down-link human exposure based on sparse polynomial chaos expansion
• Sparse approximation of data-driven Polynomial Chaos expansions: an induced sampling approach

Cited by in corpus (23)

• Uncertainty Quantification in Machine Learning for Engineering Design and Health Prognostics: A Tutorial
• PI-VAE: Physics-Informed Variational Auto-Encoder for stochastic differential equations
• Stochastic polynomial chaos expansions to emulate stochastic simulators
• A spectral surrogate model for stochastic simulators computed from trajectory samples
• Rare event estimation using stochastic spectral embedding
• Bayesian model inversion using stochastic spectral embedding
• A survey on multi-fidelity surrogates for simulators with functional outputs: unified framework and benchmark
• Multivariate sensitivity-adaptive polynomial chaos expansion for high-dimensional surrogate modeling and uncertainty quantification
• Towards data-driven stochastic predictive control
• Bayesian tomography with prior-knowledge-based parametrization and surrogate modeling
• Active Learning-based Domain Adaptive Localized Polynomial Chaos Expansion
• Probabilistic learning inference of boundary value problem with uncertainties based on Kullback-Leibler divergence under implicit constraints
• Reliability analysis for non-deterministic limit-states using stochastic emulators
• Monitoring-Supported Value Generation for Managing Structures and Infrastructure Systems
• Polynomial Chaos Expansions on Principal Geodesic Grassmannian Submanifolds for Surrogate Modeling and Uncertainty Quantification
• Extreme learning machines for variance-based global sensitivity analysis
• Uncertainty quantification in the Henry problem using the multilevel Monte Carlo method
• Neural Chaos: A Spectral Stochastic Neural Operator
• Fourier-enhanced reduced-order surrogate modeling for uncertainty quantification in electric machine design
• A Resolution Independent Neural Operator
• Multi-level informed optimization via decomposed Kriging for large design problems under uncertainty
• A sampling method based on highest density regions: Applications to surrogate models
• A survey of unsupervised learning methods for high-dimensional uncertainty quantification in black-box-type problems