CausalDS, a benchmark for evaluating causal reasoning in agentic data-science workflows, is introduced, which jointly evaluates symbolic causal reasoning, data science, uncertainty quantification, abstention, and tool use/coding.
Abstract
Large language models (LLMs) increasingly act as integrated data-science agents, combining abstract reasoning with advanced tool use. Yet the relevant benchmark landscape largely divides into symbolic causal reasoning benchmarks without realistic data analysis or data analysis benchmarks without a principled causal data-generating structure. Furthermore, existing causal evaluation datasets are often restricted to curated examples from existing sources, with diversity coming from limited templatized variations rather than from systematic generation of novel synthetic causal structures. We introduce CausalDS, a benchmark for evaluating causal reasoning in agentic data-science workflows. Each benchmark instance is a scene consisting of a sampled structural causal model (SCM) with generated observational data and an accompanying synthetic natural-language story grounded in a realistic domain. We optionally ground the composition of the benchmark components in empirical distributions obtained from real-world datasets, thus retaining empirical structure while reducing the"causal parrot"risk through completely synthetic generation. From each scene, we then derive tasks spanning all three of Pearl's rungs, with typical data-science prediction tasks appearing as Rung 1. Most tasks include a data science coding component, where the model typically needs to use several tools to arrive at the final answer due to the frequent presence of imperfect observations, which are generated by an observation model. Additionally, recognizing when a question admits no warranted answer and abstaining is treated as a first-class scored outcome. The benchmark thus jointly evaluates symbolic causal reasoning, data science, uncertainty quantification, abstention, and tool use/coding.
CausalArena is introduced, a unified and evolvable benchmark for causal discovery under a common protocol, and substantial ranking shifts across SCM families and protocols are revealed, showing that strong performance in one benchmark regime does not reliably transfer to others.
Zi-Rong Li, Si-Zhuang Liu, Tian-Zuo Wang et al.· 0 citations
DI-Bench is presented, a pipeline for generating realistic benchmarks for data intelligence (DI), the practice of extracting insights from large volumes of enterprise data, and four models are evaluated, revealing a substantial finding: models achieve only 32% accuracy when doing computational tasks where retrieved bus...
Jiang-Yun Zhang, K. Surrao, Torpong Nitayanont et al.· 0 citations
This work proposes a framework that ensembles the reasoning structure, not just the answers, of multiple LLMs by weighted merging of Directed Acyclic Graphs (DAGs) extracted from reasoning chains by weighted merging of Directed Acyclic Graphs (DAGs) extracted from reasoning chains.
Amruta Parulekar, Jinu Lee, Dilek Z. Hakkani-Tür et al.· arXiv.org· 1 citation
CausalVerify studies this verification problem for structured econometric causal-estimation workflows by separating realistic interpretation from verifiable computation by separating realistic interpretation from verifiable computation.
Yong-Hong Zhang, Ricardo Correia, Isabel M. Parra et al.· 1 citation
The bottleneck is scientific judgment rather than coding, and genuine discovery remains out of reach, so TruthInsightBench makes this gap a measurable target.
Zhi-Bo Yang, Chen Zhang, Yue-Wei Zhang et al.· 1 citation
Grounded Reasoning in Dependency (GRiD) is introduced, a novel dependency-aware reasoning framework that explicitly grounds reasoning steps in structured knowledge that substantially improves reasoning accuracy, consistency, and faithfulness compared to recent state-of-the-art structured reasoning methods.
Xiangyu Wen, Min Li, Junhua Huang et al.· Neural Information Processin...· 2 citations
Related blog posts
MIT News · Artificial Intelligence· news.mit.eduOct 15, 2026
A new computational approach reveals how cells communicate to assemble into tissues. This could accelerate stem cell engineering, improve disease models, and inform therapies.
Microsoft Research Blog· microsoft.comOct 15, 2026
Zero-knowledge proofs can verify computing results without rerunning workloads or exposing sensitive data. Magnetar helps bring them into the mainstream with support for standard programming languages, major speed gains, and quantum-resistant security. The post Proof-based general-purpose computing with Magnetar appeared first on Microsoft Research.
MIT News · Artificial Intelligence· news.mit.eduSep 24, 2026