Deep Polynomial Chaos Expansion

Johannes Exenberger, Sascha Ranftl, Robert Peharz
Proceedings of The 29th International Conference on Artificial Intelligence and Statistics, PMLR 300:4033-4041, 2026.

Abstract

Polynomial chaos expansion (PCE) is a classical and widely used surrogate modeling technique in physical simulation and uncertainty quantification. By taking a linear combination of a set of basis polynomials—orthonormal with respect to the distribution of uncertain input parameters—PCE enables tractable inference of key statistical quantities such as (conditional) means, variances, covariances, and Sobol sensitivity indices, which are essential for understanding the modeled system and identifying influential parameters and their interactions. The applicability of PCE to high-dimensional problems is limited by poor scalability, as the number of basis functions grows exponentially with the number of parameters. In this paper, we address this challenge by combining PCE with ideas from tractable probabilistic circuits, resulting in \emph{deep polynomial chaos expansion} (DeepPCE)—a deep generalization of PCE that scales effectively to high-dimensional input spaces. DeepPCE achieves predictive performance comparable to that of multilayer perceptrons (MLPs), while retaining PCE’s ability to compute \emph{exact} statistical inferences via simple forward passes. In contrast, such computations in MLPs require costly and often inaccurate approximations, such as Monte Carlo integration.

Cite this Paper


BibTeX
@InProceedings{pmlr-v300-exenberger26a, title = { Deep Polynomial Chaos Expansion }, author = {Exenberger, Johannes and Ranftl, Sascha and Peharz, Robert}, booktitle = {Proceedings of The 29th International Conference on Artificial Intelligence and Statistics}, pages = {4033--4041}, year = {2026}, editor = {Khan, Emtiyaz and Li, Yingzhen and Solin, Arno and Ramdas, Aaditya}, volume = {300}, series = {Proceedings of Machine Learning Research}, month = {02--05 May}, publisher = {PMLR}, pdf = {https://raw.githubusercontent.com/mlresearch/v300/main/assets/exenberger26a/exenberger26a.pdf}, url = {https://proceedings.mlr.press/v300/exenberger26a.html}, abstract = { Polynomial chaos expansion (PCE) is a classical and widely used surrogate modeling technique in physical simulation and uncertainty quantification. By taking a linear combination of a set of basis polynomials—orthonormal with respect to the distribution of uncertain input parameters—PCE enables tractable inference of key statistical quantities such as (conditional) means, variances, covariances, and Sobol sensitivity indices, which are essential for understanding the modeled system and identifying influential parameters and their interactions. The applicability of PCE to high-dimensional problems is limited by poor scalability, as the number of basis functions grows exponentially with the number of parameters. In this paper, we address this challenge by combining PCE with ideas from tractable probabilistic circuits, resulting in \emph{deep polynomial chaos expansion} (DeepPCE)—a deep generalization of PCE that scales effectively to high-dimensional input spaces. DeepPCE achieves predictive performance comparable to that of multilayer perceptrons (MLPs), while retaining PCE’s ability to compute \emph{exact} statistical inferences via simple forward passes. In contrast, such computations in MLPs require costly and often inaccurate approximations, such as Monte Carlo integration. } }
Endnote
%0 Conference Paper %T Deep Polynomial Chaos Expansion %A Johannes Exenberger %A Sascha Ranftl %A Robert Peharz %B Proceedings of The 29th International Conference on Artificial Intelligence and Statistics %C Proceedings of Machine Learning Research %D 2026 %E Emtiyaz Khan %E Yingzhen Li %E Arno Solin %E Aaditya Ramdas %F pmlr-v300-exenberger26a %I PMLR %P 4033--4041 %U https://proceedings.mlr.press/v300/exenberger26a.html %V 300 %X Polynomial chaos expansion (PCE) is a classical and widely used surrogate modeling technique in physical simulation and uncertainty quantification. By taking a linear combination of a set of basis polynomials—orthonormal with respect to the distribution of uncertain input parameters—PCE enables tractable inference of key statistical quantities such as (conditional) means, variances, covariances, and Sobol sensitivity indices, which are essential for understanding the modeled system and identifying influential parameters and their interactions. The applicability of PCE to high-dimensional problems is limited by poor scalability, as the number of basis functions grows exponentially with the number of parameters. In this paper, we address this challenge by combining PCE with ideas from tractable probabilistic circuits, resulting in \emph{deep polynomial chaos expansion} (DeepPCE)—a deep generalization of PCE that scales effectively to high-dimensional input spaces. DeepPCE achieves predictive performance comparable to that of multilayer perceptrons (MLPs), while retaining PCE’s ability to compute \emph{exact} statistical inferences via simple forward passes. In contrast, such computations in MLPs require costly and often inaccurate approximations, such as Monte Carlo integration.
APA
Exenberger, J., Ranftl, S. & Peharz, R.. (2026). Deep Polynomial Chaos Expansion . Proceedings of The 29th International Conference on Artificial Intelligence and Statistics, in Proceedings of Machine Learning Research 300:4033-4041 Available from https://proceedings.mlr.press/v300/exenberger26a.html.

Related Material