CauTion: Knowing When to Trust LLMs for Ensemble Causal Discovery
Not on the map. Why?
Abstract (arXiv)
Causal discovery from observational data remains challenging due to the fundamental limitations of purely statistical methods, such as statistical distinguishability within equivalence classes and sensitivity to finite sample sizes. While large language models (LLMs) offer a promising source of domain knowledge to complement statistical inference, existing LLM-augmented methods are vulnerable to LLM errors and incur high token costs. Moreover, reliance on a single data-centric algorithm can make results sensitive to algorithm-specific biases. To address these limitations, we propose CauTion, a framework that reliably integrates LLM domain knowledge into an ensemble of statistical causal discovery algorithms through consensus filtering and LLM reliability estimation. CauTion proceeds in three stages. First, an algorithm ensemble utilizes a consensus voting to resolve up to 96% of edges on which algorithms agree, achieving near-perfect accuracy on the filtered consensus edges. Second, a trust-calibrated arbitration mechanism estimates the relative reliability of the LLM and the algorithms via an annotation-free trust calibration procedure, which is then utilized to govern a trust-weighted voting process that restricts LLM arbitration exclusively to edges with unreliable algorithmic evidence. Third, a cycle repair step is applied to guarantee the final causal graph is validly acyclic. Experiments on six datasets demonstrate that CauTion consistently outperforms both data-centric and LLM-augmented baselines, with larger gains on larger graphs and strong robustness to LLM errors. Code is available at https://github.com/OpenCausaLab/CauTion.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 19 of its 38 references that are in the map. First posted on arXiv 2 Jun 2026.
Builds on
19 of 38 references.
References · 19
- 2023Can LLMs Express Their Uncertainty? An Empirical Evaluation of Confidence Elicitation in LLMscited by 974
- 2018DAGs with NO TEARS: Continuous Optimization for Structure Learningcited by 752
- 2020Deep Structural Causal Models for Tractable Counterfactual Inferencecited by 211
- 2019Learning Sparse Nonparametric DAGscited by 207
- 2020A Survey on Causal Inferencecited by 202
- 2013Causal Inference in the Presence of Latent Variables and Selection Biascited by 166
- 2022DAGMA: Learning DAGs via M-matrices and a Log-Determinant Acyclicity Characterizationcited by 140
- 2023Causal-learn: Causal Discovery in Pythoncited by 109
- 2022Greedy Relaxations of the Sparsest Permutation Algorithmcited by 64
- 2023Causal Discovery with Language Models as Imperfect Expertscited by 64
- 2023Integrating Large Language Model for Improved Causal Discoverycited by 54
- 2024Efficient Causal Graph Discovery Using Large Language Modelscited by 53
7 more
- 2023Causal Order: The Key to Leveraging Imperfect Experts in Causal Inferencecited by 48
- 2023Fast Scalable and Accurate Discovery of DAGs Using the Best Order Score Search and Grow-Shrink Treescited by 38
- 2024Integrating Large Language Models in Causal Discovery: A Statistical Causal Approachcited by 32
- 2023pgmpy: A Python Toolkit for Bayesian Networkscited by 23
- 2024Sample, estimate, aggregate: A recipe for causal discovery foundation modelscited by 21
- 2026CauScale: Neural Causal Discovery at Scalecited by 6
- 2026CauScientist: Teaching LLMs to Respect Data for Causal Discoverycited by 3
Built on by
Citing papers per year: 2026: 1.
1 paper.