A weighted L1-minimization approach for sparse polynomial chaos expansions

Abstract

This work proposes a method for sparse polynomial chaos (PC) approximation of high-dimensional stochastic functions based on non-adapted random sampling. We modify the standard l1 -minimization algorithm, originally proposed in the context of compressive sampling, using a priori information about the decay of the PC coefficients and refer to the resulting algorithm as weighted l1 -minimization. We provide conditions under which we may guarantee recovery using this weighted scheme. Numerical tests are used to compare the weighted and non-weighted methods for the recovery of solutions to two differential equations with high-dimensional random inputs: a boundary value problem with a random elliptic operator and a 2-D thermally driven cavity flow with random boundary condition.

37 pages, 10 figures

References in corpus (1)

• Sparsity and Incoherence in Compressive Sampling

Cited by in corpus (56)

• Sparse Polynomial Chaos Expansions: Literature Survey and Benchmark
• Compressive Sampling of Polynomial Chaos Expansions: Convergence Analysis and Sampling Strategies
• Enhancing ${\ell }_1$-minimization estimates of polynomial chaos expansions using basis selection
• 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
• On Polynomial Chaos Expansion via Gradient-enhanced ${\ell }_1$-minimization
• A generalized sampling and preconditioning scheme for sparse approximation of polynomial chaos expansions
• Compressive sensing adaptation for polynomial chaos expansions
• Compressed sensing with sparse corruptions: Fault-tolerant sparse collocation approximations
• Stochastic collocation on unstructured multivariate meshes
• A Low-rank Control Variate for Multilevel Monte Carlo Simulation of High-dimensional Uncertain Systems
• 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
• Coordinate Transformation and Polynomial Chaos for the Bayesian Inference of a Gaussian Process with Parametrized Prior Covariance Function
• 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
• A non-intrusive reduced-order modeling method using polynomial chaos expansion
• Neural Network Training Using ${\ell }_1$-Regularization and Bi-fidelity Data
• Sparse Polynomial Chaos expansions using Variational Relevance Vector Machines
• Interpolation via weighted $l_1$ minimization
• Divide and Conquer: An Incremental Sparsity Promoting Compressive Sampling Approach for Polynomial Chaos Expansions
• The sample complexity of weighted sparse approximation
• Bi-fidelity Variational Auto-encoder for Uncertainty Quantification
• Approximating smooth, multivariate functions on irregular domains
• Robust Adaptive Least Squares Polynomial Chaos Expansions in High-Frequency Applications
• Probabilistic Power Flow Computation via Low-Rank and Sparse Tensor Recovery
• Quantifying Uncertainties in Fault Slip Distribution during the Tōhoku Tsunami using Polynomial Chaos
• Polynomial Chaos-based Bayesian Inference of K-Profile Parametrization in a General Circulation Model of the Tropical Pacific
• Multi-level Compressed Sensing Petrov-Galerkin discretization of high-dimensional parametric PDEs
• A preconditioning approach for improved estimation of sparse polynomial chaos expansions
• Sparse polynomial surrogates for aerodynamic computations with random inputs
• Level Set Methods for Stochastic Discontinuity Detection in Nonlinear Problems
• A mixed ${\ell }_1$ regularization approach for sparse simultaneous approximation of parameterized PDEs
• 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
• Correcting for unknown errors in sparse high-dimensional function approximation
• Scalable Deep-Learning-Accelerated Topology Optimization for Additively Manufactured Materials
• Adaptive Sparse Polynomial Chaos Expansions via Leja Interpolation
• Global sensitivity analysis with limited data via sparsity-promoting D-MORPH regression: Application to char combustion
• Infinite-dimensional compressed sensing and function interpolation
• Compressive sensing Petrov-Galerkin approximation of high-dimensional parametric operator equations
• Polynomial-Chaos-based Kriging
• Parametric/Stochastic Model Reduction: Low-Rank Representation, Non-Intrusive Bi-Fidelity Approximation, and Convergence Analysis
• The greedy side of the LASSO: New algorithms for weighted sparse recovery via loss function-based orthogonal matching pursuit
• Quadrature Sampling of Parametric Models with Bi-fidelity Boosting
• Atomic radius and charge parameter uncertainty in biomolecular solvation energy calculations
• Gradient-informed basis adaptation for Legendre Chaos expansions
• Compressive Hermite interpolation: sparse, high-dimensional approximation from gradient-augmented measurements
• Rank adaptive tensor recovery based model reduction for partial differential equations with high-dimensional random inputs
• A general framework of rotational sparse approximation in uncertainty quantification
• GenMod: A generative modeling approach for spectral representation of PDEs with random inputs
• An Efficient Non-Intrusive Uncertainty Propagation Method for Stochastic Multi-Physics Models