LLM Explainability with Counterfactual Chains and Causal Graphs
Pith reviewed 2026-06-28 03:07 UTC · model grok-4.3
The pith
Causal graphs can represent how LLMs organize high-level concepts to reach predictions.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
Causal graphs recovered from LLM-perceived concept states, after MCMC-inspired counterfactual augmentation, capture meaningful dependencies that are consistent with the LLMs' reasoning on the studied tasks.
What carries the argument
Four-phase pipeline that maps inputs to LLM-perceived concept states, augments them via MCMC-inspired counterfactual chains, and applies σ-CG to obtain class-discriminative causal graphs.
If this is right
- The graphs achieve both predictive fidelity to the original LLM and structural stability across random seeds.
- The augmentation procedure converges and improves downstream utility of the discovered graphs.
- The same pipeline produces informative graphs for disease diagnosis, sentiment analysis, and LLM-as-a-judge classification.
Where Pith is reading between the lines
- If the graphs prove stable, they could serve as an editable interface for intervening on an LLM's concept-level reasoning without retraining.
- The method may extend to settings where only black-box access to the LLM is available, provided the concept extractor remains reliable.
- Comparing graphs across models on the same task could quantify how different LLMs organize the same concepts.
Load-bearing premise
The MCMC-inspired augmentation enlarges the data without changing the LLM's underlying concept perceptions.
What would settle it
If the recovered graphs assign zero probability to a direct causal link that is required to reproduce the LLM's accuracy on held-out examples, or if the graphs change substantially when the augmentation step is removed, the claim would be falsified.
Figures
read the original abstract
Causal graphs provide a high-level language for making mechanisms transparent. Recent work uses Large Language Models (LLMs) to recover causal graphs of external-world processes. Instead, in this paper, we use causal graphs to model LLM inference itself, providing stakeholders with a transparent view of how the model perceives and organizes high-level concepts to produce a prediction. We propose a four-phase method for constructing such graphs. Given a target LLM and a set of textual examples, our method discovers class-discriminative, human-interpretable concepts and maps each input to LLM-perceived concept states. We then introduce an MCMC-inspired counterfactual augmentation procedure that expands the sparse observational data through chains of counterfactuals. This enables stable causal discovery with $\sigma$-CG, yielding informative, interpretable graphs. We apply our method to three LLMs across disease diagnosis, sentiment analysis, and LLM-as-a-judge classification tasks. We evaluate the learned graphs for predictive fidelity and structural stability, and the MCMC-inspired augmentation for convergence and downstream utility. Our results show that the discovered causal graphs capture meaningful dependencies consistent with LLMs' reasoning. Together, this paper provides a foundation for concept-level explainability of LLMs.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper proposes a four-phase pipeline to construct causal graphs that model an LLM's own inference process: (1) discover class-discriminative human-interpretable concepts, (2) map inputs to LLM-perceived concept states, (3) expand the resulting sparse observational data via an MCMC-inspired counterfactual augmentation procedure, and (4) run σ-CG causal discovery. The method is demonstrated on three LLMs across disease diagnosis, sentiment analysis, and LLM-as-a-judge tasks; the authors claim the resulting graphs exhibit predictive fidelity and structural stability and capture dependencies consistent with the LLMs' reasoning.
Significance. If the central claim holds after proper validation, the work would supply a concrete mechanism for concept-level, mechanism-transparent explainability of LLMs that goes beyond post-hoc feature attribution. The combination of counterfactual chain augmentation with causal discovery is a distinctive technical contribution whose utility would be high if the augmentation step can be shown to preserve the target model's concept perceptions.
major comments (2)
- [Abstract] Abstract: the abstract asserts that the learned graphs achieve 'predictive fidelity and structural stability' and that 'our results show that the discovered causal graphs capture meaningful dependencies consistent with LLMs' reasoning,' yet supplies no numerical metrics, baselines, error bars, or description of how σ-CG was applied or how fidelity/stability were quantified. This absence makes it impossible to assess support for the central claim.
- [Four-phase method] Four-phase method (paragraph describing Phase 3): the MCMC-inspired counterfactual augmentation is asserted to expand sparse data 'without distorting the LLM's actual concept perceptions,' but the manuscript provides no quantitative check (e.g., agreement rate between LLM outputs on original versus augmented inputs, or a held-out consistency metric) that the generated chains preserve the model's own concept states. Because this step is load-bearing for the claim that the discovered edges reflect the LLM's reasoning rather than augmentation artifacts, the missing validation is a material gap.
Simulated Author's Rebuttal
We thank the referee for the constructive comments, which highlight opportunities to strengthen the clarity and validation in our manuscript. We address each major comment below and will make the indicated revisions.
read point-by-point responses
-
Referee: [Abstract] Abstract: the abstract asserts that the learned graphs achieve 'predictive fidelity and structural stability' and that 'our results show that the discovered causal graphs capture meaningful dependencies consistent with LLMs' reasoning,' yet supplies no numerical metrics, baselines, error bars, or description of how σ-CG was applied or how fidelity/stability were quantified. This absence makes it impossible to assess support for the central claim.
Authors: We agree that the abstract would benefit from quantitative support. In the revised version we will incorporate specific metrics for predictive fidelity (e.g., graph-based prediction accuracy on held-out examples), structural stability (e.g., edge overlap across multiple runs), and a concise description of the σ-CG procedure and its parameterization. revision: yes
-
Referee: [Four-phase method] Four-phase method (paragraph describing Phase 3): the MCMC-inspired counterfactual augmentation is asserted to expand sparse data 'without distorting the LLM's actual concept perceptions,' but the manuscript provides no quantitative check (e.g., agreement rate between LLM outputs on original versus augmented inputs, or a held-out consistency metric) that the generated chains preserve the model's own concept states. Because this step is load-bearing for the claim that the discovered edges reflect the LLM's reasoning rather than augmentation artifacts, the missing validation is a material gap.
Authors: The manuscript reports evaluations of the augmentation procedure for convergence and downstream utility. We acknowledge, however, that an explicit agreement-rate comparison between LLM concept states on original versus counterfactual inputs is not provided. We will add this metric (percentage agreement on a held-out sample of chains) in the revision to directly confirm that the augmentation preserves the target model's perceptions. revision: yes
Circularity Check
No circularity: pipeline derives graphs from LLM states then evaluates independently
full rationale
The provided abstract and method description outline a four-phase procedure that first extracts LLM-perceived concept states from textual examples, applies an MCMC-inspired augmentation, runs σ-CG discovery, and then separately evaluates the graphs on predictive fidelity and structural stability. No equation, definition, or quoted claim reduces the final consistency result to the input data by construction, renames a fit as a prediction, or relies on a self-citation chain for a uniqueness theorem. The central claim that the graphs capture meaningful dependencies is presented as an empirical outcome of the pipeline rather than a tautology, satisfying the criteria for a self-contained derivation.
Axiom & Free-Parameter Ledger
Reference graph
Works this paper leans on
-
[1]
Causalm: Causal model explanation through counterfactual language models.Comput. Linguis- tics, 47(2):333–386. Tao Feng, Lizhen Qu, Niket Tandon, Zhuang Li, Xiaoxi Kang, and Gholamreza Haffari. 2025. On the relia- bility of large language models for causal discovery. InProceedings of the 63rd Annual Meeting of the Association for Computational Linguistics...
-
[2]
Woosuk Kwon, Zhuohan Li, Siyuan Zhuang, Ying Sheng, Lianmin Zheng, Cody Hao Yu, Joseph E
Probing internal representations of multi- word verbs in large language models.CoRR, abs/2502.04789. Woosuk Kwon, Zhuohan Li, Siyuan Zhuang, Ying Sheng, Lianmin Zheng, Cody Hao Yu, Joseph E. Gonzalez, Hao Zhang, and Ion Stoica. 2023. Ef- ficient memory management for large language model serving with pagedattention.Preprint, arXiv:2309.06180. Tian Lan, Ji...
-
[3]
Association for Computational Linguistics. Jing Ma. 2025. Causal inference with large language model: A survey. InFindings of the Association for Computational Linguistics: NAACL 2025, Albu- querque, New Mexico, USA, April 29 - May 4, 2025, Findings of ACL, pages 5886–5898. Association for Computational Linguistics. Andrew L. Maas, Raymond E. Daly, Peter ...
2025
-
[4]
Learning word vectors for sentiment analysis. InProceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, pages 142–150, Portland, Oregon, USA. Association for Computational Lin- guistics. Aaron Mueller, Jannik Brinkmann, Millicent L. Li, Samuel Marks, Koyena Pal, Nikhil Prakash, Can Rager, Aruna...
-
[5]
coarse expansion
(N= 1448 ), predicting among Migraine, Sinusitis, and Influenza. For Sentiment Analy- sis, we use raw movie review texts from IMDB (N= 2096 ), classified as Positive or Negative. For LLM-as-a-Judge, we retain the primary user query and two candidate responses sourced from Reddit (Calderon et al., 2025) (N= 395). Handling Positional Bias in LAJThe LAJ task...
2096
-
[6]
Item” + Original Index (e.g., “Item98
JSON Output: A single valid JSON object. Item keys are “Item” + Original Index (e.g., “Item98”). JSON Structure: { "Item_Original_Index_Here" : { "User Query": "Original user query", "Original Index": "Original Index from input", "Chosen Response": "Final Chosen Response", "Rejected Response": "Final Rejected Response", "ChangeFlag": boolean } } END JSON
-
[7]
Reasoning Output(After JSON, one block per item): Reasoning for Item [Original Index]:
-
[8]
Original Index: [Original Index]
-
[9]
Target Concept: [*Target Concept* Name]
-
[10]
Current Label for Target Concept: [1, 0, 2, or 3]
-
[11]
*wanted label*
Target Label: "*wanted label*"
-
[12]
Labels are identical (Current Label is
Critical Check Outcome: ["Labels are identical (Current Label is "*wanted label*")" OR "Labels are NOT identical (Current Label is [actual_label], not "*wanted label*")"]
-
[13]
Scenario A applied (because Current Label is
Scenario Applied: ["Scenario A applied (because Current Label is "*wanted label*")" OR "Scenario B applied (because Current Label is [actual_label], not "*wanted label*")"]
-
[14]
No modifications made as required by Scenario A. ChangeFlag is False
Final Action & ChangeFlag Value Details: - If Scenario A: "No modifications made as required by Scenario A. ChangeFlag is False." - If Scenario B: "Modifications were mandatory under Scenario B. [Describe changes to Chosen and Rejected responses.]" ChangeFlag is True
-
[15]
Conciseness
If you were given the reason for current labeling by the LLM, add how you included this reason in the modified responses. EXAMPLE (Keep this output structure and reasoning detail): Let’s assume the Target Concept is “Conciseness”. Input Item 1: Original Index:98 User Query:“What is the capital of France?” Chosen Response: “Ah, you’re asking about the capi...
-
[17]
Current Label for Target Concept: 3
-
[18]
Critical Check Outcome: Labels are NOT identical (Current Label is 3, not 1)
-
[19]
Scenario Applied: Scenario B applied (because Current Label is 3, not 1)
-
[20]
Paris.") was made significantly less concise by adding verbiage. The original Chosen Response (a long sentence) was made more concise. These changes aim to ensure
Final Action & ChangeFlag Value Details: Modifications were mandatory under Scenario B. The original Rejected Response ("Paris.") was made significantly less concise by adding verbiage. The original Chosen Response (a long sentence) was made more concise. These changes aim to ensure "Conciseness" now better represents Chosen. ChangeFlag is True. Reasoning...
-
[21]
Target Concept: Conciseness
-
[22]
Current Label for Target Concept: 1
-
[23]
Critical Check Outcome: Labels are identical (Current Label is 1)
-
[24]
Scenario Applied: Scenario A applied (because Current Label is 1)
-
[25]
migraine
Final Action & ChangeFlag Value Details: No modifications made as required by Scenario A. ChangeFlag is False. Dataset: Prompt E.6: Prompt for MCMC Inspired Expansion stage dataset : LIBERTY Role: You are a medical data augmentation and modification expert. Core Task: Your goal is to modify a patient description so that a symptom:*SYMPTOM* becomes *DX* al...
2025
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.