Compressive Sampling of Polynomial Chaos Expansions: Convergence Analysis and Sampling Strategies

Abstract

Sampling orthogonal polynomial bases via Monte Carlo is of interest for uncertainty quantification of models with high-dimensional random inputs, using Polynomial Chaos (PC) expansions. It is known that bounding a probabilistic parameter, referred to as {\it coherence}, yields a bound on the number of samples necessary to identify coefficients in a sparse PC expansion via solution to an ${\ell }_1$-minimization problem. Utilizing asymptotic results for orthogonal polynomials, we bound the coherence parameter for polynomials of Hermite and Legendre type under the respective natural sampling distribution. In both polynomial bases we identify an importance sampling distribution which yields a bound with weaker dependence on the order of the approximation. For more general orthonormal bases, we propose the {\it coherence-optimal} sampling: a Markov Chain Monte Carlo sampling, which directly uses the basis functions under consideration to achieve a statistical optimality among all sampling schemes with identical support. We demonstrate these different sampling strategies numerically in both high-order and high-dimensional, manufactured PC expansions. In addition, the quality of each sampling method is compared in the identification of solutions to two differential equations, one with a high-dimensional random input and the other with a high-order PC expansion. In both cases the coherence-optimal sampling scheme leads to similar or considerably improved accuracy.

References in corpus (6)

• A survey of cross-validation procedures for model selection
• A non-adapted sparse approximation of PDEs with stochastic inputs
• Observed Universality of Phase Transitions in High-Dimensional Geometry, with Implications for Modern Data Analysis and Signal Processing
• A weighted L1-minimization approach for sparse polynomial chaos expansions
• Coarse Stability and Bifurcation Analysis Using Stochastic Simulators: Kinetic Monte Carlo Examples
• New bounds on the Hermite polynomials

Cited by in corpus (57)

• Sparse Polynomial Chaos Expansions: Literature Survey and Benchmark
• Uncertainty Quantification in Machine Learning for Engineering Design and Health Prognostics: A Tutorial
• 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
• Sparse Polynomial Chaos Expansions via Compressed Sensing and D-optimal Design
• Enabling High-Dimensional Hierarchical Uncertainty Quantification by ANOVA and Tensor-Train Decomposition
• Sparse Identification of Nonlinear Dynamical Systems via Reweighted ${\ell }_1$-regularized Least Squares
• Polynomial chaos expansions for dependent random variables
• On Polynomial Chaos Expansion via Gradient-enhanced ${\ell }_1$-minimization
• A generalized sampling and preconditioning scheme for sparse approximation of polynomial chaos expansions
• Compressed sensing with sparse corruptions: Fault-tolerant sparse collocation approximations
• A Low-rank Control Variate for Multilevel Monte Carlo Simulation of High-dimensional Uncertain Systems
• Contributions of microtubule dynamic instability and rotational diffusion to kinetochore capture
• Enhancing Sparsity of Hermite Polynomial Expansions by Iterative Rotations
• Basis Adaptive Sample Efficient Polynomial Chaos (BASE-PC)
• A gradient enhanced ${\ell }_1$-minimization for sparse approximation of polynomial chaos expansions
• Projection pursuit adaptation on polynomial chaos expansions
• Global Sensitivity Analysis and Estimation of Model Error, Toward Uncertainty Quantification in Scramjet Computations
• Compressive Sensing with Cross-Validation and Stop-Sampling for Sparse Polynomial Chaos Expansions
• Sparse Polynomial Chaos expansions using Variational Relevance Vector Machines
• Divide and Conquer: An Incremental Sparsity Promoting Compressive Sampling Approach for Polynomial Chaos Expansions
• Bi-fidelity Variational Auto-encoder for Uncertainty Quantification
• A Near-Optimal Sampling Strategy for Sparse Recovery of Polynomial Chaos Expansions
• Optimal Bayesian experimental design for subsurface flow problems
• Sensitivity-enhanced generalized polynomial chaos for efficient uncertainty quantification
• Robust Adaptive Least Squares Polynomial Chaos Expansions in High-Frequency Applications
• Gaussian Process Regression and Conditional Polynomial Chaos for Parameter Estimation
• Inferring Displacement Fields from Sparse Measurements Using the Statistical Finite Element Method
• Multi-fidelity Machine Learning for Uncertainty Quantification and Optimization
• Active Learning-based Domain Adaptive Localized Polynomial Chaos Expansion
• A preconditioning approach for improved estimation of sparse polynomial chaos expansions
• Sparse polynomial surrogates for aerodynamic computations with random inputs
• A mixed ${\ell }_1$ regularization approach for sparse simultaneous approximation of parameterized PDEs
• A data-driven framework for sparsity-enhanced surrogates with arbitrary mutually dependent randomness
• Infinite-dimensional ${\ell }^1$ minimization and function approximation from pointwise data
• Power Module Heat Sink Design Optimization with Ensembles of Data-Driven Polynomial Chaos Surrogate Models
• Adaptive Sparse Polynomial Chaos Expansions via Leja Interpolation
• Deep Neural Networks Are Effective At Learning High-Dimensional Hilbert-Valued Functions From Limited Data
• A stochastic Galerkin method with adaptive time-stepping for the Navier-Stokes equations
• High-Dimensional Uncertainty Quantification of Electronic and Photonic IC with Non-Gaussian Correlated Process Variations
• Infinite-dimensional compressed sensing and function interpolation
• Compressive sensing Petrov-Galerkin approximation of high-dimensional parametric operator equations
• Parametric/Stochastic Model Reduction: Low-Rank Representation, Non-Intrusive Bi-Fidelity Approximation, and Convergence Analysis
• A Resolution Independent Neural Operator
• Neural Chaos: A Spectral Stochastic Neural Operator
• Calibrating a Finite-strain Phase-field Model of Fracture for Bonded Granular Materials with Uncertainty Quantification
• Near-optimal sampling strategies for multivariate function approximation on general domains
• Quadrature Sampling of Parametric Models with Bi-fidelity Boosting
• Stochastic collocation methods via $L_1$ minimization using randomized quadratures
• Time and Frequency Domain Methods for Basis Selection in Random Linear Dynamical Systems
• Uncertainty Quantification of Electronic and Photonic ICs with Non-Gaussian Correlated Process Variations
• Tight bounds on the mutual coherence of sensing matrices for Wigner D-functions on regular grids
• A sampling method based on highest density regions: Applications to surrogate models
• Compressive Hermite interpolation: sparse, high-dimensional approximation from gradient-augmented measurements
• A general framework of rotational sparse approximation in uncertainty quantification
• Gradient-informed basis adaptation for Legendre Chaos expansions