Skip to content

Externalized CPDAG Summaries Improve LLM Causal Deduction

Sep 2026 · 0 citations · 30 references
Computer Science

TL;DR

The results of Corr2Cause support a bounded design principle: externalize the latent object that defines the label, constrain its form, and test whether downstream answers use it.

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.0$ to $86.4$ $F_1$(Yes) over a strong PC-instruction baseline in the primary paired run ($+13.4$ pp; McNemar $p=2.4\times 10^{-6}$; bootstrap $95\%$ CI [$+8.4$, $+18.6$]); across three full-ID seeds, the mean gain is $+8.1 \pm 5.3$ pp. A PC-scaffolded two-turn prose control reaches only $67.6$ $F_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.0$ pp $F_1$, and a full-split audit shows close agreement with the reference CPDAG (ID skeleton $F_1$ $0.960$; exact match $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.

View source

Similar papers

Preprint Aug 2026

Counterfactual Transition Graphs: Evaluating Cross-Class Transition Quality

Counterfactual (CF) explanations for time-series classifiers are usually evaluated one example at a time: what minimal edit flips this single window's prediction? We argue that the more informative question for diagnostic interpretability is structural: how does the classifier connect its own classes to each other? We...

S. Zaidi, Szymon Bobek, G. J. Nalepa et al. · 0 citations
#artificial intelligence Preprint Aug 2026

Selective Forgetting: A Graph-Based Memory Framework for Long-Term LLM Agents

The framework extracts each conversational turn into typed nodes and attributed edges, answers questions from a two-hop subgraph, and periodically prunes nodes that score low on a weighted combination of recency, access frequency, degree centrality, and age.

Theo Rusu, S. Khanzadeh, Manar H. Alalfi · 3 citations · ⚡1
#natural language process... Preprint Aug 2026

Detecting Hidden Chain-of-Thought in Large Language Models with Linguistic, Behavioral, and Mechanistic Indicators

These findings show stronger, less prompt-conditional CoT-like behavior in the reasoning-tuned model, consistent with but not proof of latent reasoning, thus investigates latent reasoning without relying on models'self-reported traces.

Armaanjit Singh, R. Le, Jasminepreet Kaur et al. · 0 citations
#artificial intelligence Preprint Sep 2026

Are Stated Reasoning Steps Causally Load-Bearing?

This work uses synthetic multi-hop lookup tasks to measure faithfulness causally at the activation level, specifically on self-generated reasoning, and aims to measure faithfulness causally at the activation level, specifically on self-generated reasoning.

Abhiram Bhupatiraju, Rayan Nyaupane · 0 citations
#machine learning Preprint Sep 2026

RACE: Relation-Level Counterfactual Explanations for Heterogeneous Graph Neural Networks

Counterfactual explanations of graph neural networks identify edge deletions that flip a prediction. On heterogeneous graphs, however, existing methods first collapse the graph into untyped edges, so they cannot answer the question a domain expert actually asks: which relation type drives this prediction? We present RA...

Yu-Xi Yao, Zi-Jun Zhao · 0 citations
#artificial intelligence Preprint Sep 2026

SemVerBench: Benchmarking LLM Comprehension of Version-Constraint Resolution Semantics

SemVerBench is introduced, the first benchmark of LLM version-constraint resolution semantics across three ecosystems (npm, PEP 440, Cargo), and six frontier models are evaluated: Opus significantly outperforms all other models, and Sonnet outperforms the OpenAI models (McNemar).

Qi-Bai Chen, Ze-Ming Liu · 1 citation

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.