OCDB: Revisiting Causal Discovery with a Comprehensive Benchmark and Evaluation Framework
Wei Zhou, Hong Huang, Guowen Zhang, Ruize Shi, Kehan Yin, Yuanyuan Lin, Bang Liu
TL;DR
This work tackles interpretability in LLMs by reframing it through causal discovery, introducing two metrics—Causal Structure Distance $CSD$ and Causal Effect Distance $CED$—to quantify differences in structure and causal effects. It also presents the Open Causal Discovery Benchmark (OCDB), a real-data, framework-enabled platform with diverse datasets, baseline models, and evaluation metrics to enable fair comparisons between DAGs and CPDAGs. Empirical results show current algorithms struggle to generalize to real-world data, and that $CSD$/$CED$ offer more reliable interpretability assessments than existing structure- or intervention-focused metrics. The framework and metrics aim to drive development of more trustworthy, interpretable LLMs by standardizing evaluation and promoting broader, real-world benchmarking.
Abstract
Large language models (LLMs) have excelled in various natural language processing tasks, but challenges in interpretability and trustworthiness persist, limiting their use in high-stakes fields. Causal discovery offers a promising approach to improve transparency and reliability. However, current evaluations are often one-sided and lack assessments focused on interpretability performance. Additionally, these evaluations rely on synthetic data and lack comprehensive assessments of real-world datasets. These lead to promising methods potentially being overlooked. To address these issues, we propose a flexible evaluation framework with metrics for evaluating differences in causal structures and causal effects, which are crucial attributes that help improve the interpretability of LLMs. We introduce the Open Causal Discovery Benchmark (OCDB), based on real data, to promote fair comparisons and drive optimization of algorithms. Additionally, our new metrics account for undirected edges, enabling fair comparisons between Directed Acyclic Graphs (DAGs) and Completed Partially Directed Acyclic Graphs (CPDAGs). Experimental results show significant shortcomings in existing algorithms' generalization capabilities on real data, highlighting the potential for performance improvement and the importance of our framework in advancing causal discovery techniques.
