A Polynomial Chaos Framework for Causal Discovery in Nonlinear Uncertain Systems
Liang Cao
Abstract
In safety-critical industrial applications, accurately identifying causal relationships and quantifying uncertainty is essential for tasks such as root cause analysis, feature selection, and process optimization. Traditional causal discovery methods inadequately handle nonlinearities and complex uncertainties prevalent in industrial sensor data. To address this, we introduce a novel causal discovery framework that integrates Polynomial Chaos Expansion (PCE) representations of stochastic noise into structural equations. This method effectively captures complex nonlinear couplings and arbitrary noise distributions characteristic of industrial data. We rigorously prove the identifiability of causal structures under mild sparsity conditions on the chaos coefficients, extending linear non-Gaussian acyclic model (LiNGAM) identifiability results. Extensive experiments demonstrate superior accuracy, robustness under non-Gaussian noise conditions, and practical uncertainty quantification. This framework presents a principled, interpretable, and computationally feasible approach to causal analysis in nonlinear uncertain industrial environments.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext f50d2093-5b95-4bbc-a233-69ab0cfb9018Builds on6
- Gradient-Based Neural DAG LearningSébastien Lachapelle, Philippe Brouillard, Tristan Deleu, Simon Lacoste-JulienICLR 2020 · 337 citations
- On the Role of Sparsity and DAG Constraints for Learning Linear DAGsIgnavier Ng, AmirEmad Ghassami, Kun ZhangNeurIPS 2020 · 306 citations
- Causal Discovery with Reinforcement LearningShengyu Zhu, Ignavier Ng, Zhitang ChenICLR 2020 · 285 citations
- DAGMA: Learning DAGs via M-matrices and a Log-Determinant Acyclicity CharacterizationKevin Bello, Bryon Aragam, Pradeep RavikumarNeurIPS 2022 · 222 citations
- DiBS: Differentiable Bayesian Structure LearningLars Lorch, Jonas Rothfuss, Bernhard Schölkopf, Andreas KrauseNeurIPS 2021 · 144 citations
Related papers
- Learning Dynamic Causal Graphs Under Parametric Uncertainty via Polynomial Chaos ExpansionsLiang CaoICLR 2026
- Multi-View Causal Discovery without Non-Gaussianity: Identifiability and AlgorithmsAmbroise Heurtebise, Lemir Omar Chehab, Pierre Ablin, Alexandre Gramfort et al.ICML 2026
- On the identifiability of causal graphs with multiple environmentsFrancesco MontagnaICLR 2026 · 2 citations
- Causal Effect Identification in LiNGAM Models with Latent ConfoundersDaniele Tramontano, Yaroslav Kivva, Saber Salehkaleybar, Mathias Drton et al.ICML 2024 · 8 citations
- Independence Testing-Based Approach to Causal Discovery under Measurement Error and Linear Non-Gaussian ModelsHaoyue Dai, Peter Spirtes, Kun ZhangNeurIPS 2022 · 18 citations
