Basis adaptive sample efficient polynomial chaos (BASE-PC)
From MaRDI portal
Publication:2425254
DOI10.1016/J.JCP.2018.03.035zbMATH Open1415.65028arXiv1702.01185OpenAlexW2597578662MaRDI QIDQ2425254FDOQ2425254
Alireza Doostan, Jerrad Hampton
Publication date: 26 June 2019
Published in: Journal of Computational Physics (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1702.01185
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
importance samplinguncertainty quantificationorthogonal polynomialscompressive sensingpolynomial chaosbasis adaptation
Cites Work
- Probing the Pareto Frontier for Basis Pursuit Solutions
- Atomic Decomposition by Basis Pursuit
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Sparse and Redundant Representations
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Compressed sensing
- User-friendly tail bounds for sums of random matrices
- Sparse Legendre expansions via \(\ell_1\)-minimization
- A Probabilistic and RIPless Theory of Compressed Sensing
- The Wiener--Askey Polynomial Chaos for Stochastic Differential Equations
- An adaptive multi-element generalized polynomial chaos method for stochastic differential equations
- Title not available (Why is that?)
- Spectral Methods for Uncertainty Quantification
- Title not available (Why is that?)
- The restricted isometry property and its implications for compressed sensing
- On the stability and accuracy of least squares approximations
- Stochastic Spectral Galerkin and Collocation Methods for PDEs with Random Coefficients: A Numerical Comparison
- STOCHASTIC COLLOCATION ALGORITHMS USING l1-MINIMIZATION
- A non-adapted sparse approximation of PDEs with stochastic inputs
- Random vectors in the isotropic position
- A stochastic projection method for fluid flow. II: Random process
- Majorizing measures: The generic chaining
- Title not available (Why is that?)
- Multi-Element Generalized Polynomial Chaos for Arbitrary Probability Measures
- Accurate solutions to the square thermally driven cavity at high Rayleigh number
- Majorizing measures without measures
- Adaptive sparse polynomial chaos expansion based on least angle regression
- Interpolation via weighted \(\ell_{1}\) minimization
- Title not available (Why is that?)
- A weighted \(\ell_1\)-minimization approach for sparse polynomial chaos expansions
- On polynomial chaos expansion via gradient-enhanced \(\ell_1\)-minimization
- SPARSE MULTIRESOLUTION REGRESSION FOR UNCERTAINTY PROPAGATION
- Reweighted \(\ell_1\) minimization method for stochastic elliptic differential equations
- Selection of polynomial chaos bases via Bayesian model uncertainty methods with applications to sparse approximation of PDEs with stochastic inputs
- Compressive sampling of polynomial chaos expansions: convergence analysis and sampling strategies
- A Compressed Sensing Approach for Partial Differential Equations with Random Input Data
- Physical Systems with Random Uncertainties: Chaos Representations with Arbitrary Probability Measure
- DIMENSIONALITY REDUCTION FOR COMPLEX MODELS VIA BAYESIAN COMPRESSIVE SENSING
- Multi-resolution analysis of Wiener-type uncertainty propagation schemes
- Enhancing \(\ell_1\)-minimization estimates of polynomial chaos expansions using basis selection
- A note on guaranteed sparse recovery via \(\ell_1\)-minimization
- Almost orthogonal submatrices of an orthogonal matrix
- Sampling from large matrices
- The bifurcations of duffing's equation: An application of catastrophe theory
- Infinite-dimensional \(\ell ^1\) minimization and function approximation from pointwise data
- Coherence motivated sampling and convergence analysis of least squares polynomial chaos regression
- Least squares polynomial chaos expansion: a review of sampling strategies
- A Christoffel function weighted least squares algorithm for collocation approximations
- On a near optimal sampling strategy for least squares polynomial regression
- Divide and conquer: an incremental sparsity promoting compressive sampling approach for polynomial chaos expansions
Cited In (22)
- GenMod: a generative modeling approach for spectral representation of PDEs with random inputs
- Novel algorithm for flexible multibody systems with hybrid uncertainties
- M-PCM-OFFD: an effective output statistics estimation method for systems of high dimensional uncertainties subject to low-order parameter interactions
- A General Framework of Rotational Sparse Approximation in Uncertainty Quantification
- Towards optimal sampling for learning sparse approximation in high dimensions
- Practical error bounds for a non-intrusive bi-fidelity approach to parametric/stochastic model reduction
- Bi-fidelity stochastic gradient descent for structural optimization under uncertainty
- Sparse Polynomial Chaos Expansions: Literature Survey and Benchmark
- Bi-fidelity variational auto-encoder for uncertainty quantification
- Polynomial chaos expansions on principal geodesic Grassmannian submanifolds for surrogate modeling and uncertainty quantification
- A novel sparse polynomial chaos expansion technique with high adaptiveness for surrogate modelling
- Sliced-Inverse-Regression--Aided Rotated Compressive Sensing Method for Uncertainty Quantification
- Regression-based sparse polynomial chaos for uncertainty quantification of subsurface flow models
- A survey of unsupervised learning methods for high-dimensional uncertainty quantification in black-box-type problems
- Physics-informed polynomial chaos expansions
- On the influence of over-parameterization in manifold based surrogates and deep neural operators
- Sequential Sampling for Optimal Weighted Least Squares Approximations in Hierarchical Spaces
- Non-intrusive framework of reduced-order modeling based on proper orthogonal decomposition and polynomial chaos expansion
- Classifier-based adaptive polynomial chaos expansion for high-dimensional uncertainty quantification
- Applied harmonic analysis and data processing. Abstracts from the workshop held March 25--31, 2018
- Variance-based adaptive sequential sampling for polynomial chaos expansion
- Adaptive weighted least-squares polynomial chaos expansion with basis adaptivity and sequential adaptive sampling
Uses Software
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)
