Compressive sampling of polynomial chaos expansions: convergence analysis and sampling strategies
From MaRDI portal
(Redirected from Publication:349724)
\(\ell_1\)-minimizationcompressive samplingHermite polynomialsLegendre polynomialsMarkov chain Monte Carlopolynomial chaossparse approximationstochastic PDEsuncertainty quantification
Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Computational methods for stochastic equations (aspects of stochastic analysis) (60H35) Computational methods in Markov chains (60J22) Monte Carlo methods (65C05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Sampling theory in information and communication theory (94A20)
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 -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.
Recommendations
- Coherence motivated sampling and convergence analysis of least squares polynomial chaos regression
- A near-optimal sampling strategy for sparse recovery of polynomial chaos expansions
- Least squares polynomial chaos expansion: a review of sampling strategies
- Sparse polynomial chaos expansions via compressed sensing and D-optimal design
- A hybrid sequential sampling strategy for sparse polynomial chaos expansion based on compressive sampling and Bayesian experimental design
Cites work
- A compressed sensing approach for partial differential equations with random input data
- A non-adapted sparse approximation of PDEs with stochastic inputs
- A Probabilistic and RIPless Theory of Compressed Sensing
- A survey of cross-validation procedures for model selection
- A weighted _1-minimization approach for sparse polynomial chaos expansions
- Adaptive sparse polynomial chaos expansion based on least angle regression
- Asymptotic analysis of the Hermite polynomials from their differential–difference equation
- Asymptotic Forms for Laguerre Polynomials
- Atomic Decomposition by Basis Pursuit
- Atomic decomposition by basis pursuit
- Automated solution of differential equations by the finite element method. The FEniCS book
- Compressed sensing
- Compressive sensing and structured random matrices
- Dimensionality reduction for complex models via Bayesian compressive sensing
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Generalized Jacobi Weights, Christoffel Functions, and Jacobi Polynomials
- scientific article; zbMATH DE number 3814037 (Why is no real title available?)
- scientific article; zbMATH DE number 3176961 (Why is no real title available?)
- scientific article; zbMATH DE number 49187 (Why is no real title available?)
- scientific article; zbMATH DE number 840151 (Why is no real title available?)
- Mean Convergence of Expansions in Laguerre and Hermite Series
- Monte Carlo sampling methods using Markov chains and their applications
- Multi-resolution analysis of Wiener-type uncertainty propagation schemes
- NIST handbook of mathematical functions
- Numerical methods for stochastic computations. A spectral method approach.
- Observed universality of phase transitions in high-dimensional geometry, with implications for modern data analysis and signal processing
- Physical Systems with Random Uncertainties: Chaos Representations with Arbitrary Probability Measure
- Probing the Pareto frontier for basis pursuit solutions
- Reweighted \(\ell_1\) minimization method for stochastic elliptic differential equations
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Selection of polynomial chaos bases via Bayesian model uncertainty methods with applications to sparse approximation of PDEs with stochastic inputs
- Sparse and redundant representations. From theory to applications in signal and image processing.
- Sparse Legendre expansions via _1-minimization
- Sparse multiresolution regression for uncertainty propagation
- Spectral Methods for Uncertainty Quantification
- Stochastic collocation algorithms using _1-minimization
- The Wiener--Askey Polynomial Chaos for Stochastic Differential Equations
- Uniform Bounds for Bessel Functions
Cited in
(99)- An efficient non-intrusive reduced basis model for high dimensional stochastic problems in CFD
- Efficient uncertainty quantification of stochastic CFD problems using sparse polynomial chaos and compressed sensing
- Infinite-dimensional compressed sensing and function interpolation
- Orbit uncertainty propagation and sensitivity analysis with separated representations
- A low-rank control variate for multilevel Monte Carlo simulation of high-dimensional uncertain systems
- Coherence motivated sampling and convergence analysis of least squares polynomial chaos regression
- Sparse polynomial chaos expansions via compressed sensing and D-optimal design
- Projection methods for stochastic dynamic systems: a frequency domain approach
- A preconditioning approach for improved estimation of sparse polynomial chaos expansions
- Sparsity-promoting elastic net method with rotations for high-dimensional nonlinear inverse problem
- A data-driven framework for sparsity-enhanced surrogates with arbitrary mutually dependent randomness
- An efficient and robust adaptive sampling method for polynomial chaos expansion in sparse Bayesian learning framework
- M-PCM-OFFD: an effective output statistics estimation method for systems of high dimensional uncertainties subject to low-order parameter interactions
- Optimal Bayesian experimental design for subsurface flow problems
- Efficient reliability analysis with a CDA-based dimension-reduction model and polynomial chaos expansion
- Sparse identification of nonlinear dynamical systems via reweighted \(\ell_1\)-regularized least squares
- Tight bounds on the mutual coherence of sensing matrices for Wigner d-functions on regular grids
- Adaboost-based ensemble of polynomial chaos expansion with adaptive sampling
- A multi-fidelity polynomial chaos-greedy Kaczmarz approach for resource-efficient uncertainty quantification on limited budget
- Bi-fidelity reduced polynomial chaos expansion for uncertainty quantification
- Analysis of geometric uncertainties in CFD problems solved by RBF-FD meshless method
- A stochastic Galerkin method with adaptive time-stepping for the Navier-Stokes equations
- Polynomial chaos expansions for dependent random variables
- Multi-level multi-fidelity sparse polynomial chaos expansion based on Gaussian process regression
- Adaptive weighted least-squares polynomial chaos expansion with basis adaptivity and sequential adaptive sampling
- PLS-based adaptation for efficient PCE representation in high dimensions
- Some greedy algorithms for sparse polynomial chaos expansions
- Adaptive sparse polynomial dimensional decomposition for derivative-based sensitivity
- Bi-fidelity approximation for uncertainty quantification and sensitivity analysis of irradiated particle-laden turbulence
- Intrusive generalized polynomial chaos with asynchronous time integration for the solution of the unsteady Navier-Stokes equations
- Variance-based adaptive sequential sampling for polynomial chaos expansion
- A hybrid sequential sampling strategy for sparse polynomial chaos expansion based on compressive sampling and Bayesian experimental design
- Probabilistic modeling and global sensitivity analysis for CO\(_2\) storage in geological formations: a spectral approach
- A rapid and efficient isogeometric design space exploration framework with application to structural mechanics
- Divide and conquer: an incremental sparsity promoting compressive sampling approach for polynomial chaos expansions
- Least squares polynomial chaos expansion: a review of sampling strategies
- An efficient multifidelity \(\ell_1\)-minimization method for sparse polynomial chaos
- Compressive Hermite interpolation: sparse, high-dimensional approximation from gradient-augmented measurements
- Infinite-dimensional \(\ell ^1\) minimization and function approximation from pointwise data
- Weighted discrete least-squares polynomial approximation using randomized quadratures
- On polynomial chaos expansion via gradient-enhanced \(\ell_1\)-minimization
- A gradient enhanced \(\ell_{1}\)-minimization for sparse approximation of polynomial chaos expansions
- Basis adaptive sample efficient polynomial chaos (BASE-PC)
- A near-optimal sampling strategy for sparse recovery of polynomial chaos expansions
- Projection pursuit adaptation on polynomial chaos expansions
- Comparison of the performance and reliability between improved sampling strategies for polynomial chaos expansion
- Subsampled Gauss quadrature nodes for estimating polynomial chaos expansions
- Compressive sensing Petrov-Galerkin approximation of high-dimensional parametric operator equations
- Stochastic collocation methods via \(\ell_1\) minimization using randomized quadratures
- Compressive sensing with cross-validation and stop-sampling for sparse polynomial chaos expansions
- Compressive sensing with redundant dictionaries and structured measurements
- Weighted approximate Fekete points: sampling for least-squares polynomial approximation
- Polynomial approximation via compressed sensing of high-dimensional functions on lower sets
- Compressed sensing with sparse corruptions: fault-tolerant sparse collocation approximations
- Sliced-Inverse-Regression--Aided Rotated Compressive Sensing Method for Uncertainty Quantification
- Multivariate approximation in downward closed polynomial spaces
- Sequential Design of Experiment for Sparse Polynomial Chaos Expansions
- Reduced basis methods for uncertainty quantification
- Effectively subsampled quadratures for least squares polynomial approximations
- Sparse polynomial chaos expansions: literature survey and benchmark
- Near-optimal sampling strategies for multivariate function approximation on general domains
- A general framework of rotational sparse approximation in uncertainty quantification
- Train flow chaos analysis based on an improved cellular automata model
- Constructing least-squares polynomial approximations
- Sparse Approximation of Data-Driven Polynomial Chaos Expansions: An Induced Sampling Approach
- A reduced-basis polynomial-chaos approach with a multi-parametric truncation scheme for problems with uncertainties
- An adaptive WENO collocation method for differential equations with random coefficients
- A Gradient-Enhanced L1 Approach for the Recovery of Sparse Trigonometric Polynomials
- A mixed ℓ1 regularization approach for sparse simultaneous approximation of parameterized PDEs
- A randomized algorithm for multivariate function approximation
- Efficient Bayesian experimentation using an expected information gain lower bound
- A generalized sampling and preconditioning scheme for sparse approximation of polynomial chaos expansions
- Importance sampling in signal processing applications
- Stochastic Collocation vial1-Minimisation on Low Discrepancy Point Sets with Application to Uncertainty Quantification
- Data-driven polynomial ridge approximation using variable projection
- A novel sparse polynomial chaos expansion technique with high adaptiveness for surrogate modelling
- Analysis of sparse recovery for Legendre expansions using envelope bound
- A massively parallel implementation of multilevel Monte Carlo for finite element models
- Sensitivity-enhanced generalized polynomial chaos for efficient uncertainty quantification
- An active sparse polynomial chaos expansion approach based on sequential relevance vector machine
- Classifier-based adaptive polynomial chaos expansion for high-dimensional uncertainty quantification
- Bi-fidelity variational auto-encoder for uncertainty quantification
- Towards optimal sampling for learning sparse approximation in high dimensions
- Physics-informed polynomial chaos expansions
- Active learning polynomial chaos expansion for reliability analysis by maximizing expected indicator function prediction error
- Sparse identification of nonlinear dynamical systems via non-convex penalty least squares
- Algorithm 1040: the Sparse Grids Matlab Kit -- a Matlab implementation of sparse grids for high-dimensional function approximation and uncertainty quantification
- SeAr PC: sensitivity enhanced arbitrary polynomial chaos
- Polynomial chaos expansion vs. Monte Carlo simulation in a stochastic analysis of wave propagation
- Data-driven projection pursuit adaptation of polynomial chaos expansions for dependent high-dimensional parameters
- A robust and efficient stepwise regression method for building sparse polynomial chaos expansions
- Neural chaos: a spectral stochastic neural operator
- Mechanical state estimation with a polynomial-chaos-based statistical finite element method
- A multivariate Jacobi polynomials regression estimator associated with an ANOVA decomposition model
- Boosting efficiency and reducing graph reliance: basis adaptation integration in Bayesian multi-fidelity networks
- Practical error bounds for a non-intrusive bi-fidelity approach to parametric/stochastic model reduction
- Enhancing sparsity of Hermite polynomial expansions by iterative rotations
- Sparse polynomial chaos expansions using variational relevance vector machines
- Gaussian process regression and conditional polynomial chaos for parameter estimation
This page was built for publication: Compressive sampling of polynomial chaos expansions: convergence analysis and sampling strategies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q349724)
