Conformal prediction for full and sparse polynomial chaos expansions
A. Hatstatt, X. Zhu, B. Sudret

TL;DR
This paper integrates conformal prediction methods with polynomial chaos expansions to produce statistically robust, well-calibrated prediction intervals, especially effective with small datasets and computationally efficient.
Contribution
It introduces the application of full conformal and Jackknife+ methods to both full and sparse PCEs, enhancing prediction interval calibration and computational efficiency.
Findings
Improved coverage of prediction intervals over bootstrap methods.
Effective application to small training datasets.
Maintained moderate computational cost.
Abstract
Polynomial Chaos Expansions (PCEs) are widely recognized for their efficient computational performance in surrogate modeling. Yet, a robust framework to quantify local model errors is still lacking. While the local uncertainty of PCE prediction can be captured using bootstrap resampling, other methods offering more rigorous statistical guarantees are needed, especially in the context of small training datasets. Recently, conformal predictions have demonstrated strong potential in machine learning, providing statistically robust and model-agnostic prediction intervals. Due to its generality and versatility, conformal prediction is especially valuable, as it can be adapted to suit a variety of problems, making it a compelling choice for PCE-based surrogate models. In this contribution, we explore its application to PCE-based surrogate models. More precisely, we present the integration of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsProbabilistic and Robust Engineering Design · Model Reduction and Neural Networks · Stochastic Gradient Optimization Techniques
