cs.AISep 25, 2026

Externalized CPDAG Summaries Improve LLM Causal Deduction

Authors: Wentao Sun, João Paulo Nogueira, Dominique Verchere, Mathieu Acher, Alonso Silva

Organizations: Nokia Bell Labs · Télécom SudParis · IRISA

Abstract

Corr2Cause asks whether a causal claim holds in every DAG compatible with observed correlations and conditional independencies. We frame this as latent-object reasoning: the label is defined by a CPDAG query, but free-form chain-of-thought often collapses the Markov-equivalence-class problem into local pattern matching. We propose Structured Thinking, a two-turn pipeline that first externalizes a typed, schema-constrained CPDAG summary and then answers against that graph state. On the Corr2Cause full test, Structured Thinking raises Qwen3.5-27B from 73.073.0 to 86.486.4 F1F_1(Yes) over a strong PC-instruction baseline in the primary paired run (+13.4+13.4 pp; McNemar p=2.4×10−6p=2.4\times 10^{-6}; bootstrap 95%95\% CI [+8.4+8.4, +18.6+18.6]); across three full-ID seeds, the mean gain is +8.1±5.3+8.1 \pm 5.3 pp. A PC-scaffolded two-turn prose control reaches only 67.667.6 F1F_1, indicating that a detailed PC scaffold plus a schema-free prose intermediate is not sufficient. The same pattern holds on Qwen3.6-27B, Paraphrase-OOD, and GPT-5.4-mini. Scrambling the emitted CPDAG costs 12.012.0 pp F1F_1, and a full-split audit shows close agreement with the reference CPDAG (ID skeleton F1F_1 0.9600.960; exact match 75.9%75.9\%). These results support a bounded design principle: externalize the latent object that defines the label, constrain its form, and test whether downstream answers use it.

Explore similar work

Mar 11, 2026

Causal Concept Graphs in LLM Latent Space for Stepwise Reasoning

Sparse autoencoders can localize where concepts live in language models, but not how they interact during multi-step reasoning. We propose Causal Concept Graphs (CCG): a directed acyclic graph over sparse, interpretable latent features, where edges capture learned causal dependencies between concepts. We combine task-conditioned sparse autoencoders for concept discovery with DAGMA-style differentiable structure learning for graph recovery and introduce the Causal Fidelity Score (CFS) to evaluate whether graph-guided interventions induce larger downstream effects than random ones. On ARC-Challenge, StrategyQA, and LogiQA with GPT-2 Medium, across five seeds (n=15n{=}15 paired runs), CCG achieves \CFS=5.654±0.625\CFS=5.654\pm0.625, outperforming ROME-style tracing (3.382±0.2333.382\pm0.233), SAE-only ranking (2.479±0.1962.479\pm0.196), and a random baseline (1.032±0.0341.032\pm0.034), with p<0.0001p<0.0001 after Bonferroni correction. Learned graphs are sparse (5-6% edge density), domain-specific, and stable across seeds.
Aug 4, 2026

GENESIS: Towards Explainable Causal Discovery

Causal Discovery (CD) from observational data faces two fundamental challenges. First, purely statistical methods often lack the power to resolve structural ambiguities in low-sample regimes. Second, although LLM-assisted hybrid approaches improve structure recovery through semantic reasoning, the influence of that reasoning on individual edge decisions remains largely opaque. Consequently, existing hybrid methods fail to satisfy a fundamental requirement: explaining why a particular edge is included or excluded in the learned directed acyclic graph (DAG). This is critical in real-world applications, where no ground-truth DAG exists and every structural decision must be independently justified. We formalize this requirement as decision traceability, requiring every inferred edge to be supported by auditable statistical evidence, Markov Blanket consistency, or explicit domain reasoning. We propose GENESIS, an explainable hybrid CD framework that decomposes graph construction into interpretable decision points. GENESIS first identifies and scores three-node structural motifs, including chains, forks, and colliders, to establish transparent structural priors, then progressively refines the graph by integrating these priors with observational evidence, invoking domain knowledge only when statistical evidence is insufficient. By design, every edge decision is resolved through an auditable source of evidence. Experiments show that GENESIS achieves 100% decision traceability across all settings, establishing explainability as a first-class objective in causal discovery. Despite this additional requirement, GENESIS consistently outperforms purely statistical CD methods on the majority of benchmark datasets across all sample regimes in terms of Structural Hamming Distance (SHD), while achieving performance comparable to state-of-the-art LLM-assisted approaches.
Sep 17, 2026

MaSCoD: A Multi-Agent Framework for Structural-Context-Guided Candidate Causal Graph Generation

Large language models (LLMs) have been applied to causal discovery, but candidate-graph generation rarely treats premature omission of potentially relevant causal relations as an explicit design objective. We propose MaSCoD, a multi-agent framework that organizes candidate third variables and local structural patterns before direct-edge judgment. We evaluate MaSCoD on Auto-MPG, DWD, and Sachs using GPT-5.4 as the primary backbone and GPT-4o for replication. MaSCoD exhibits a dataset- and backbone-dependent retention-selectivity profile rather than uniform superiority. Across all six dataset-backbone settings, Full, which supplies structural hypotheses before direct-edge judgment, achieved higher mean Recall and F1 than No Phase 1, which instead constructs them within the judgment procedure, while also increasing false-positive rates. Additional reference-edge retention over all evaluated baselines was observed on DWD with GPT-5.4 and on Sachs with GPT-4o, rather than uniformly across settings. Partial ablations showed that supplying both information components did not always outperform supplying only one. For GPT-5.4, stage-wise analysis showed that the Full-No Phase 1 retention gap was already present after direct-edge judgment, while reconciliation introduced additional reference-edge loss for Full on Sachs. These findings support structural pre-organization as an explicit design and evaluation target for omission control and motivate evaluating context construction jointly with its utilization in judgment.