Adaboost-based ensemble of polynomial chaos expansion with adaptive sampling

DOI10.1016/j.cma.2021.114238OpenAlexW3210851548MaRDI QIDQ2060149

Kai Cheng, Yicheng Zhou, Zhen-Zhou Lü

Publication date: 13 December 2021

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

Full work available at URL: https://doi.org/10.1016/j.cma.2021.114238

zbMATH Keywords

uncertainty quantificationadaptive samplingpolynomial chaos expansionensemble learning

Mathematics Subject Classification ID

Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Numerical methods for partial differential equations, boundary value problems (65N99)

Related Items (1)

Classifier-based adaptive polynomial chaos expansion for high-dimensional uncertainty quantification

Cites Work

• Unnamed Item
• Unnamed Item
• Bagging predictors
• Compressive sampling of polynomial chaos expansions: convergence analysis and sampling strategies
• A non-adapted sparse approximation of PDEs with stochastic inputs
• Adaptive sparse polynomial chaos expansion based on least angle regression
• SAMBA: sparse approximation of moment-based arbitrary polynomial chaos
• Enhancing \(\ell_1\)-minimization estimates of polynomial chaos expansions using basis selection
• Finding maximin Latin hypercube designs by iterated local search heuristics
• A sweepline algorithm for Voronoi diagrams
• A decision-theoretic generalization of on-line learning and an application to boosting
• Ensembling neural networks: Many could be better than all
• Least angle regression. (With discussion)
• Sparse polynomial chaos expansions via compressed sensing and D-optimal design
• An efficient and robust adaptive sampling method for polynomial chaos expansion in sparse Bayesian learning framework
• Adaptive weighted least-squares polynomial chaos expansion with basis adaptivity and sequential adaptive sampling
• Some greedy algorithms for sparse polynomial chaos expansions
• A new non-intrusive polynomial chaos using higher order sensitivities
• Least squares polynomial chaos expansion: a review of sampling strategies
• Convergence study of the truncated Karhunen–Loeve expansion for simulation of stochastic processes
• Nonadaptive Quasi-Optimal Points Selection for Least Squares Linear Regression
• Uniformly distributed sequences with an additional uniform property
• The quickhull algorithm for convex hulls
• Physical Systems with Random Uncertainties: Chaos Representations with Arbitrary Probability Measure
• The Wiener--Askey Polynomial Chaos for Stochastic Differential Equations
• Sparse Approximate Solutions to Linear Systems
• Subspace Pursuit for Compressive Sensing Signal Reconstruction
• EXTENDING CLASSICAL SURROGATE MODELING TO HIGH DIMENSIONS THROUGH SUPERVISED DIMENSIONALITY REDUCTION: A DATA-DRIVEN APPROACH
• Analysis of Orthogonal Matching Pursuit Using the Restricted Isometry Property
• Global optimization method using adaptive and parallel ensemble of surrogates for engineering design optimization
• Experiments with AdaBoost.RT, an Improved Boosting Scheme for Regression
• Compressed sensing
• Model selection for small sample regression
• Metamodels for computer-based engineering design: Survey and recommendations

This page was built for publication: Adaboost-based ensemble of polynomial chaos expansion with adaptive sampling