arXiv AI

CauTion: Knowing When to Trust LLMs for Ensemble Causal Discovery

arXiv:2606. 03602v1 Announce Type: cross Abstract: 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.

arXiv AI
Aug 26

From Causal Plausibility to Causal Reliability: Evaluating LLMs as Calibrated Direct Causal-Edge Classifiers

The study evaluates 12 instruction‑tuned open‑weight LLMs on six causal‑graph benchmarks, testing five prompting strategies and four confidence sources. Findings show that LLMs tend to over‑predict edges, misclassify indirect or reversed edges as direct, and exhibit high over‑confidence, while conventional confidence estimates are unreliable and agreement signals offer limited improvement. The results suggest LLMs should be used as externally validated soft causal priors rather than definitive causal‑structure evidence.

By Amit Kumar, Elnur Adl Zarabi, Suranjana Trivedy, Zhiqian Chen, Lei Zhang, Kaiqun Fu, Taoran Ji
arXiv Machine Learning
Aug 5

GoT-CD: Graph-of-Thoughts Causal Discovery and the Fragility of Post-hoc Path-Specific Fairness Audits

arXiv:2608. 02877v1 Announce Type: new Abstract: Causal discovery recovers directed structure from observational data and is increasingly used in clinical settings to support mechanism reasoning and fairness audits of predictive models.

By Nitish Nagesh, Elahe Khatibi, Thomas Dean Hughes, Mahdi Bagheri, Pratik Gajane, Amir M. Rahmani
arXiv AI
Aug 5

When Many Answers Are Valid, Voting Fails: Symbolic Verification for Best-of-K Causal Reasoning in LLMs

arXiv:2608. 03506v1 Announce Type: new Abstract: Self-consistency assumes the most frequent answer among sampled reasoning traces is the most reliable, but this can fail in causal reasoning: samples often repeat the same confounding error, and votes fragment across multiple valid answers, letting an invalid answer win despite a valid minority trace.

By Omatharv Bharat Vaidya, Connor Thomas Jerzak, Zayne Rea Sprague, Fangcong Yin, Nhat Ho
Hugging Face Trending Papers
Aug 4

When Many Answers Are Valid, Voting Fails: Symbolic Verification for Best-of-K Causal Reasoning in LLMs

Self-consistency assumes the most frequent answer among sampled reasoning traces is the most reliable, but this can fail in causal reasoning: samples often repeat the same confounding error, and votes fragment across multiple valid answers, letting an invalid answer win despite a valid minority trace. We introduce CALVER (Causal Axiom-Level VERification), a training-free symbolic verifier that scores structured traces against Pearl's causal criteria, including -separation, backdoor adjustment, and intervention, and selects the highest-scoring candidate without consulting a reference answer.

arXiv AI
Sep 3

Loom: Weaving Diagnostic Strands into Free-Text Consensus via Embedding-Space Reweighting

Loom is a generative consensus framework designed for real‑world root‑cause analysis (RCA) that combines open‑form hypotheses from modular heuristics with a lightweight large language model (LLM) synthesis step. It projects hypotheses into a continuous embedding space and uses an iterative centroid‑based reweighting algorithm to resolve conflicts, producing a single consensus that is then synthesized by one LLM call. On the OpenRCA benchmark Loom matches state‑of‑the‑art autonomous agents on some datasets while achieving significantly higher efficiency—about 26× faster and 33× faster with an 8B‑parameter synthesizer. whyItMatters":"Loom demonstrates how embedding‑space reweighting can bridge the gap between statistical rigor and expressive LLMs, enabling efficient, trustworthy RCA in industrial settings."

By Ron Begleiter, Katya Egert Berg, Gilad Saban, Gil Shabat