Divide and conquer: an incremental sparsity promoting compressive sampling approach for polynomial chaos expansions
From MaRDI portal
Publication:2309799
Abstract: This paper introduces an efficient sparse recovery approach for Polynomial Chaos (PC) expansions, which promotes the sparsity by breaking the dimensionality of the problem. The proposed algorithm incrementally explores sub-dimensional expansions for a sparser recovery, and shows success when removal of uninfluential parameters that results in a lower coherence for measurement matrix, allows for a higher order and/or sparser expansion to be recovered. The incremental algorithm effectively searches for the sparsest PC approximation, and not only can it decrease the prediction error, it can also reduce the dimensionality of PCE model. Four numerical examples are provided to demonstrate the validity of the proposed approach. The results from these examples show that the incremental algorithm substantially outperforms conventional compressive sampling approaches for PCE, in terms of both solution sparsity and prediction error.
Recommendations
- Some greedy algorithms for sparse polynomial chaos expansions
- Compressive sensing with cross-validation and stop-sampling for sparse polynomial chaos expansions
- A generalized sampling and preconditioning scheme for sparse approximation of polynomial chaos expansions
- Sparse polynomial chaos expansions via compressed sensing and D-optimal design
- Enhancing sparsity of Hermite polynomial expansions by iterative rotations
Cites work
- rm K-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
- A compressed sensing approach for partial differential equations with random input data
- A non-adapted sparse approximation of PDEs with stochastic inputs
- A weighted _1-minimization approach for sparse polynomial chaos expansions
- Active subspace methods in theory and practice: applications to kriging surfaces
- Adaptive sparse polynomial chaos expansion based on least angle regression
- An adaptive high-dimensional stochastic model representation technique for the solution of stochastic partial differential equations
- Atomic decomposition by basis pursuit
- Compressed sensing
- Compressed sensing with coherent and redundant dictionaries
- Compressive sampling
- Compressive sampling of polynomial chaos expansions: convergence analysis and sampling strategies
- Dimension-adaptive tensor-product quadrature
- Dimensionality reduction for complex models via Bayesian compressive sensing
- Enhancing \(\ell_1\)-minimization estimates of polynomial chaos expansions using basis selection
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Enhancing sparsity of Hermite polynomial expansions by iterative rotations
- Galerkin Finite Element Approximations of Stochastic Elliptic Partial Differential Equations
- Global sensitivity indices for nonlinear mathematical models and their Monte Carlo estimates
- High dimensional polynomial interpolation on sparse grids
- scientific article; zbMATH DE number 1215244 (Why is no real title available?)
- scientific article; zbMATH DE number 1126861 (Why is no real title available?)
- scientific article; zbMATH DE number 2000348 (Why is no real title available?)
- scientific article; zbMATH DE number 2232688 (Why is no real title available?)
- Minimization of \(\ell_{1-2}\) for compressed sensing
- Monte Carlo strategies in scientific computing.
- Multi-element probabilistic collocation method in high dimensions
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- New Bounds for Restricted Isometry Constants
- Numerical methods for stochastic computations. A spectral method approach.
- On compressive sensing applied to radar
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- 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
- Solution of stochastic partial differential equations using Galerkin finite element techniques
- Sparse grid collocation schemes for stochastic natural convection problems
- Sparse pseudospectral approximation method
- Sparse representations in unions of bases
- Stable recovery of sparse overcomplete representations in the presence of noise
- Stochastic collocation algorithms using _1-minimization
- The Wiener--Askey Polynomial Chaos for Stochastic Differential Equations
Cited in
(19)- A data-driven framework for sparsity-enhanced surrogates with arbitrary mutually dependent randomness
- Sequential sparse Bayesian learning with applications to system identification for damage assessment and recursive reconstruction of image sequences
- A multi-fidelity polynomial chaos-greedy Kaczmarz approach for resource-efficient uncertainty quantification on limited budget
- Some greedy algorithms for sparse polynomial chaos expansions
- On the construction of uncertain time series surrogates using polynomial chaos and Gaussian processes
- Basis adaptive sample efficient polynomial chaos (BASE-PC)
- A near-optimal sampling strategy for sparse recovery of polynomial chaos expansions
- PI-VAE: physics-informed variational auto-encoder for stochastic differential equations
- Subsampled Gauss quadrature nodes for estimating polynomial chaos expansions
- Compressive sensing with cross-validation and stop-sampling for sparse polynomial chaos expansions
- Sliced-Inverse-Regression--Aided Rotated Compressive Sensing Method for Uncertainty Quantification
- Using automatic differentiation for compressive sensing in uncertainty quantification
- Sparse polynomial chaos expansions: literature survey and benchmark
- A general framework of rotational sparse approximation in uncertainty quantification
- Sparse Approximation of Data-Driven Polynomial Chaos Expansions: An Induced Sampling Approach
- A novel sparse polynomial chaos expansion technique with high adaptiveness for surrogate modelling
- Towards optimal sampling for learning sparse approximation in high dimensions
- Multivariate sensitivity-adaptive polynomial chaos expansion for high-dimensional surrogate modeling and uncertainty quantification
- Enhancing sparsity of Hermite polynomial expansions by iterative rotations
This page was built for publication: Divide and conquer: an incremental sparsity promoting compressive sampling approach for polynomial chaos expansions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2309799)
