mlsanityData to 7 Oct 2026

Deep Adaptive Arbitrary Polynomial Chaos Expansion: A Mini-data-driven Semi-supervised Method for Uncertainty Quantification

arXiv 2107.10428 ↗First posted 22 Jul 2021cs.LGcited by 6

Not on the map. Why?

Abstract (arXiv)

The surrogate model-based uncertainty quantification method has drawn much attention in many engineering fields. Polynomial chaos expansion (PCE) and deep learning (DL) are powerful methods for building a surrogate model. However, PCE needs to increase the expansion order to improve the accuracy of the surrogate model, which causes more labeled data to solve the expansion coefficients, and DL also requires a lot of labeled data to train the deep neural network (DNN). First of all, this paper proposes the adaptive arbitrary polynomial chaos (aPC) and proves two properties about the adaptive expansion coefficients. Based on the adaptive aPC, a semi-supervised deep adaptive arbitrary polynomial chaos expansion (Deep aPCE) method is proposed to reduce the training data cost and improve the surrogate model accuracy. For one hand, the Deep aPCE method uses two properties of the adaptive aPC to assist in training the DNN based on only a small amount of labeled data and many unlabeled data, significantly reducing the training data cost. On the other hand, the Deep aPCE method adopts the DNN to fine-tune the adaptive expansion coefficients dynamically, improving the Deep aPCE model accuracy with lower expansion order. Besides, the Deep aPCE method can directly construct accurate surrogate models of the high dimensional stochastic systems without complex dimension-reduction and model decomposition operations. Five numerical examples and an actual engineering problem are used to verify the effectiveness of the Deep aPCE method.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 13 of its 90 references that are in the map. First posted on arXiv 22 Jul 2021.

Builds on

13 of 90 references.

References · 13

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2016Gaussian Error Linear Units (GELUs)cited by 3,431
  3. 2016An overview of gradient descent optimization algorithmscited by 1,021
  4. 2015Automatic differentiation in machine learning: a surveycited by 846
  5. 2014Deep Learning in Neural Networks: An Overviewcited by 765
  6. 2018Quantifying total uncertainty in physics-informed neural networks for solving forward and inverse stochastic problemscited by 144
  7. 2017A Tutorial on Kernel Density Estimation and Recent Advancescited by 100
  8. 2018Deep UQ: Learning deep neural network surrogate models for high dimensional uncertainty quantificationcited by 81
  9. 2014Deeply learned face representations are sparse, selective, and robustcited by 56
  10. 2020Iterative Surrogate Model Optimization (ISMO): An active learning algorithm for PDE constrained optimization with deep neural networkscited by 26
  11. 2017Sparse Polynomial Chaos Expansions via Compressed Sensing and D-optimal Designcited by 10
  12. 2017Global sensitivity analysis in the context of imprecise probabilities (p-boxes) using sparse polynomial chaos expansionscited by 3
1 more
  1. 2020Infrastructure Recovery Curve Estimation Using Gaussian Process Regression on Expert Elicited Datacited by 2

Built on by

Cited by year

Citing papers per year: 2022: 2; 2023: 2; 2024: 1; 2025: 1.

6 papers.