Basis adaptive sample efficient polynomial chaos (BASE-PC)
From MaRDI portal
Publication:2425254
Abstract: For a large class of orthogonal basis functions, there has been a recent identification of expansion methods for computing accurate, stable approximations of a quantity of interest. This paper presents, within the context of uncertainty quantification, a practical implementation using basis adaptation, and coherence motivated sampling, which under assumptions has satisfying guarantees. This implementation is referred to as Basis Adaptive Sample Efficient Polynomial Chaos (BASE-PC). A key component of this is the use of anisotropic polynomial order which admits evolving global bases for approximation in an efficient manner, leading to consistently stable approximation for a practical class of smooth functionals. This fully adaptive, non-intrusive method, requires no a priori information of the solution, and has satisfying theoretical guarantees of recovery. A key contribution to stability is the use of a presented correction sampling for coherence-optimal sampling in order to improve stability and accuracy within the adaptive basis scheme. Theoretically, the method may dramatically reduce the impact of dimensionality in function approximation, and numerically the method is demonstrated to perform well on problems with dimension up to 1000.
Recommendations
- Accelerated basis adaptation in homogeneous chaos spaces
- Coherence motivated sampling and convergence analysis of least squares polynomial chaos regression
- Compressive sampling of polynomial chaos expansions: convergence analysis and sampling strategies
- Grid and basis adaptive polynomial chaos techniques for sensitivity and uncertainty analysis
- An efficient and robust adaptive sampling method for polynomial chaos expansion in sparse Bayesian learning framework
Cites work
- scientific article; zbMATH DE number 49187 (Why is no real title available?)
- scientific article; zbMATH DE number 1834589 (Why is no real title available?)
- A Christoffel function weighted least squares algorithm for collocation approximations
- A Probabilistic and RIPless Theory of Compressed Sensing
- A compressed sensing approach for partial differential equations with random input data
- A non-adapted sparse approximation of PDEs with stochastic inputs
- A note on guaranteed sparse recovery via \(\ell_1\)-minimization
- A stochastic projection method for fluid flow. II: Random process
- A weighted \(\ell_1\)-minimization approach for sparse polynomial chaos expansions
- Accurate solutions to the square thermally driven cavity at high Rayleigh number
- Adaptive sparse polynomial chaos expansion based on least angle regression
- Almost orthogonal submatrices of an orthogonal matrix
- An adaptive multi-element generalized polynomial chaos method for stochastic differential equations
- Atomic Decomposition by Basis Pursuit
- Coherence motivated sampling and convergence analysis of least squares polynomial chaos regression
- Compressed sensing
- Compressive sampling of polynomial chaos expansions: convergence analysis and sampling strategies
- Compressive sensing and structured random matrices
- Dimensionality reduction for complex models via Bayesian compressive sensing
- Divide and conquer: an incremental sparsity promoting compressive sampling approach for polynomial chaos expansions
- Enhancing \(\ell_1\)-minimization estimates of polynomial chaos expansions using basis selection
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Infinite-dimensional \(\ell ^1\) minimization and function approximation from pointwise data
- Interpolation via weighted \(\ell_{1}\) minimization
- Least squares polynomial chaos expansion: a review of sampling strategies
- Majorizing measures without measures
- Majorizing measures: The generic chaining
- Multi-Element Generalized Polynomial Chaos for Arbitrary Probability Measures
- Multi-resolution analysis of Wiener-type uncertainty propagation schemes
- Numerical methods for stochastic computations. A spectral method approach.
- On a near optimal sampling strategy for least squares polynomial regression
- On polynomial chaos expansion via gradient-enhanced \(\ell_1\)-minimization
- On the stability and accuracy of least squares approximations
- Physical Systems with Random Uncertainties: Chaos Representations with Arbitrary Probability Measure
- Probing the Pareto frontier for basis pursuit solutions
- Random vectors in the isotropic position
- Reweighted \(\ell_1\) minimization method for stochastic elliptic differential equations
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Sampling from large matrices
- Selection of polynomial chaos bases via Bayesian model uncertainty methods with applications to sparse approximation of PDEs with stochastic inputs
- Sparse Legendre expansions via \(\ell_1\)-minimization
- Sparse and redundant representations. From theory to applications in signal and image processing.
- Sparse multiresolution regression for uncertainty propagation
- Spectral Methods for Uncertainty Quantification
- Stochastic Spectral Galerkin and Collocation Methods for PDEs with Random Coefficients: A Numerical Comparison
- Stochastic collocation algorithms using \(\ell_1\)-minimization
- The Wiener--Askey Polynomial Chaos for Stochastic Differential Equations
- The bifurcations of duffing's equation: An application of catastrophe theory
- The restricted isometry property and its implications for compressed sensing
- User-friendly tail bounds for sums of random matrices
Cited in
(29)- A general framework of rotational sparse approximation in uncertainty quantification
- Adaboost-based ensemble of polynomial chaos expansion with adaptive sampling
- Sequential sampling for optimal weighted least squares approximations in hierarchical spaces
- Coherence motivated sampling and convergence analysis of least squares polynomial chaos regression
- Sparse polynomial chaos expansions: literature survey and benchmark
- Orthogonal bases for polynomial regression with derivative information in uncertainty quantification
- Applied harmonic analysis and data processing. Abstracts from the workshop held March 25--31, 2018
- Towards optimal sampling for learning sparse approximation in high dimensions
- Physics-informed polynomial chaos expansions
- On the influence of over-parameterization in manifold based surrogates and deep neural operators
- Regression-based sparse polynomial chaos for uncertainty quantification of subsurface flow models
- Bi-fidelity variational auto-encoder for uncertainty quantification
- Accelerated basis adaptation in homogeneous chaos spaces
- Basis adaptation in homogeneous chaos spaces
- Grid and basis adaptive polynomial chaos techniques for sensitivity and uncertainty analysis
- Novel algorithm for flexible multibody systems with hybrid uncertainties
- Sliced-Inverse-Regression--Aided Rotated Compressive Sensing Method for Uncertainty Quantification
- Projection pursuit adaptation on polynomial chaos expansions
- Practical error bounds for a non-intrusive bi-fidelity approach to parametric/stochastic model reduction
- Variance-based adaptive sequential sampling for polynomial chaos expansion
- Polynomial chaos expansions on principal geodesic Grassmannian submanifolds for surrogate modeling and uncertainty quantification
- Bi-fidelity stochastic gradient descent for structural optimization under uncertainty
- Non-intrusive framework of reduced-order modeling based on proper orthogonal decomposition and polynomial chaos expansion
- Adaptive weighted least-squares polynomial chaos expansion with basis adaptivity and sequential adaptive sampling
- GenMod: a generative modeling approach for spectral representation of PDEs with random inputs
- A survey of unsupervised learning methods for high-dimensional uncertainty quantification in black-box-type problems
- A novel sparse polynomial chaos expansion technique with high adaptiveness for surrogate modelling
- Classifier-based adaptive polynomial chaos expansion for high-dimensional uncertainty quantification
- M-PCM-OFFD: an effective output statistics estimation method for systems of high dimensional uncertainties subject to low-order parameter interactions
This page was built for publication: Basis adaptive sample efficient polynomial chaos (BASE-PC)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2425254)
