[edit]
An AutoML-Powered Architecture for Causal Discovery
Proceedings of the 13th International Conference on Probabilistic Graphical Models, PMLR 343:36-56, 2026.
Abstract
Causal discovery is fundamental across a wide range of scientific domains. While numerous algorithms have been proposed in the literature, they often rely on methods that suffer from limitations such as strong parametric assumptions or restrictions on variable types, making them ill-suited for application to complex, real-world datasets. Recent advances in Automated Machine Learning (AutoML) leverage and tune flexible model architectures to process complex non-linear relationships and mixed data types, while automating data preprocessing for real-world applications. In this work, we design an end-to-end AutoML-based architecture for Causal Discovery (MLCD) that fully leverages these capabilities. The proposed framework consists of three main components: (i) selecting the optimal configuration for each node—including data transformations, feature sets, and predictive models and hyperparameters; (ii) constructing the graph skeleton by taking the union of the selected feature sets; and (iii) applying conditional independence tests that employ the selected optimal configurations to compute the p-values. To account for the presence of latent common causes in real-world scenarios, we formulate MLCD for causally insufficient systems, though it can easily adapt to causally sufficient environments as well. We evaluate our method on both synthetic and real-world datasets. Notably, MLCD processes raw data directly, bypassing the preprocessing pipelines required by most causal discovery methods.