Bayesian Adaptive Polynomial Chaos Expansions
By: Kellin N. Rumsey , Devin Francom , Graham C. Gibson and more
Potential Business Impact:
Makes computer predictions more reliable with less data.
Polynomial chaos expansions (PCE) are widely used for uncertainty quantification (UQ) tasks, particularly in the applied mathematics community. However, PCE has received comparatively less attention in the statistics literature, and fully Bayesian formulations remain rare, especially with implementations in R. Motivated by the success of adaptive Bayesian machine learning models such as BART, BASS, and BPPR, we develop a new fully Bayesian adaptive PCE method with an efficient and accessible R implementation: khaos. Our approach includes a novel proposal distribution that enables data-driven interaction selection, and supports a modified g-prior tailored to PCE structure. Through simulation studies and real-world UQ applications, we demonstrate that Bayesian adaptive PCE provides competitive performance for surrogate modeling, global sensitivity analysis, and ordinal regression tasks.
Similar Papers
A tree-based Polynomial Chaos expansion for surrogate modeling and sensitivity analysis of complex numerical models
Methodology
Makes computer models run faster and more accurately.
Polynomial Chaos Expansion for Operator Learning
Machine Learning (Stat)
Learns math problems and shows how sure it is.
Physics-informed Polynomial Chaos Expansion with Enhanced Constrained Optimization Solver and D-optimal Sampling
Machine Learning (Stat)
Makes computer models work better with less data.