An active sparse polynomial chaos expansion approach based on sequential relevance vector machine

DOI10.1016/J.CMA.2023.116554MaRDI QIDQ6120140zbMATH OpenFDO

Authors Yangtian Li, Yangjun Luo, Zheng Zhong

Publication date 25 March 2024

Published in Computer Methods in Applied Mechanics and Engineering (Search for Journal in Brave)

zbMATH Keywords

marginal likelihood maximizationsparse polynomial chaos expansionactive learning techniquesequential relevance vector machine

Mathematics Subject Classification ID

Computer science (68-XX) Operations research, mathematical programming (90-XX)

Recommendations

• A fully Bayesian sparse polynomial chaos expansion approach with joint priors on the coefficients and global selection of terms
• An efficient and robust adaptive sampling method for polynomial chaos expansion in sparse Bayesian learning framework
• Sparse polynomial chaos expansions: literature survey and benchmark
• Sparse polynomial chaos expansions using variational relevance vector machines
• A hybrid sequential sampling strategy for sparse polynomial chaos expansion based on compressive sampling and Bayesian experimental design

Cites work

• 10.1162/15324430152748236
• A gradient enhanced \(\ell_{1}\)-minimization for sparse approximation of polynomial chaos expansions
• A stochastic projection method for fluid flow. II: Random process
• A weighted \(\ell_1\)-minimization approach for sparse polynomial chaos expansions
• Adaptive sparse polynomial chaos expansion based on least angle regression
• An efficient and robust adaptive sampling method for polynomial chaos expansion in sparse Bayesian learning framework
• An efficient sampling method for regression-based polynomial chaos expansion
• Bayesian Compressive Sensing Using Laplace Priors
• Bayesian adaptation of chaos representations using variational inference and sampling on geodesics
• Bayesian sparse polynomial chaos expansion for global sensitivity analysis
• Compressive sampling of polynomial chaos expansions: convergence analysis and sampling strategies
• Efficient uncertainty quantification of stochastic CFD problems using sparse polynomial chaos and compressed sensing
• Enhancing \(\ell_1\)-minimization estimates of polynomial chaos expansions using basis selection
• Nonadaptive quasi-optimal points selection for least squares linear regression
• Reweighted \(\ell_1\) minimization method for stochastic elliptic differential equations
• Some greedy algorithms for sparse polynomial chaos expansions
• Sparse grid collocation schemes for stochastic natural convection problems
• Sparse polynomial chaos expansions and adaptive stochastic finite elements using a regression approach
• Sparse polynomial chaos expansions using variational relevance vector machines
• Sparse polynomial chaos expansions via compressed sensing and D-optimal design
• Variance-based adaptive sequential sampling for polynomial chaos expansion

Cited in

(2)

• A new surrogate modeling method combining polynomial chaos expansion and Gaussian kernel in a sparse Bayesian learning framework
• Sparse Bayesian learning for complex‐valued rational approximations

This page was built for publication: An active sparse polynomial chaos expansion approach based on sequential relevance vector machine

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6120140)