betaFeedback

WorksComputer Science

Causal Concept Explanations for Deep Neural Models

Abstract

Concept-based explanations in neural models are important for the development, certification, and adoption of autonomous systems. Yet, interpretability remains correlational. Without methods to guide and quantify causal relationships between explanations, a concept explanation can be provided without being necessary or sufficient for the observed output thereby appearing correct while misleading. We introduce Causal Concept Wrapper Network (CCW-Net), the first use of interventional mediation analysis from fields such as economics, medicine, and epidemiology as a training objective to align causal effects of concept-based explanations with a model's output. We further apply mediation analysis as an evaluation tool to quantify, per concept label combination, how much of any model's output is causally attributable to each concept explanation. As a training objective, CCW-Net shapes a model's concept representations such that they are both necessary and sufficient for the outputs they are credited with and independent of other concepts' contributions. Counterfactual concept representations anchor a set of causal alignment criteria: necessity, sufficiency, and independence. Necessity drives irrelevant concept effects toward zero, sufficiency ensures relevant concept representations fully reconstruct a model's output, and independence enforces the total effect decomposes linearly across concepts. We evaluate CCW-Net across aircraft control, driving, and image classification. CCW-Net provides a step toward concept-based explanations that are not merely interpretable, but quantifiably causal, supporting safer evaluation, certification, and deployment of transparent and trustworthy neural models.

Introduction

Learned policies in autonomous systems are moving from research labs into high-stakes, real-world settings such as aviation [49, 78], driving [48], and robotics [69]. This is also the case for perception models in safety-relevant settings such as medical imaging. In task and safety-critical domains such as these, interpretability is becoming a necessary component [54, 4]. Developers need it to troubleshoot [29], testers need it to verify [52, 42], and users need it to understand [56]. Yet many neural models remain black boxes: they are not interpretable in a way that is useful for people in the task at hand.

Concept-based interpretability offers promise by structuring decisions through human-interpretable concepts [33] (Echthroff et al. 2024). However, the link between concepts and outputs is typically correlational, not causal. A concept can activate alongside an output without being in the causal chain [80]. An autonomous vehicle policy might activate a “passenger pickup” concept that has no causal bearing on the observed action. A bird classifier may activate “has red plumage” on every image of a cardinal while its prediction is actually driven by “has crest”. The explanation appears correct but may mislead. To be useful for troubleshooting, certifying, and auditing, explanations must capture causal effects, i.e., the contribution of each concept to the output, isolated from concepts it co-occurs with [46]. Correlation, no matter how sophisticated, does not address such causal questions [45]. For safety and task-critical deployment we must transition from correlation to causation.

Beyond quantifying causal effects, some concept representations themselves limit what explanations can convey. Prior work typically represents concepts as scalars [41, 33, 29], e.g., a “left turn” in driving or a “has yellow belly” attribute in bird classification. Scalars indicate the presence or strength of a concept but cannot capture their higher-dimensional, context-dependent expressions. We extend concept representations from scalars to vectors, enabling each concept to encode both whether it exists and how it is expressed.

We address these challenges with Causal Concept Wrapper Network (CCW-Net), the first use of mediation analysis as a training objective in deep networks. CCW-Net introduces a network architecture and adapts interventional multi-mediator mediation analysis from economics and epidemiology [73, 37, 8, 35] to shape a model’s concept representations so that each concept’s contribution to the output is locally necessary, sufficient, and independent of contributions from other concepts. Counterfactuals required by these criteria are drawn from a mediator model (in our experiments, a per-concept invertible flow) trained alongside the overall model to track the conditional distribution of its concept embeddings. We further apply mediation analysis as an evaluation tool, quantifying, for each concept label combination, the share of a model’s output causally attributable to each concept. This is finer-grained than the population-level alignment scores reported in prior concept-based work. We evaluate CCW-Net across aircraft control, driving, and fine-grained image classification, demonstrating that mediation-trained concepts produce explanations that are not merely interpretable, but quantifiably causal.

Main contributions. Our contributions are threefold:

  1. Training objective for causal concepts in deep networks: An interventional mediation analysis based objective that shapes each concept’s causal effect on a model’s output so that activated concepts are those causing the output thereby improving explanation trustworthiness.

  2. Network architecture for concept-level mediation analysis: A network architecture that drives absent concept representations toward zero supporting well-defined interventional mediation analyses and related training objectives (App. C.1).

  3. Evaluation method for concept-based causality claims: For any concept-bottleneck model, a method to quantify, for each concept label combination, how much a change in the model’s output is causally attributable to each concept (App. F).

Related work

Concept-based explanations. Concept-based interpretability is widely explored [31, 3, 33, 5, 1, 68]. Concept Bottleneck Models [33] and adaptations to sequential decision-making [28, 29, 12, 10] structure decisions through human-interpretable concepts but typically lack formal causal analysis.

Causal mediation analysis. Causal mediation analysis models systems as directed acyclic graphs and decomposes an input’s effect on an outcome into pathways through intermediate variables called mediators. Foundational tools have been developed in economics, medicine, and epidemiology [40, 25, 72, 46, 8, 35]. Multi-mediator extensions [73, 37] decompose total effects across multiple mediators without requiring causal ordering or independence assumptions among them, with indirect effects quantifying how much of an effect operates through a specific mediator. These tools are designed to estimate causal effects from observational data under strict assumptions (App. D), but to date have been applied to analyze causal relationships in data collected outside randomized controlled trials or trained models post-hoc, not as training objectives that shape deep networks’ representations during learning.

Causal and disentanglement-based explanations for deep networks. A growing body of work applies causal frameworks to trained deep networks. Vig et al. [ [76] applied mediation analysis post hoc to study bias in transformer language models, treating individual neurons and attention heads as mediators. Geiger et al. [ [17, 19] formalize causal abstraction as a way to validate that a trained network implements a higher-level causal model. In concept-based interpretability specifically, recent work imposes or discovers causal structure over learned concepts [11, 13, 50]. Disentanglement methods like β\beta-TCVAE [9] and iVAE [30] learn factorized representations evaluated by DCI [15] and FactorVAE score [32]. Across these methods, causal or representational analysis is applied post hoc to a model trained with conventional objectives, and disentanglement is a representational property that need not imply causal alignment [58]. CCW-Net differs in that causal relationships between concept representations and model outputs are shaped during training rather than audited post-hoc.

Feature attribution. Saliency-based [62, 61, 63, 67] and perturbation-based [51, 38] attribution methods explain decisions by associating inputs or features to outputs. While useful for highlighting what features a model’s outputs correspond to, these methods generally remain correlational. Ablating a feature changes a prediction without establishing causal responsibility [2, 80]. CCW-Net grounds causal attribution in interventional indirect effect estimates, yielding per-concept attributions with quantifiable causal estimates.

Problem formulation and preliminaries

We seek to train an interpretable policy that achieves expert-level task performance, provides concept-based explanations for its predicted outputs Y^\hat{Y}, and ensures concept–output relationships reflect causal effects rather than spurious correlations. We assume access to a frozen pretrained backbone ff that achieves good task performance but lacks interpretability, and a dataset D={(Xi,Yi,ci)}i=1N\mathcal{D} = \{(X_i, Y_i, c_i)\}_{i=1}^{N} where Xi∈XX_i \in\mathcal{X} is an input, Yi∈YY_i \in\mathcal{Y} is the expert output, and ci∈{0,1}Jc_i \in\{0,1\}^{J} is a vector of JJ human-interpretable concept labels. We assume the concept ontology captures the key factors driving the model’s outputs, the dataset provides sufficient ground truth, and standard ignorability conditions hold for the induced concept-to-output structural causal model (App. D). We jointly optimize task fidelity, concept correctness, and causal alignment (§ 4), with concept–output causal relationships quantified in evaluation.

Structural causal models. A structural causal model (SCM) [45, 47] consists of equations Xi=ki(pai,ui)X_i = k_i(\mathrm{pa}_i, u_i) where each equation represents a mechanism determining exactly one variable, with uiu_i the exogenous error term and pai\mathrm{pa}_i the endogenous parent variables that directly cause XiX_i.

Interventional mediation analysis. Mediation analysis [46] decomposes the causal effect of a treatment on an outcome YY into pathways that operate through variables called mediators MM. For mediators M=(M1,…,MJ)M = (M_1, \ldots, M_J), the total effect TE decomposes as TE = DE + IE into direct effect (DE) and indirect effect (IE) components. With multiple mediators, the indirect effect further decomposes per mediator jj as IE =∑j= \sum_j IEj_j. Following Loh et al. [ [37], we relax the assumption of causal ordering or independence among mediators by introducing a residual interaction term IEμ_\mu, yielding TE = DE +∑j+ \sum_j IEj_j + IEμ_\mu. This relaxation is important for deep networks where operations like softmax and cross-attention induce dependencies among concept activations, which IEμ_\mu absorbs without violating identifiability. The interventional indirect effect IEj_j [73] quantifies how much of the total effect operates through mediator jj when its representation MjM_j is set to a counterfactual value while other mediator representations are held fixed. These quantities are identifiable from observational data under standard ignorability conditions [72, 73, 37], which hold by construction in the wrapper SCM (App. D).

CCW-Net architecture

Figure 1. CCW-Net architecture. A concept encoder gθg_\theta maps the frozen backbone’s latent ZZ to one squashed vector MjM_j per concept, whose length encodes the concept’s presence and whose direction encodes its context-dependent expression, and a bias-free attention head hϕh_\phi maps MM to the wrapper output Y^\hat{Y}. Causal alignment losses (weights and the auxiliary presence term omitted) are added to the task and concept losses, so that training shapes, and evaluation measures, how much each concept causally drives Y^\hat{Y}.

Causal Concept Wrapper Network (CCW-Net)

CCW-Net wraps a frozen backbone policy with a concept encoder and new policy head which are trained to imitate the backbone’s task performance as well as classify human-interpretable concepts similar to Kenny et al. [ [29] but using a different architecture. In addition, training involves three causal alignment criteria to induce causal relationships between concepts and outputs: necessity, sufficiency, and independence. These criteria are then evaluated via interventional mediation analysis on the wrapper’s outputs. Each causal alignment loss compares the head’s output before and after one change of a training input’s resulting concept jj’s representation. In mediation analysis terms, the concept representations are mediators and the policy head is the outcome model. Every effect discussed is the model’s own concept-to-output effect within the wrapper architecture’s SCM, not a claim about inputs or observations to output effects. For our experiments, counterfactual concept representations required by the necessity alignment term are drawn from a per-concept invertible flow trained on the wrapper’s encoder concepts. Any suitable modeling approach may be used. Reported evaluation metrics are produced from a separate estimator that does not use the mediator model.

Architecture

Given a frozen pretrained backbone f:X→Zf : \mathcal{X} \to\mathcal{Z} where ZZ is the frozen backbone’s last latent layer, a concept encoder gθ:Z→RJ×Dg_\theta: \mathcal{Z} \to\mathbb{R}^{J \times D} maps Z=f(X)Z = f(X) to a concept representation M=(M1,…,MJ)M = (M_1, \ldots, M_J). Each Mj∈RDM_j \in\mathbb{R}^{D} represents the jj-th human-interpretable concept. An attention head hϕ:RJ×D→Yh_\phi: \mathbb{R}^{J \times D} \to\mathcal{Y} maps the concept representation to a wrapper output Y^=hϕ(M)\hat{Y} = h_\phi(M). The wrapper induces the SCM X→Z→M→Y^X \to Z \to M \to\hat{Y} with no direct Z→Y^Z \to\hat{Y} edge so the input reaches the output only through the concept representations MjM_j (DE=0), which gives mediator-outcome ignorability by construction (App. § 11, Prop. 2). The concept encoder gθg_\theta is a multi-layer perceptron producing JJ concept representation vectors of dimension DD, each passed through a squash nonlinearity (Sabour et al., [55]) mapping each slot length to [0,1)[0, 1). The concept classification loss trains length as presence leaving the direction free to encode the concept’s context-based expression.

The concept classification loss drives inactive and active representations toward length zero and one, respectively. A zero concept vector representation carries a zero value vector in the attention head, so zeroing a concept removes its value contribution to Y^\hat{Y} regardless of its attention weight (Prop. 1).

Mediator model: Counterfactual concepts via a per-concept flow

Necessity asks whether the lack of a given concept’s representation results in a lack of that concept manifesting in the model’s outcome. In interventional mediation analysis, this is tested by replacing an inactive concept representation with an active one for the same input case. By definition, this is an unobservable counterfactual case. To overcome this, we reflect the approach of Vansteelandt and Daniel [ [73] and draw counterfactual mediator expressions from a mediator model learned from observational data. In our experiments, we invoke a per-concept invertible flow FψF_{\psi} to model mediator distributions p(Mj∣cj,X)p(M_j \mid c_j, X) and draw counterfactual examples where the concept label is flipped between present and not-present,

M~j∼Fψ(⋅∣1−cj,X).(1)\widetilde{M}_j \sim F_{\psi}(\cdot\mid1-c_j, X). \tag*{(1)}

We fit the flow by maximum likelihood to the encoder’s mediator representations after a warmup (§ 4.4, App. § 14, Algorithm 1). Our method is not specific to flow modeling. Any modeling approach may be chosen that best serves the domain.

Causal alignment criteria

Each causal alignment criterion (necessity, sufficiency, independence) is stated in terms of a change in the head output caused by an edit of a concept vector. Let 0\mathbf{0} be the all-zero concept vector, 0j←Mj\mathbf{0}_{j\leftarrow M_j} the all-zero vector with slot jj set to its realized value MjM_j, and Mj←M~jM_{j\leftarrow\widetilde{M}_j} the realized concepts MM with slot jj replaced by its counterfactual draw M~j\widetilde{M}_j (Eq. (1)). We define three changes:

Δ0=Y^−hϕ(0),Δj0=hϕ(0j←Mj)−hϕ(0),Δjcf=hϕ(Mj←M~j)−Y^.(2)\Delta^{0}=\widehat{Y}-h_{\phi}(\mathbf{0}),\qquad \Delta^{0}_{j}=h_{\phi}(\mathbf{0}_{j\leftarrow M_j})-h_{\phi}(\mathbf{0}),\qquad \Delta^{\mathrm{cf}}_{j}=h_{\phi}(M_{j\leftarrow\widetilde{M}_j})-\widehat{Y}. \tag*{(2)}

Δ0\Delta^{0} switches every concept slot on from 0\mathbf{0} to its realized value, Δj0\Delta^{0}_{j} switches slot jj alone on from 0\mathbf{0}, and Δjcf\Delta^{\mathrm{cf}}_{j} swaps slot jj for its counterfactual draw, keeping all other slots at their realized values. The subscript indicates the edited slot, and the superscript indicates the edit: switching slots on from 0\mathbf{0} (0) or swapping in a counterfactual draw from the mediator model (cf). In mediation analysis terms, the concept label flip in place of a treatment change gives Δjcf\Delta^{\mathrm{cf}}_{j} as the per-sample analog of the interventional indirect effect IEj\mathrm{IE}_j of § 3 and Δj0\Delta^{0}_{j} the analogous contrast of concept slot jj against zero with the other slots at zero (App. § 10). § 5.4 provides the estimator for the reported effects.

Each causal alignment loss is based on these quantities grounded on dataset labels cjc_j rather than on predicted concept presence. Below, we outline each causal alignment term with their formulations in Eq. (3).

Necessity. Inactive concepts should have no effect on the model’s output. Replacing an inactive concept slot jj with a counterfactual should not change the output such that Δjcf=0\Delta^{\mathrm{cf}}_{j}=0.

Sufficiency. Active concepts alone should produce the expert output: Starting from the all-zero output and adding each active concept’s separate contribution should produce the expert output, hϕ(0)+∑j:cj=1Δj0=Yh_{\phi}(\mathbf{0})+\sum_{j:c_j=1}\Delta^{0}_{j}=Y.

Independence. Concept representations should contribute additively: Each concept should contribute on its own, and the per-concept contributions should sum to the total, Δ0=∑jΔj0\Delta^{0}=\sum_j\Delta^{0}_{j}.

Presence (auxiliary). Since sufficiency constrains only the sum of concept representations, a subset of active concepts could carry all of the effect. To guard against that, we add an optional term that requires each active concept to carry at least an equal share β=1/∑jcj\beta=1/\sum_j c_j of the total, ∥Δj0∥≥β∥Δ0∥\lVert\Delta^{0}_{j}\rVert\geq\beta\lVert\Delta^{0}\rVert whenever cj=1c_j=1.

Lnec=E[∑j:cj=0∥Δjcf∥2],Lsuf=E[∥hϕ(0)+∑j:cj=1Δj0−Y∥2],\mathcal{L}_{\mathrm{nec}}=\mathbb{E}\left[\sum_{j:c_j=0}\lVert\Delta^{\mathrm{cf}}_{j}\rVert^2\right],\qquad \mathcal{L}_{\mathrm{suf}}=\mathbb{E}\left[\left\lVert h_{\phi}(\mathbf{0})+\sum_{j:c_j=1}\Delta^{0}_{j}-Y\right\rVert^2\right],
Lind=E[∥Δ0−∑jΔj0∥2],Lpres=E[∑j:cj=1max⁡(0,β∥Δ0∥−∥Δj0∥)2].(3)\mathcal{L}_{\mathrm{ind}}=\mathbb{E}\left[\left\lVert\Delta^{0}-\sum_j\Delta^{0}_{j}\right\rVert^2\right],\qquad \mathcal{L}_{\mathrm{pres}}=\mathbb{E}\left[\sum_{j:c_j=1}\max\left(0,\beta\lVert\Delta^{0}\rVert-\lVert\Delta^{0}_{j}\rVert\right)^2\right]. \tag*{(3)}

Training objective

We combine the four alignment losses into a single alignment term

Lalign=λnecLnec+λsufLsuf+λindLind+λpresLpres,(4)\mathcal{L}_{\mathrm{align}} = \lambda_{\mathrm{nec}}\mathcal{L}_{\mathrm{nec}} + \lambda_{\mathrm{suf}}\mathcal{L}_{\mathrm{suf}} + \lambda_{\mathrm{ind}}\mathcal{L}_{\mathrm{ind}} + \lambda_{\mathrm{pres}}\mathcal{L}_{\mathrm{pres}}, \tag*{(4)}

and train the wrapper by minimizing

Lwrap(θ,ϕ)=Ltask+λclsLcls+Lalign.(5)\mathcal{L}_{\mathrm{wrap}}(\theta,\phi) = \mathcal{L}_{\mathrm{task}} + \lambda_{\mathrm{cls}}\mathcal{L}_{\mathrm{cls}} + \mathcal{L}_{\mathrm{align}}. \tag*{(5)}

Ltask\mathcal{L}_{\mathrm{task}} is the supervised mean-squared error on Y^\hat{Y} (to the expert action for control, to the one-hot species label for CUB-200) and Lcls\mathcal{L}_{\mathrm{cls}} trains each concept slot’s vector length to predict its concept label. Training proceeds in three phases (Algorithm 1): warmup on Ltask\mathcal{L}_{\mathrm{task}} and Lcls\mathcal{L}_{\mathrm{cls}}, an intermission that fits the mediator model on the frozen encoder’s concepts, and alignment on the full objective, with optional mediator model refits at fixed intervals. Loss weights, schedules, and architecture details are in Apps. § 12–§ 14.

Empirical evaluation

We evaluate CCW-Net on three domains spanning control and perception: aircraft control, the CarRacing-v1 driving environment [7], and image classification on CUB-200 [77].

Tasks

Aircraft control. We evaluate on extended trail formation [70, 71], in which a chase aircraft maintains position behind a lead aircraft executing dynamic maneuvers. The simulator is a high-fidelity aircraft model with six degrees of freedom [22] where the lead aircraft follows a scripted trajectory and the chase aircraft is governed by a reinforcement learning policy trained by proximal policy optimization [59] using the aircraft environment and codebase of So and Fan [ [64]. The action space is two-dimensional (pitch and roll commands). Concept labels are J=4J = 4 binary attributes (Lead pursuit, Lag pursuit, Climb, Dive) drawn from operational pilot vocabulary [70, 71]. Pursuit (Lead pursuit, Lag pursuit) and vertical (Climb, Dive) maneuver concept pairs are mutually exclusive, so exactly two concepts are active per sample. Full task details are in Appendix § 15.§ 1.

CarRacing. We evaluate on the CarRacing-v1 environment [7], in which a pixel-input agent drives a car around a track. The frozen backbone is a CNN policy trained end-to-end on the task. Its latents, actions, and concept labels come from a CW-Net test domain [29]. The action space is continuous steering, throttle, and brake. Concept labels are J=3J = 3 binary attributes (Left, Right, Straight). The concepts are mutually exclusive and exhaustive, so exactly one concept is active per sample and the presence threshold is β=1\beta= 1. Full task details are in Appendix § 15.§ 2.

CUB-200 classification. We evaluate on the CUB-200-2011 dataset of 200 bird species [77]. The frozen backbone is an Inception-v3 image classifier fine-tuned on CUB. Concept labels are J=112J = 112 binary visual attributes (e.g., “has yellow belly”, “has pointed beak”) and the wrapper output is a 200-way classification. Full task details are in Appendix § 15.§ 3.

Baselines

Same-architecture, no alignment. We compare CCW-Net against the same encoder and head trained without the alignment losses (only Ltask\mathcal{L}_{\mathrm{task}} and Lcls\mathcal{L}_{\mathrm{cls}} active). This isolates the contribution of the causal alignment objective from the contribution of the encoder architecture.

Concept Wrapper Network variants. On the aircraft and CarRacing tasks we compare against the Concept Wrapper Network (CW-Net) of Kenny et al. [ [29], using the authors’ architecture. CW-Net wraps a frozen backbone with a concept layer in the same spirit as CCW-Net, but implements a different architecture, represents each concept as a scalar, and trains without causal alignment. Appendix § 16 adds CW-Net variants trained with alignment and, on CarRacing, with vector concepts.

Concept bottleneck model. For CUB-200 we compare against the concept bottleneck model of Koh et al. [ [33], which trains a model to predict concepts and to derive the task output through them.

Disentanglement-based concept learning. To support the secondary claim that disentanglement does not imply causal alignment, we compare against β\beta-TCVAE [9] and iVAE [30] on the aircraft and CarRacing tasks, reporting DCI [15] alongside the concept effect fractions (Appendix § 16).

Ablations

We run five ablation types on the control domains: (i) loss combinations where subsets of the four alignment losses are disabled to test each one’s contribution, (ii) concept representation dimension with D=16D = 16 default, D=1D = 1 scalar, and D=8D = 8, (iii) data quantity for aircraft ranging from 5K to 5M samples, (iv) label quality as fraction of data labeled with concepts and injected label noise, and (v) concept ontology where we remove concepts, merge concepts, and add a placebo concept. The full ablation matrix is in Appendix § 16. The CUB-200 models train without the alignment losses and compare architectures (§ 5.5.3).

Evaluation methodology

We report task performance (mean-squared error for action regression), concept accuracy against data labels, DCI [15], and the causal effect each concept has on the model’s output. All values are means over ten seeds with two-sided 95% Student-tt intervals. The primary metrics in this study are causal effects.

Causal attribution. To test whether a model’s concept representations carry only their own effects, we estimate interventional indirect effects [73, 37] from held-out observational data, using no mediator model, no zero reference 0, and none of the training losses. The approach applies to any model whose output is a function of its concept representations. We use it on CCW-Net, CW-Net, and the disentanglement baselines.

Each comparison takes two sets of test inputs, AA and BB, whose concept labels differ where an active concept in AA is replaced in BB by a mutually exclusive alternative with all other labels unchanged. For a test input ii, we draw matches from AA and BB by Gaussian-kernel matching on z-scored features zz (raw inputs or for image inputs, backbone features f(X)f(X)). A test input i′≠ii' \ne i is sampled with probability proportional to exp⁡(−dii′2/2τ2)\exp(-d_{ii'}^{2}/2\tau^{2}) among those within a radius of ii, where dii′d_{ii'} is the root-mean-square distance between ziz_i and zi′z_{i'} and τ\tau is the kernel bandwidth. If none are within the radius, we take the nearest neighbor. The matches’ concepts gθ(f(Xi′))g_\theta(f(X_{i'})) fill the concept slots. The two slots whose labels differ form one group, so every hybrid has a label combination that occurs in the data, and every other slot is a group of its own. We then build hybrid concept vectors taking each group of concept mediator representation slots from the AA or the BB match, and pass them through the trained head hϕh_\phi. Group GG’s effect is the change in output when it switches from its AA match to its BB match,

IEG=Ei,π[hϕ(Mπ<GB,MGB,Mπ>GA)−hϕ(Mπ<GB,MGA,Mπ>GA)],(6)\mathrm{IE}_{G} = \mathbb{E}_{i,\pi}\left[h_{\phi}\left(M_{\pi<G}^{B}, M_{G}^{B}, M_{\pi>G}^{A}\right) - h_{\phi}\left(M_{\pi<G}^{B}, M_{G}^{A}, M_{\pi>G}^{A}\right)\right], \tag*{(6)}

where MGAM_{G}^{A} (MGBM_{G}^{B}) are group GG’s slots from an AA (BB) match, drawn independently for each group, and likewise for the groups π<G\pi< G (π>G\pi> G) before (after) GG in an ordering π\pi. Averaging over all orderings makes IEG\mathrm{IE}_{G} equal the Shapley value for the switch from AA to BB, and ii runs over the inputs of both sets. Estimator details are in App. § 13.

For each label combination (rows in Table 1 and Table 2), slot jj’s effect ∥IEj∥\|\mathrm{IE}_{j}\| is the norm of its own group’s effect in the comparisons that keep jj’s label fixed, i.e., how far slot jj moves the output when another concept changes. The fractions of the effect that slot jj, the active concepts, and the inactive concepts carry are

Label combinationLeadLagClimbDiveAll Active ↑All Inactive ↓
CCW-Net (Ours)
tMSE 0.125 ±0.001; concept acc. 95.7 ±0.1 / 99.3 ±0.0; DCI 0.999 ±0.001 / 0.719 ±0.041 / 0.975 ±0.001
Lead+Climb62.8 ±16.14.6 ±1.932.0 ±16.10.6 ±0.494.8 ±2.15.2 ±2.1
Lead+Dive69.2 ±15.75.4 ±2.91.0 ±0.524.4 ±16.093.6 ±3.36.4 ±3.3
Lag+Climb4.3 ±2.360.5 ±13.234.5 ±13.50.7 ±0.495.0 ±2.55.0 ±2.5
Lag+Dive4.9 ±2.467.8 ±13.01.1 ±0.626.2 ±13.394.0 ±2.66.0 ±2.6
CCW-Net, no causal alignment losses
tMSE 0.124 ±0.001; concept acc. 95.7 ±0.1 / 99.3 ±0.0; DCI 0.999 ±0.000 / 0.746 ±0.037 / 0.975 ±0.001
Lead+Climb63.7 ±21.09.5 ±6.025.0 ±16.31.8 ±2.088.7 ±7.211.3 ±7.2
Lead+Dive64.8 ±20.09.6 ±5.64.1 ±3.921.5 ±14.086.3 ±6.813.7 ±6.8
Lag+Climb8.0 ±2.862.6 ±16.927.3 ±15.62.0 ±2.089.9 ±3.710.1 ±3.7
Lag+Dive8.5 ±4.363.4 ±17.95.2 ±6.322.9 ±14.686.3 ±6.313.7 ±6.3
CW-Net [29]
tMSE 0.122 ±0.002; concept acc. 91.2 ±0.2 / 98.2 ±0.1; DCI 0.998 ±0.001 / 0.719 ±0.064 / 0.947 ±0.001
Lead+Climb30.5 ±11.841.0 ±11.010.6 ±4.517.8 ±10.641.2 ±12.758.8 ±12.7
Lead+Dive25.2 ±11.231.4 ±8.617.3 ±6.626.0 ±9.851.3 ±6.348.7 ±6.3
Lag+Climb31.5 ±13.238.8 ±13.211.5 ±4.718.2 ±8.450.3 ±13.049.7 ±13.0
Lag+Dive26.1 ±13.128.2 ±9.218.3 ±6.527.4 ±8.555.6 ±14.144.4 ±14.1

Table 1. Aircraft control: fraction of the effect each concept carries (Eq. (7)), per concept label combination, estimated as in § 5.4. Active concepts are in bold. All Active and All Inactive are ρactive\rho_{\mathrm{active}} and ρinactive\rho_{\mathrm{inactive}}. Each block’s header gives the model’s test action MSE (tMSE), concept accuracy on the Lead/Lag and Climb/Dive concept sets (%), and DCI disentanglement / completeness / informativeness. Means over ten seeds with two-sided 95% Student-tt intervals. CCW-Net shows superior causal effect routing through active concepts compared to prior art.

Label combinationStraightLeftRightAll Active ↑All Inactive ↓
CCW-Net (Ours)
tMSE 0.0419 ±0.0005; concept acc. 92.6 ±0.4; DCI 0.863 ±0.023 / 0.863 ±0.023 / 0.943 ±0.005
Straight98.1 ±1.11.3 ±0.90.5 ±0.498.1 ±1.11.9 ±1.1
Left25.2 ±7.074.5 ±7.00.3 ±0.274.5 ±7.025.5 ±7.0
Right23.5 ±5.80.7 ±0.475.8 ±5.875.8 ±5.824.2 ±5.8
CCW-Net, no causal alignment losses
tMSE 0.0419 ±0.0006; concept acc. 92.4 ±0.4; DCI 0.850 ±0.021 / 0.851 ±0.021 / 0.944 ±0.005
Straight95.4 ±3.33.5 ±2.51.2 ±0.995.4 ±3.34.6 ±3.3
Left26.2 ±9.273.2 ±9.40.6 ±0.373.2 ±9.426.8 ±9.4
Right24.5 ±7.51.7 ±1.073.9 ±7.973.9 ±7.926.1 ±7.9
CW-Net [29]
tMSE 0.0015 ±0.0007; concept acc. 90.0 ±1.3; DCI 0.078 ±0.063 / 0.626 ±0.082 / 0.928 ±0.008
Straight33.2 ±1.737.4 ±7.429.4 ±6.833.2 ±1.766.8 ±1.7
Left33.7 ±11.032.9 ±1.433.4 ±10.432.9 ±1.467.1 ±1.4
Right29.7 ±7.037.3 ±6.533.1 ±2.133.1 ±2.166.9 ±2.1

Table 2. CarRacing: fraction of the effect each concept carries (Eq. (7)), per concept label combination, estimated as in § 5.4. Active concepts are in bold. All Active and All Inactive are ρactive\rho_{\mathrm{active}} and ρinactive\rho_{\mathrm{inactive}}. Each block’s header gives the model’s test action MSE (tMSE), concept accuracy on the Straight/Left/Right concept set (%), and DCI disentanglement / completeness / informativeness. Means over ten seeds with two-sided 95% Student-t intervals. CCW-Net shows superior causal effect routing through active concepts compared to prior art.

ρj=∥IEj∥∑k∥IEk∥,ρactive=∑j:cj=1ρj,ρinactive=∑j:cj=0ρj=1−ρactive.(7)\rho_j = \frac{\|\mathrm{IE}_j\|}{\sum_k \|\mathrm{IE}_k\|}, \qquad\rho_{\mathrm{active}} = \sum_{j:c_j=1} \rho_j, \qquad\rho_{\mathrm{inactive}} = \sum_{j:c_j=0} \rho_j = 1 - \rho_{\mathrm{active}}. \tag*{(7)}

Inactive concepts should carry no effect, so a faithful model has ρinactive\rho_{\mathrm{inactive}} near zero.

On CUB-200, we report a separate per-input evaluation. Its 112 attribute labels are assigned per species and have no mutually exclusive alternatives within the dataset, so the comparisons above, which hold all other labels fixed, cannot be formed with enough test inputs. Instead, each concept in turn is set to absent (the zero slot for CCW-Net, concept probability 0 for CBM), ρj\rho_j is its share of the summed output changes at each test input, and we average over the test split. This uses the zero reference, but no CUB-200 model is trained with the alignment losses, so it reuses no optimized terms.

Results

Aircraft control

Table 1 reports, for each concept label combination, the fraction of the effect each concept representation mediator carries. CCW-Net (concept representation dimension D=16D = 16) routes 94.5±2.2%94.5 \pm2.2\% of the effect through the active concepts, versus 88.1±4.3%88.1 \pm4.3\% trained without the causal alignment losses maintaining comparable task error and concept accuracy. CW-Net predicts its concepts nearly as accurately (91.2%91.2\% and 98.2%98.2\% on the two mutually exclusive concept sets), yet its active concepts carry only 50.0±6.2%50.0 \pm6.2\% of the effect. This is the fraction expected if the effect were spread indiscriminately across the four concepts. This suggests accurate concept prediction alone does not make the model’s outcomes depend on them. We find DCI disentanglement is at its ceiling of 1 for every model in Table 1 suggesting that disentanglement metrics may be insufficient to imply causal relationships between representation and model outcomes. The disentanglement baseline iVAE reaches DCI disentanglement, completeness and informativeness of 1.000, 0.891 and 1.000, yet its active concepts carry only 47.6±2.4%47.6 \pm2.4\% of the effect (App. § 16.§ 1).

CarRacing

Table 2 reports the same for CarRacing, where one of the three concepts is active in each label combination. CCW-Net (concept representation dimension D=1D = 1) routes 89.8±2.5%89.8 \pm2.5\% of the effect through the active concept, versus 87.5±4.9%87.5 \pm4.9\% trained without the causal alignment losses at same task error and comparable concept accuracy, so on CarRacing the architecture accounts for most of the causal routing. While CW-Net reaches lower task error than CCW-Net, both policies were able to complete the task upon visual inspection. While both approaches predict their concepts nearly as accurately (92.6 ± 0.4% and 92.4 ± 0.4% vs 90.0 ± 1.3%) CW-Net’s active concept carries only 33.1 ± 1.6% of the effect, the fraction expected if the effect were spread indiscriminately across the three concepts.

CUB-200

Table 3 reports CUB-200. Neither CCW-Net nor CBM is trained with the causal alignment losses, so this is a comparison that isolates the architecture. CCW-Net (concept representation dimension D=1D = 1) routes 91.3 ± 0.3% of the effect through active concepts, versus 41.6 ± 0.6% for CBM with both predicting their concepts accurately (99.6 ± 0.0% and 97.7 ± 0.1%). More than half of CBM’s effect (58.4 ± 0.6%) is attributed to concepts labeled absent. Similar to the above studies, accurate concept prediction alone does not make the model’s outcomes depend on the active concepts. In CCW-Net, a zeroed concept vector carries a zero key and zero value in the attention head, so setting a concept to absent removes its contribution to the outcome Y^\hat{Y} (Prop. 1).

Robustness and ablation

We performed ablation studies on the control domains: aircraft control and CarRacing. Full results are in Table 8 and Table 9 (App. § 16).

Table 8: Aircraft control: full ablation matrix. tMSE is the test action MSE, and concept accuracy is on the Lead/Lag and Climb/Dive concept sets (%). With a placebo concept added, the placebo carries 36.2±11.4%36.2 \pm11.4\% of the effect at width 256, and 28.2±9.8%28.2 \pm9.8\% with and 98.2±2.9%98.2 \pm2.9\% without the alignment losses at width 64.

ModeltMSEConcept acc. (%) Lead/LagConcept acc. (%) Climb/DiveConcept Effect (%) All Active ↑\uparrowConcept Effect (%) All Inactive ↓\downarrowDCI DisentanglementDCI CompletenessDCI Informativeness
Ours
CCW-Net (Ours, 500K samples)0.123±0.0010.123 \pm0.00196.4±0.196.4 \pm0.199.5±0.099.5 \pm0.097.3±1.197.3 \pm1.12.7±1.12.7 \pm1.10.999±0.0010.999 \pm0.0010.748±0.0500.748 \pm0.0500.979±0.0000.979 \pm0.000
CCW-Net (Ours, 5M samples)0.120±0.0000.120 \pm0.00097.5±0.097.5 \pm0.099.7±0.099.7 \pm0.098.3±0.998.3 \pm0.91.7±0.91.7 \pm0.91.000±0.0001.000 \pm0.0000.780±0.0430.780 \pm0.0430.986±0.0000.986 \pm0.000
CCW-Net (Ours, scalar D=1D = 1)0.412±0.0030.412 \pm0.00396.2±0.196.2 \pm0.199.4±0.099.4 \pm0.069.9±11.269.9 \pm11.230.1±11.230.1 \pm11.20.998±0.0010.998 \pm0.0010.896±0.0650.896 \pm0.0650.978±0.0010.978 \pm0.001
No causal alignment losses
CCW-Net (D=16D = 16)0.123±0.0010.123 \pm0.00196.4±0.196.4 \pm0.199.5±0.099.5 \pm0.089.2±7.589.2 \pm7.510.8±7.510.8 \pm7.50.999±0.0000.999 \pm0.0000.703±0.0250.703 \pm0.0250.980±0.0000.980 \pm0.000
CCW-Net (scalar D=1D = 1)0.409±0.0020.409 \pm0.00296.1±0.196.1 \pm0.199.4±0.099.4 \pm0.070.8±11.970.8 \pm11.929.2±11.929.2 \pm11.90.996±0.0030.996 \pm0.0030.816±0.0890.816 \pm0.0890.978±0.0010.978 \pm0.001
Architecture baselines
CW-Net architecture, scalar + alignment0.233±0.0310.233 \pm0.03191.0±0.391.0 \pm0.398.2±0.198.2 \pm0.151.7±2.351.7 \pm2.348.3±2.348.3 \pm2.30.999±0.0010.999 \pm0.0010.624±0.0780.624 \pm0.0780.929±0.0040.929 \pm0.004
CW-Net (Kenny et al.)0.122±0.0020.122 \pm0.00291.2±0.291.2 \pm0.298.2±0.198.2 \pm0.150.0±6.250.0 \pm6.250.0±6.250.0 \pm6.20.998±0.0010.998 \pm0.0010.719±0.0640.719 \pm0.0640.947±0.0010.947 \pm0.001
Disentanglement baselines
β\beta-TCVAE (D=16D = 16)0.403±0.0040.403 \pm0.00450.5±0.850.5 \pm0.850.0±1.050.0 \pm1.046.2±7.646.2 \pm7.653.8±7.653.8 \pm7.60.072±0.0560.072 \pm0.0560.743±0.0240.743 \pm0.0240.791±0.0130.791 \pm0.013
iVAE (D=16D = 16)0.401±0.0020.401 \pm0.00252.5±8.852.5 \pm8.849.1±7.649.1 \pm7.647.6±2.447.6 \pm2.452.4±2.452.4 \pm2.41.000±0.0001.000 \pm0.0000.891±0.0510.891 \pm0.0511.000±0.0001.000 \pm0.000
Data quantity
5K samples0.378±0.0120.378 \pm0.01291.7±0.391.7 \pm0.398.0±0.498.0 \pm0.477.2±8.477.2 \pm8.422.8±8.422.8 \pm8.40.981±0.0100.981 \pm0.0100.718±0.0560.718 \pm0.0560.954±0.0090.954 \pm0.009
50K samples0.133±0.0030.133 \pm0.00394.6±0.194.6 \pm0.199.0±0.099.0 \pm0.092.0±3.092.0 \pm3.08.0±3.08.0 \pm3.00.992±0.0030.992 \pm0.0030.740±0.0460.740 \pm0.0460.967±0.0020.967 \pm0.002
Label fraction
10% labels0.125±0.0010.125 \pm0.00195.2±0.195.2 \pm0.199.2±0.099.2 \pm0.093.3±5.193.3 \pm5.16.7±5.16.7 \pm5.10.999±0.0010.999 \pm0.0010.723±0.0310.723 \pm0.0310.972±0.0000.972 \pm0.000
25% labels0.124±0.0010.124 \pm0.00195.8±0.195.8 \pm0.199.4±0.099.4 \pm0.097.0±1.497.0 \pm1.43.0±1.43.0 \pm1.40.998±0.0010.998 \pm0.0010.722±0.0560.722 \pm0.0560.976±0.0000.976 \pm0.000
50% labels0.124±0.0010.124 \pm0.00196.1±0.196.1 \pm0.199.4±0.099.4 \pm0.095.2±3.395.2 \pm3.34.8±3.34.8 \pm3.30.999±0.0000.999 \pm0.0000.743±0.0520.743 \pm0.0520.978±0.0000.978 \pm0.000
Label noise
10% noise0.121±0.0000.121 \pm0.00096.2±0.196.2 \pm0.199.4±0.099.4 \pm0.071.6±8.071.6 \pm8.028.4±8.028.4 \pm8.01.000±0.0001.000 \pm0.0000.773±0.0310.773 \pm0.0310.978±0.0000.978 \pm0.000
20% noise0.121±0.0010.121 \pm0.00195.7±0.195.7 \pm0.199.3±0.099.3 \pm0.066.1±8.366.1 \pm8.333.9±8.333.9 \pm8.30.999±0.0020.999 \pm0.0020.861±0.0470.861 \pm0.0470.975±0.0000.975 \pm0.000
Loss combinations (without P)
N0.123±0.0010.123 \pm0.00196.4±0.196.4 \pm0.199.5±0.099.5 \pm0.091.9±7.891.9 \pm7.88.1±7.88.1 \pm7.80.998±0.0010.998 \pm0.0010.746±0.0230.746 \pm0.0230.979±0.0000.979 \pm0.000
S0.123±0.0010.123 \pm0.00196.4±0.196.4 \pm0.199.5±0.099.5 \pm0.093.8±4.393.8 \pm4.36.2±4.36.2 \pm4.30.998±0.0010.998 \pm0.0010.711±0.0350.711 \pm0.0350.979±0.0000.979 \pm0.000
I0.123±0.0010.123 \pm0.00196.4±0.196.4 \pm0.199.5±0.099.5 \pm0.092.3±5.092.3 \pm5.07.7±5.07.7 \pm5.00.999±0.0010.999 \pm0.0010.684±0.0290.684 \pm0.0290.979±0.0000.979 \pm0.000
N+S0.123±0.0010.123 \pm0.00196.4±0.196.4 \pm0.199.5±0.099.5 \pm0.096.4±1.396.4 \pm1.33.6±1.33.6 \pm1.30.998±0.0010.998 \pm0.0010.734±0.0430.734 \pm0.0430.980±0.0010.980 \pm0.001
ModeltMSELead/LagClimb/DiveAll Active ↑All Inactive ↓DisentanglementCompletenessInformativeness
N+I0.123±0.0010.123 \pm0.00196.4±0.196.4 \pm0.199.5±0.099.5 \pm0.094.9±4.994.9 \pm4.95.1±4.95.1 \pm4.90.998±0.0010.998 \pm0.0010.715±0.0170.715 \pm0.0170.979±0.0000.979 \pm0.000
S+I0.123±0.0000.123 \pm0.00096.4±0.196.4 \pm0.199.5±0.099.5 \pm0.094.7±2.994.7 \pm2.95.3±2.95.3 \pm2.90.998±0.0010.998 \pm0.0010.703±0.0280.703 \pm0.0280.979±0.0000.979 \pm0.000
N+S+I0.123±0.0010.123 \pm0.00196.4±0.196.4 \pm0.199.5±0.099.5 \pm0.098.0±0.798.0 \pm0.72.0±0.72.0 \pm0.70.998±0.0010.998 \pm0.0010.714±0.0550.714 \pm0.0550.979±0.0000.979 \pm0.000
Loss combinations (with P)
P0.124±0.0010.124 \pm0.00196.4±0.196.4 \pm0.199.5±0.099.5 \pm0.093.0±3.193.0 \pm3.17.0±3.17.0 \pm3.10.998±0.0010.998 \pm0.0010.708±0.0560.708 \pm0.0560.979±0.0000.979 \pm0.000
N+P0.123±0.0010.123 \pm0.00196.4±0.196.4 \pm0.199.5±0.099.5 \pm0.093.3±6.093.3 \pm6.06.7±6.06.7 \pm6.00.998±0.0020.998 \pm0.0020.747±0.0330.747 \pm0.0330.980±0.0000.980 \pm0.000
S+P0.123±0.0010.123 \pm0.00196.4±0.196.4 \pm0.199.5±0.099.5 \pm0.093.1±3.993.1 \pm3.96.9±3.96.9 \pm3.90.998±0.0010.998 \pm0.0010.720±0.0410.720 \pm0.0410.979±0.0000.979 \pm0.000
I+P0.124±0.0010.124 \pm0.00196.4±0.196.4 \pm0.199.5±0.099.5 \pm0.089.5±4.989.5 \pm4.910.5±4.910.5 \pm4.90.999±0.0010.999 \pm0.0010.699±0.0310.699 \pm0.0310.979±0.0000.979 \pm0.000
N+S+P0.124±0.0010.124 \pm0.00196.4±0.196.4 \pm0.199.5±0.099.5 \pm0.094.8±3.294.8 \pm3.25.2±3.25.2 \pm3.20.998±0.0010.998 \pm0.0010.750±0.0690.750 \pm0.0690.979±0.0000.979 \pm0.000
N+I+P0.124±0.0010.124 \pm0.00196.4±0.196.4 \pm0.199.5±0.099.5 \pm0.094.4±5.594.4 \pm5.55.6±5.55.6 \pm5.50.999±0.0010.999 \pm0.0010.757±0.0490.757 \pm0.0490.979±0.0000.979 \pm0.000
Concept ontology, merged concepts
Merge Climb+Dive0.122±0.0000.122 \pm0.00096.4±0.196.4 \pm0.155.6±0.055.6 \pm0.097.4±1.197.4 \pm1.12.6±1.12.6 \pm1.10.823±0.0950.823 \pm0.0950.573±0.0470.573 \pm0.0470.842±0.0070.842 \pm0.007
Merge Lead+Lag0.121±0.0010.121 \pm0.00141.4±0.041.4 \pm0.099.5±0.099.5 \pm0.095.6±5.195.6 \pm5.14.4±5.14.4 \pm5.10.885±0.0670.885 \pm0.0670.566±0.0410.566 \pm0.0410.833±0.0050.833 \pm0.005
Concept ontology, removed concepts
Remove Climb0.124±0.0010.124 \pm0.00196.4±0.196.4 \pm0.144.4±0.044.4 \pm0.093.9±1.593.9 \pm1.56.1±1.56.1 \pm1.50.998±0.0010.998 \pm0.0010.764±0.0420.764 \pm0.0420.979±0.0000.979 \pm0.000
Remove Dive0.124±0.0010.124 \pm0.00196.4±0.196.4 \pm0.155.6±0.055.6 \pm0.094.6±3.894.6 \pm3.85.4±3.85.4 \pm3.80.999±0.0010.999 \pm0.0010.792±0.0420.792 \pm0.0420.980±0.0000.980 \pm0.000
Remove Lag0.123±0.0010.123 \pm0.00141.4±0.041.4 \pm0.099.4±0.099.4 \pm0.079.9±11.479.9 \pm11.420.1±11.420.1 \pm11.40.999±0.0010.999 \pm0.0010.750±0.0390.750 \pm0.0390.980±0.0000.980 \pm0.000
Remove Lead0.123±0.0010.123 \pm0.00158.6±0.058.6 \pm0.099.5±0.099.5 \pm0.085.9±12.085.9 \pm12.014.1±12.014.1 \pm12.00.998±0.0010.998 \pm0.0010.774±0.0490.774 \pm0.0490.980±0.0000.980 \pm0.000
Placebo
Placebo concept added0.123±0.0010.123 \pm0.00196.4±0.196.4 \pm0.199.5±0.099.5 \pm0.061.1±11.461.1 \pm11.438.9±11.438.9 \pm11.40.999±0.0010.999 \pm0.0010.770±0.0280.770 \pm0.0280.980±0.0000.980 \pm0.000
Encoder width 64
CCW-Net (Ours), D=16D = 160.125±0.0010.125 \pm0.00195.7±0.195.7 \pm0.199.3±0.099.3 \pm0.094.5±2.294.5 \pm2.25.5±2.25.5 \pm2.20.999±0.0010.999 \pm0.0010.719±0.0410.719 \pm0.0410.975±0.0010.975 \pm0.001
CCW-Net (Ours), D=8D = 80.125±0.0010.125 \pm0.00195.6±0.195.6 \pm0.199.3±0.099.3 \pm0.093.1±5.293.1 \pm5.26.9±5.26.9 \pm5.20.999±0.0000.999 \pm0.0000.717±0.0530.717 \pm0.0530.974±0.0010.974 \pm0.001
10% label noise0.121±0.0010.121 \pm0.00195.3±0.195.3 \pm0.199.2±0.099.2 \pm0.070.4±5.570.4 \pm5.529.6±5.529.6 \pm5.51.000±0.0001.000 \pm0.0000.762±0.0310.762 \pm0.0310.973±0.0000.973 \pm0.000
10% label noise, no alignment0.121±0.0000.121 \pm0.00095.3±0.195.3 \pm0.199.2±0.099.2 \pm0.059.6±12.259.6 \pm12.240.4±12.240.4 \pm12.21.000±0.0001.000 \pm0.0000.750±0.0400.750 \pm0.0400.973±0.0010.973 \pm0.001
Placebo concept added0.124±0.0010.124 \pm0.00195.6±0.195.6 \pm0.199.3±0.099.3 \pm0.067.0±10.867.0 \pm10.833.0±10.833.0 \pm10.80.999±0.0010.999 \pm0.0010.711±0.0430.711 \pm0.0430.975±0.0010.975 \pm0.001
Placebo concept added, no alignment0.121±0.0010.121 \pm0.00195.7±0.195.7 \pm0.199.4±0.099.4 \pm0.00.9±1.80.9 \pm1.899.1±1.899.1 \pm1.80.999±0.0010.999 \pm0.0010.685±0.0200.685 \pm0.0200.975±0.0010.975 \pm0.001

Table 8. continued

ModeltMSEConcept acc. (%)All Active ↑All Inactive ↓DisentanglementCompletenessInformativeness
Ours
CCW-Net (Ours, β=1.0\beta= 1.0)0.0025 ±0.000493.4 ±0.275.3 ±3.824.7 ±3.80.914 ±0.0150.706 ±0.0420.950 ±0.004
CCW-Net (Ours, scalar D=1D = 1)0.0420 ±0.000693.0 ±0.392.4 ±2.77.6 ±2.70.866 ±0.0210.866 ±0.0210.947 ±0.005
No causal alignment losses
CCW-Net (D=16D = 16)0.0032 ±0.000493.4 ±0.363.5 ±9.036.5 ±9.00.913 ±0.0110.680 ±0.0340.950 ±0.003
CCW-Net (scalar D=1D = 1)0.0419 ±0.000693.0 ±0.490.0 ±5.510.0 ±5.50.870 ±0.0120.871 ±0.0120.948 ±0.003
Architecture baselines
CW-Net architecture, scalar + alignment0.0276 ±0.008989.8 ±1.337.2 ±6.762.8 ±6.70.085 ±0.0610.560 ±0.0830.928 ±0.009
CW-Net (Kenny et al.)0.0015 ±0.000790.0 ±1.333.1 ±1.666.9 ±1.60.078 ±0.0630.626 ±0.0820.928 ±0.008
CW-Net architecture, D=16D = 16 + alignment0.0058 ±0.001592.3 ±0.552.2 ±2.947.8 ±2.90.763 ±0.0240.710 ±0.0210.938 ±0.005
CW-Net architecture, D=16D = 160.0004 ±0.000192.4 ±0.443.3 ±2.456.7 ±2.40.772 ±0.0310.678 ±0.0340.938 ±0.003
Disentanglement baselines
β\beta-TCVAE (D=1D = 1)0.0290 ±0.002431.0 ±7.637.9 ±8.162.1 ±8.10.026 ±0.0190.472 ±0.1320.890 ±0.014
β\beta-TCVAE (D=16D = 16)0.0293 ±0.000632.2 ±1.851.7 ±8.848.3 ±8.80.047 ±0.0120.813 ±0.0250.894 ±0.005
iVAE (D=1D = 1)0.0277 ±0.000932.4 ±13.039.0 ±7.061.0 ±7.00.022 ±0.0180.354 ±0.0790.897 ±0.009
iVAE (D=16D = 16)0.0191 ±0.001345.1 ±11.037.3 ±4.862.7 ±4.80.250 ±0.0660.689 ±0.0190.911 ±0.006
Label fraction
10% labels0.0026 ±0.000390.2 ±0.577.9 ±4.922.1 ±4.90.909 ±0.0110.675 ±0.0300.930 ±0.007
25% labels0.0030 ±0.000591.2 ±0.475.6 ±7.324.4 ±7.30.910 ±0.0120.684 ±0.0460.936 ±0.007
50% labels0.0032 ±0.000392.0 ±0.477.1 ±6.922.9 ±6.90.926 ±0.0230.681 ±0.0500.941 ±0.003
Label noise
10% noise0.0024 ±0.000292.3 ±0.361.8 ±9.338.2 ±9.30.923 ±0.0090.753 ±0.0490.944 ±0.004
20% noise0.0023 ±0.000191.7 ±0.444.9 ±8.355.1 ±8.30.885 ±0.0200.719 ±0.0440.940 ±0.005
Loss combinations (without P)
N0.0031 ±0.000493.2 ±0.277.2 ±6.122.8 ±6.10.923 ±0.0120.685 ±0.0340.948 ±0.004
ModeltMSEConcept acc. (%)
Concept Effect (%)DCI
All Active ↑\uparrowAll Inactive ↓\downarrowDisentanglementCompletenessInformativeness
S0.0025±0.00040.0025 \pm0.000493.4±0.293.4 \pm0.272.4±7.072.4 \pm7.027.6±7.027.6 \pm7.00.924±0.0100.924 \pm0.0100.676±0.0240.676 \pm0.0240.949±0.0030.949 \pm0.003
I0.0031±0.00020.0031 \pm0.000293.4±0.293.4 \pm0.263.9±8.363.9 \pm8.336.1±8.336.1 \pm8.30.919±0.0140.919 \pm0.0140.670±0.0290.670 \pm0.0290.950±0.0040.950 \pm0.004
N+S0.0025±0.00040.0025 \pm0.000493.4±0.393.4 \pm0.378.1±4.978.1 \pm4.921.9±4.921.9 \pm4.90.921±0.0140.921 \pm0.0140.725±0.0300.725 \pm0.0300.948±0.0040.948 \pm0.004
N+I0.0032±0.00040.0032 \pm0.000493.4±0.393.4 \pm0.376.1±2.276.1 \pm2.223.9±2.223.9 \pm2.20.917±0.0190.917 \pm0.0190.674±0.0410.674 \pm0.0410.948±0.0050.948 \pm0.005
S+I0.0026±0.00050.0026 \pm0.000593.2±0.393.2 \pm0.372.4±8.472.4 \pm8.427.6±8.427.6 \pm8.40.927±0.0090.927 \pm0.0090.695±0.0330.695 \pm0.0330.948±0.0020.948 \pm0.002
N+S+I0.0026±0.00020.0026 \pm0.000293.3±0.493.3 \pm0.474.2±4.174.2 \pm4.125.8±4.125.8 \pm4.10.926±0.0110.926 \pm0.0110.708±0.0230.708 \pm0.0230.950±0.0030.950 \pm0.003
Loss combinations (with P)
P0.0033±0.00050.0033 \pm0.000593.3±0.193.3 \pm0.171.9±8.971.9 \pm8.928.1±8.928.1 \pm8.90.919±0.0120.919 \pm0.0120.684±0.0290.684 \pm0.0290.950±0.0050.950 \pm0.005
N+P0.0030±0.00040.0030 \pm0.000493.2±0.293.2 \pm0.277.4±4.177.4 \pm4.122.6±4.122.6 \pm4.10.918±0.0120.918 \pm0.0120.682±0.0300.682 \pm0.0300.949±0.0040.949 \pm0.004
S+P0.0026±0.00040.0026 \pm0.000493.5±0.393.5 \pm0.375.2±5.975.2 \pm5.924.8±5.924.8 \pm5.90.922±0.0160.922 \pm0.0160.689±0.0340.689 \pm0.0340.950±0.0040.950 \pm0.004
I+P0.0031±0.00040.0031 \pm0.000493.5±0.393.5 \pm0.367.6±9.667.6 \pm9.632.4±9.632.4 \pm9.60.928±0.0090.928 \pm0.0090.726±0.0370.726 \pm0.0370.951±0.0040.951 \pm0.004
N+S+P0.0026±0.00040.0026 \pm0.000493.3±0.293.3 \pm0.277.7±5.677.7 \pm5.622.3±5.622.3 \pm5.60.922±0.0150.922 \pm0.0150.698±0.0380.698 \pm0.0380.948±0.0020.948 \pm0.002
N+I+P0.0031±0.00040.0031 \pm0.000493.3±0.393.3 \pm0.376.0±4.776.0 \pm4.724.0±4.724.0 \pm4.70.923±0.0110.923 \pm0.0110.699±0.0320.699 \pm0.0320.949±0.0030.949 \pm0.003
S+I+P0.0025±0.00040.0025 \pm0.000493.3±0.293.3 \pm0.276.2±3.576.2 \pm3.523.8±3.523.8 \pm3.50.927±0.0170.927 \pm0.0170.668±0.0430.668 \pm0.0430.950±0.0020.950 \pm0.002
Concept ontology, merged concepts
Merge Left+Right §0.0023±0.00020.0023 \pm0.000284.4±0.684.4 \pm0.656.9±9.956.9 \pm9.943.1±9.943.1 \pm9.90.625±0.0970.625 \pm0.0970.553±0.0470.553 \pm0.0470.920±0.0060.920 \pm0.006
Merge Straight+Left §0.0015±0.00030.0015 \pm0.000372.1±0.272.1 \pm0.295.7±2.595.7 \pm2.54.3±2.54.3 \pm2.50.629±0.0450.629 \pm0.0450.481±0.0270.481 \pm0.0270.842±0.0110.842 \pm0.011
Merge Straight+Right §0.0019±0.00020.0019 \pm0.000284.8±0.384.8 \pm0.390.1±7.290.1 \pm7.29.9±7.29.9 \pm7.20.538±0.0730.538 \pm0.0730.542±0.0390.542 \pm0.0390.909±0.0050.909 \pm0.005
Concept ontology, removed concepts
Remove Left0.0036±0.00030.0036 \pm0.000372.4±0.372.4 \pm0.371.1±9.171.1 \pm9.128.9±9.128.9 \pm9.10.796±0.0390.796 \pm0.0390.668±0.0390.668 \pm0.0390.945±0.0040.945 \pm0.004
Remove Right0.0049±0.00080.0049 \pm0.000885.1±0.385.1 \pm0.382.1±5.482.1 \pm5.417.9±5.417.9 \pm5.40.826±0.0400.826 \pm0.0400.652±0.0270.652 \pm0.0270.944±0.0060.944 \pm0.006
Remove Straight0.0085±0.00130.0085 \pm0.001335.0±0.135.0 \pm0.165.8±10.365.8 \pm10.334.2±10.334.2 \pm10.30.637±0.1140.637 \pm0.1140.688±0.0230.688 \pm0.0230.948±0.0040.948 \pm0.004
Placebo
Placebo concept added0.0055±0.00080.0055 \pm0.000893.2±0.293.2 \pm0.251.3±7.951.3 \pm7.948.7±7.948.7 \pm7.90.935±0.0120.935 \pm0.0120.701±0.0340.701 \pm0.0340.949±0.0040.949 \pm0.004
Encoder width 64
CCW-Net (Ours), D=16D = 160.0031±0.00020.0031 \pm0.000292.6±0.592.6 \pm0.571.9±5.771.9 \pm5.728.1±5.728.1 \pm5.70.921±0.0110.921 \pm0.0110.686±0.0310.686 \pm0.0310.945±0.0050.945 \pm0.005
CCW-Net (Ours), D=8D = 80.0037±0.00040.0037 \pm0.000492.7±0.492.7 \pm0.467.8±6.167.8 \pm6.132.2±6.132.2 \pm6.10.880±0.0100.880 \pm0.0100.673±0.0390.673 \pm0.0390.946±0.0040.946 \pm0.004

Table 9. CarRacing: full ablation matrix. tMSE is the test action MSE, and concept accuracy is on the Straight/Left/Right concept set (%). Every group except the last uses batch size 128 for the canonical, D=16D = 16 no-alignment, loss-combination, label-noise, and placebo rows and 32 for the other rows. The last group uses batch size 32. Every row with the presence loss uses β=1\beta= 1 except CCW-Net (Ours, scalar D=1D = 1) and the two CW-Net rows with alignment, which use β=0.5\beta= 0.5. For the Remove rows, the averages cover the label combinations with an active concept, since the removed concept’s own combination has none. § In the Merge rows, the estimator scores only the merged concept’s label combination, because the remaining combination has no comparison that holds the merged concept fixed. With a placebo concept added, the placebo carries 34.6±6.8%34.6 \pm6.8\% of the effect.

Label efficiency. Across both control domains, CCW-Net retains most of its causal faithfulness when concept supervision is increasingly sparse. For example, when only 10% of data is labeled with concepts, ρactive\rho_{\mathrm{active}} decreases by only 4.0 points on aircraft control (97.3% to 93.3%) and interestingly increases by 2.6 on CarRacing (75.3% to 77.9%). Both are within noise across seeds. We believe this is consistent with CCW-Net’s alignment losses and architecture providing strong enough inductive bias that dense labeling becomes less critical. These results are encouraging as they suggest that less labeling burden is required to retain comparable causal alignment results.

Label noise. We find that label noise has the opposite effect. 10% noise drops ρactive\rho_{\mathrm{active}} from 97.3% to 71.6% on aircraft control and from 75.3% to 61.8% on CarRacing while concept accuracy remains nearly unchanged (96.2% vs. 96.4% and 92.3% vs. 93.4%). This is an example where concept accuracy and architecture alone do not reflect causal faithfulness motivating the need for evaluation approaches such as ours to verify such claims.

Ontology misspecification. CCW-Net degrades gracefully when the ontology isn’t fully specified. Removing one concept from the aircraft ontology lowers ρactive\rho_{\mathrm{active}} to 79.9–94.6%, and merging two concepts leaves it at 95.6–97.4%. On CarRacing, removing one concept gives 65.8–82.1% and merging two gives 56.9–95.7%, against 75.3% for the full ontology.

Loss ablation. On aircraft control, removing the sufficiency or independence loss terms lowers ρactive\rho_{\mathrm{active}} from 97.3% to 94.4% and 94.8%, while removing the presence term does not (98.0%). On CarRacing, where one concept is active per input, necessity alone reaches 77.2%, comparable to 75.3% with all four losses, and presence alone reaches 71.9% against 63.5% without alignment. This suggests different domains benefit from the loss terms differently.

Vector versus scalar concepts. We find concept representation dimension D>1D > 1 allows the alignment losses flexibility to improve causal alignment. At D=16D = 16, alignment increases ρactive\rho_{\mathrm{active}} by 8.1 points on aircraft control and 11.8 points on CarRacing, while at D=1D = 1 the change is −0.9 and 2.4 points.

Conclusion

Concept-based explanations are useful to the extent that they causally drive the model’s outputs. We presented CCW-Net, the first formulation of multi-mediator interventional mediation analysis as a training objective for deep networks. We also introduced an evaluation method that quantifies the fraction of a model’s output effect concept explanations carry. CCW-Net wraps a frozen backbone model with a concept encoder and attention head, trained to satisfy three causal alignment criteria (necessity, sufficiency, and independence) with counterfactual concept representations drawn from a mediator model. CCW-Net’s causal claims concern the effect of concept activations and representations on model outcomes where effects in the data-generation process are left to future work.

Across aircraft control, CarRacing-v1, and CUB-200 image classification, CCW-Net routes more of its output’s effect through active concepts than concept bottleneck based approaches. The contribution combines two approaches: concept representations feeding an attention head in which absent concepts contribute zero value, isolating each concept’s contribution to the output, and causal alignment losses that strengthen this effect and improve consistency across seeds. On our aircraft control domain, CCW-Net routes 94.5 ± 2.2% of the effect through active concepts against 50.0 ± 6.2% for prior art. On CUB-200, the architecture alone routes 91.3% against 41.6% for CBM at comparable concept accuracy, suggesting that concept accuracy is not an indicator of causal faithfulness. iVAE achieves excellent DCI disentanglement metrics on aircraft control, yet its active concepts carry only 47.6% of the effect, suggesting disentanglement and causal alignment are different properties.

CCW-Net moves causal faithfulness from a property that is claimed by inspection to one that can be designed for, trained against, and measured by. Concept-based explanations become not merely interpretable but quantifiably causal thereby building a road toward verifiably trustworthy models in safety- and task-critical environments.

Acknowledgments and Disclosure of Funding

Research was sponsored by the Department of the Air Force Artificial Intelligence Accelerator and was accomplished under Cooperative Agreement Number FA8750-19-2-1000. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of the Department of the Air Force or the U.S. Government. The U.S. Government is authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation herein. The authors acknowledge the MIT SuperCloud and Lincoln Laboratory Supercomputing Center for providing HPC resources that have contributed to the research results reported within this paper. The authors declare no competing interests.

Variable dictionary

SymbolDefinition
Inputs and outputs
XXInput
YYExpert output
Y^\hat{Y}Wrapper output, hϕ(M)h_{\phi}(M)
cj∈{0,1}c_j \in\{0,1\}Concept label (1 = active)
Architecture
ffFrozen backbone
Z=f(X)Z = f(X)Backbone latent
gθg_{\theta}Concept encoder
hϕh_{\phi}Attention head
M=(M1,…,MJ)M = (M_1,\ldots,M_J)Concept representation
Mj∈RDM_j \in\mathbb{R}^{D}Concept jj’s representation (slot)
JJNumber of concepts
DDRepresentation dimension
Mediator model (Sec. 4.2)
Fψ\mathcal{F}_{\psi}Per-concept invertible flow
M~j\tilde{M}_jCounterfactual draw, M~j∼Fψ(⋅∣1−cj,X)\tilde{M}_j \sim\mathcal{F}_{\psi}(\cdot\mid1-c_j,X)
Lflow\mathcal{L}_{\mathrm{flow}}Flow negative log-likelihood
Mediation analysis (Sec. 3)
TE, DE, IETotal, direct, indirect effect
IEj\mathrm{IE}_jInterventional indirect effect of mediator jj
IEμ\mathrm{IE}_{\mu}Residual mediator interaction
Concept edits and changes (Sec. 4.3)
0\mathbf{0}All-zero concept representation
0j←Mj\mathbf{0}_{j\leftarrow M_j}0\mathbf{0} with slot jj set to MjM_j
Mj←M~jM_{j\leftarrow\tilde{M}_j}MM with slot jj set to M~j\tilde{M}_j
Δ0\Delta^{0}Change from zero, Y^−hϕ(0)\hat{Y}-h_{\phi}(\mathbf{0})
Δj0\Delta^{0}_{j}Slot jj’s change from zero, hϕ(0j←Mj)−hϕ(0)h_{\phi}(\mathbf{0}_{j\leftarrow M_j})-h_{\phi}(\mathbf{0})
Δjcf\Delta^{\mathrm{cf}}_{j}Slot jj’s counterfactual change, hϕ(Mj←M~j)−Y^h_{\phi}(M_{j\leftarrow\tilde{M}_j})-\hat{Y}
Losses and weights
Ltask\mathcal{L}_{\mathrm{task}}Task loss
Lcls\mathcal{L}_{\mathrm{cls}}Concept classification loss
Lnec,Lsuf,Lind\mathcal{L}_{\mathrm{nec}},\mathcal{L}_{\mathrm{suf}},\mathcal{L}_{\mathrm{ind}}Necessity, sufficiency, independence losses
Lpres\mathcal{L}_{\mathrm{pres}}Presence loss (auxiliary)
Lalign\mathcal{L}_{\mathrm{align}}Weighted sum of the alignment losses
Lwrap\mathcal{L}_{\mathrm{wrap}}Total wrapper loss
λcls,λnec,…,λpres\lambda_{\mathrm{cls}},\lambda_{\mathrm{nec}},\ldots,\lambda_{\mathrm{pres}}Loss weights
β\betaPresence threshold, 1/∑jcj1/\sum_j c_j
Evaluation (Sec. 5.4)
A,B\mathcal{A},\mathcal{B}Test-input sets of one comparison
ziz_iMatching features of input ii
dii′d_{ii'}Distance between ziz_i and zi′z_{i'}
τ\tauKernel bandwidth
G,πG,\piSlot group; group ordering
MGA,MGBM_G^{\mathcal{A}},M_G^{\mathcal{B}}Group GG’s slots from an A\mathcal{A} or B\mathcal{B} match
IEG\mathrm{IE}_GGroup GG’s effect
ρj\rho_jFraction of the effect slot jj carries
ρactive,ρinactive\rho_{\mathrm{active}},\rho_{\mathrm{inactive}}Fraction active, inactive concepts carry
Evaluation estimator (App. F)
ℓ,nℓ\ell,n_{\ell}Concept label combination, its test count
c,C(ℓ)c,C(\ell)Comparison, comparisons that include label combination ℓ\ell
GcswG_c^{\mathrm{sw}}Swapped pair of comparison cc

Table 4. Variable dictionary for CCW-Net.

SymbolDefinition
SSOne of the sets A,BA, B
i′i'Match of test input ii
KKNumber of matching features
ϵ\epsilonMatching radius
IEG(c)\mathrm{IE}_{G}^{(c)}Group G’s effect in comparison cc
Cj(ℓ)C_j^{(\ell)}Comparisons in C(ℓ)C^{(\ell)} with j∉Gcswj \notin G_c^{\mathrm{sw}}
Gc(j)G_c(j)Concept slot jj’s group in comparison cc
∥IEj∥(ℓ),ρj(ℓ)\lVert\mathrm{IE}_j \rVert^{(\ell)}, \rho_j^{(\ell)}Concept slot jj’s effect, fraction for label combination ℓ\ell
Λ\LambdaScored combinations with an active concept
ρˉactive,ρˉinactive\bar{\rho}_{\mathrm{active}}, \bar{\rho}_{\mathrm{inactive}}Test-count-weighted means over Λ\Lambda

Table 10.

Extended related work

In Section 2 we focused on the most directly relevant prior art for CCW-Net’s three contributions (a mediation-analysis training objective, an architecture for concept-level mediation analysis, and an evaluation method for concept-based causality claims). Here we position CCW-Net among causal concept bottleneck models and causal abstraction methods, and discuss adjacent research operating at different levels (input, environment-state, policy, trajectory) or in adjacent approaches.

Causal concept bottleneck models and causal abstraction

Concept bottleneck models differ in how concepts reach and produce the model’s output. In flat bottlenecks, every concept is a direct parent of the output. Laguna et al. [ [34] make pretrained black boxes intervenable, fine-tuning them such that concept interventions improve their predictions. Ismail et al. [ [26] insert a concept bottleneck into generative models to steer generation toward human-interpretable concepts. Dominici et al. [ [14] extend concept bottleneck models to predict how concepts would need to change to produce an alternative prediction. These works use concept interventions to improve or steer predictions. CCW-Net instead trains and measures how much of a model’s output is attributed to each concept. Concept graph models [[11, 13]] let some concepts be parents of others rather than of the output, allowing for a deeper, more intricate concept graph. Driving and measuring the causal relationship of each node in such a graph is a natural extension of our approach.

In the causal abstraction literature, interchange intervention training [[18]] trains a network so that interventions on aligned high-level variables produce the counterfactual outputs of a manually-specified causal model. Causal proxy models [[79]] train a proxy of a text classifier on counterfactual examples so that concept interventions simulate the classifier’s counterfactual behavior. CCW-Net needs neither a hand-specified causal model nor counterfactual input pairs. Its losses follow interventional mediation analysis [[73]], which also requires no causal ordering among the mediators. For measurement of causal effects, the causal concept effect (CaCE) of Goyal et al. [ [20] estimates the change in expected output when a concept is toggled, using a learned generative model of counterfactual inputs and averaging over all samples. CCW-Net trains for the property and measures it separately for active and inactive concepts.

Causal explanation in sequential decision-making

Several lines of work explain sequential decision-making policy behavior using causal frameworks at the environment-state, trajectory, or action level. Madumal et al. [ [41] introduce action-influence models that define a structural causal model over environment variables and agent actions and use them to produce contrastive explanations of RL policies. Kekić et al. [ [27] learn nonlinear causal reductions that map a high-dimensional RL system to a lower-dimensional SCM whose interventional behavior matches the original system. Nashed et al. [ [43] build a unified SCM framework for explaining the actions of MDP agents, and Gyevnar et al. [ [21] extend causal explanations to multi-agent settings. Bica et al. [ [6] explain expert sequential decision-making policies by learning rewards over what-if outcomes. Schulte and Poupart [ [60] examine when reinforcement learning benefits from causal reasoning. Verma and Srivastava [ [75] learn causally accurate models for autonomous assessment of black-box agents. These methods operate at the environment or policy level and do not impose causal structure on a learned concept representation. CCW-Net is complementary: it uses concept labels to shape the model’s own concept-to-output effects, without requiring an explicit environment SCM.

Causal methods in imitation and reinforcement learning training

Causal frameworks have also been incorporated into imitation learning and reinforcement learning training, distinct from post-hoc explanation. Ruan et al. [ [53] introduce causal imitation learning via inverse reinforcement learning to recover policies that respect causal structure in expert demonstrations. Li et al. [ [36] address confounding-robust deep RL via a causal approach to off-policy learning. Herlau and Larsen [ [23] learn causal variables and a policy by optimizing a mediation-analysis objective in which the treatment is the choice of policy, the mediator is a binary environment event, and the outcome is the return. These works apply causal reasoning at the policy or imitation level. CCW-Net applies causal reasoning at the concept level inside the policy, training the concept encoder to satisfy interventional necessity, sufficiency, and independence criteria.

Human-AI interaction, trust, and verification

Several lines of work motivate interpretable models in safety-critical settings from human-factors and verification perspectives. Sanneman and Shah [ [56], Sanneman et al. [ [57] characterize the role of explanations in supporting human situational awareness and the understanding-workload tradeoff in human-centered XAI. Sreedharan et al. [ [66] provide a planning perspective on explainable human-AI interaction. Sobrín-Hidalgo et al. [ [65] survey explanation generation for autonomous robots. Lyons et al. [ [39], Highland et al. [ [24] report empirical studies of trust and agent appropriateness in live-flight human-autonomy teaming. Omeiza et al. [ [44] survey explanation methods specific to autonomous driving. Verma and Shah [ [74], Mahmud et al. [ [42] consider verification and interpretability analysis of decision-making systems. CCW-Net sits within this broader effort: it produces explanations grounded in human-meaningful concepts and aligned with causal effects, supporting the verification, audit, and trust workflows these works study.

Connection to interventional mediation analysis

In this section, we connect CCW-Net’s method and alignment losses (§ 4.3) to interventional mediation analysis [73, 37], and state the attention head property that makes Mj=0M_j = 0 a valid reference (App. § 10.§ 1).

Interventional mediation analysis. Mediation analysis asks how much of a treatment’s effect on an outcome passes through each of several intermediate variables (i.e., the mediators). Following the notation of Vansteelandt and Daniel [ [73], we write YY for the outcome and M=(M1,…,MJ)M = (M_1,\ldots,M_J) for the mediators. M(a)M(a) denotes the mediator values under treatment aa, and Y(a,m)Y(a,m) denotes the outcome under treatment aa with the mediators set to mm. Changing the treatment from aa to a∗a^* has the total effect

TE=E[Y(a∗,M(a∗))−Y(a,M(a))].(8)\mathrm{TE} = \mathbb{E}[Y(a^*, M(a^*)) - Y(a, M(a))]. \tag*{(8)}

Vansteelandt and Daniel [ [73] measure the part of this effect that passes through a single mediator MjM_j with the interventional indirect effect

IEj=E[Y(a∗,Mj(a∗),M−j(a))−Y(a∗,Mj(a),M−j(a))].(9)\mathrm{IE}_j = \mathbb{E}[Y(a^*, M_j(a^*), M_{-j}(a)) - Y(a^*, M_j(a), M_{-j}(a))]. \tag*{(9)}

IEj\mathrm{IE}_j sets only MjM_j to its value under the new treatment and keeps every other mediator at its value under the original treatment. The direct effect DE=E[Y(a∗,M(a))−Y(a,M(a))]\mathrm{DE} = \mathbb{E}[Y(a^*, M(a)) - Y(a, M(a))] is the part of the effect that bypasses the mediators. Vansteelandt and Daniel [ [73] and Loh et al. [ [37] add a residual term IEμ\mathrm{IE}_\mu for the interactions among mediators. With it, the effects add up to the total without assuming any causal ordering or independence among the mediators,

TE=DE+∑j=1JIEj+IEμ.(10)\mathrm{TE} = \mathrm{DE} + \sum_{j=1}^{J}\mathrm{IE}_j + \mathrm{IE}_\mu. \tag*{(10)}

Mapping to CCW-Net. In CCW-Net, the concept representations MjM_j are the mediators and the head output Y^\hat{Y} is the outcome. As the concept representations serve as a bottleneck, the input reaches Y^\hat{Y} only through them with no direct pathway from input to output that bypasses the mediators, so DE =0= 0 (§ 4.1). Flipping concept jj’s label plays the role of the treatment change, and the flow turns this flip into the counterfactual draw M~j\tilde{M}_j (Eq. (1)). In the notation above, the treatment value is concept jj’s label, a=cja = c_j, and M~j\tilde{M}_j plays the role of Mj(a∗)M_j(a^*) with a∗=1−cja^* = 1 - c_j. With this mapping, two of the changes in § 4.3 correspond to IEj\mathrm{IE}_j.

  • Δjcf\Delta_j^{\mathrm{cf}} is the per-sample analog of IEj\mathrm{IE}_j. Like IEj\mathrm{IE}_j, it replaces MjM_j with its counterfactual value and keeps the other concept representations at their observed values.

  • Δj0\Delta_j^0 is the analog of IEj\mathrm{IE}_j measured from zero. It switches MjM_j on with every other concept representation at zero instead of at its observed value. Zero is a valid reference because hϕ(0)h_\phi(0) is a constant (Prop. 1).

What each loss enforces.

  • Necessity. Lnec\mathcal{L}_{\mathrm{nec}} drives Δjcf\Delta_j^{\mathrm{cf}} toward zero for concepts labeled inactive, so an inactive concept has no per-sample indirect effect on the output.

  • Sufficiency. Lsuf\mathcal{L}_{\mathrm{suf}} anchors hϕ(0)+∑j:cj=1Δj0h_\phi(0) + \sum_{j:c_j=1} \Delta_j^0 to the expert output YY. Since DE =0= 0, the active concepts’ contributions measured from zero should reproduce the expert output.

  • Independence. Lind\mathcal{L}_{\mathrm{ind}} drives Δ0−∑jΔj0\Delta^0 - \sum_j \Delta_j^0 toward zero. This residual plays the role of IEμ\mathrm{IE}_\mu in Eq. (10) for changes measured from zero, so driving it to zero makes the concept contributions add up.

Lpres\mathcal{L}_{\mathrm{pres}} is not part of the decomposition. It keeps a few active concepts from carrying the whole effect. Without it, sufficiency could be met overall while the individual contributions say little.

Zero value contribution of a zeroed concept

Zero can only serve as a reference if a zeroed concept representation contributes nothing to the output. Here we show that the attention head has this property, and we describe what zeroing a concept does to the other concepts’ attention weights.

Setup. The wrapper output Y^\hat{Y} is a vector indexed by rr. The head is a single-head attention layer with one learned query qrq_r per output. WQW_Q, WKW_K, WVW_V, and WOW_O are the head’s query, key, value, and output projections, all of which are bias-free, and wrw_r and brb_r are the weight and bias for output rr. We use jj, kk, and ll to index the JJ concept representations, where jj is the one intervened on, kk is any other, and ll is a summation index. For output rr, the head computes logits srj=(WQqr)TWKMj/Ds_{rj} = (W_Qq_r)^\mathsf{T}W_KM_j/\sqrt{D}, weights αrj=esrj/∑lesrl\alpha_{rj} = e^{s_{rj}}/\sum_l e^{s_{rl}}, context cr=∑lαrlWOWVMlc_r = \sum_l \alpha_{rl}W_OW_VM_l, and output Y^r=tanh⁡(wrTcr+br)\hat{Y}_r = \tanh(w_r^\mathsf{T}c_r + b_r).

Definition 1 (Zero value contribution). Concept jj’s value contribution to output rr is κrj(M)=αrj(M)WOWVMj\kappa_{rj}(M) = \alpha_{rj}(M)W_OW_VM_j. The head has zero value contribution if κrj(M)=0\kappa_{rj}(M) = 0 for every concept jj, every output rr, and every MM with Mj=0M_j = 0.

Proposition 1. (i) The head has zero value contribution, and its output at M=0M = 0 is the constant Y^r=tanh⁡(br)\hat{Y}_r = \tanh(b_r). (ii) A concept with Mj=0M_j = 0 keeps softmax weight αrj=1/Zr>0\alpha_{rj} = 1/Z_r > 0 with Zr=∑l≠jesrl+1Z_r = \sum_{l\ne j}e^{s_{rl}} + 1, so zeroing a concept is not the same as deleting it. (iii) Any single-concept intervention Mj→Mj′M_j \to M'_j rescales the other concepts’ weights by one common factor per output, αrk′=γrαrk\alpha'_{rk} = \gamma_r\alpha_{rk} for all k≠jk \ne j, with

γr=∑l≠jesrl+esrj∑l≠jesrl+esrj′.\gamma_r = \frac{\sum_{l\ne j}e^{s_{rl}} + e^{s_{rj}}}{\sum_{l\ne j}e^{s_{rl}} + e^{s'_{rj}}}.

For the zero intervention Mj′=0M'_j = 0, the denominator equals the ZrZ_r of (ii), and the effect on the context is exactly cr−cr′=κrj+(1−γr)(cr−κrj)c_r - c'_r = \kappa_{rj} + (1 - \gamma_r)(c_r - \kappa_{rj}).

Proof. (i) The projections are linear, so Mj=0M_j = 0 gives WVMj=0W_VM_j = 0 and hence κrj=αrjWOWVMj=0\kappa_{rj} = \alpha_{rj}W_OW_VM_j = 0 for every rr, whatever the value of αrj\alpha_{rj}. At M=0M = 0, every logit is 0, the weights are uniform, and cr=0c_r = 0, so Y^r=tanh⁡(br)\hat{Y}_r = \tanh(b_r). (ii) A zero key gives a zero logit rather than a zero weight, since e0=1e^0 = 1. Deleting the concept would instead give the denominator Zr−1Z_r - 1. (iii) Each logit depends only on its own concept, so the intervention changes only srjs_{rj}. For k≠jk \ne j, the ratio αrk′/αrk\alpha'_{rk}/\alpha_{rk} is the ratio of the two denominators, which does not depend on kk. The zeroed concept’s own term vanishes by (i), so c^r=γr(cr−κrj)\hat{c}_r = \gamma_r(c_r - \kappa_{rj}), which gives the identity.

In words, zeroing a concept removes its own value term exactly. Its attention weight stays positive, and the other concepts’ weights all scale by the same factor γr\gamma_r.

Relation to ignorability. Prop. 1 complements the ignorability condition in App. § 11. Ignorability (Prop. 2) handles confounding between the mediators and the outcome, Y^(m)⊥M∣X\hat{Y}(m) \perp M \mid X. Prop. 1 gives every intervention a zero reference that itself contributes no value to the output.

Causal assumptions

Identification assumptions for interventional effects

Both training and evaluation estimate interventional effects in the wrapper SCM

X→Z→M→Y^,X \to Z \to M \to\hat{Y},

where Z=f(X)Z = f(X), M=gθ(Z)M = g_\theta(Z), and Y^=hϕ(M)\hat{Y} = h_\phi(M) (Figure 2). Following Vansteelandt and Daniel [ [73] and Loh et al. [ [37], these effects are identified under the following standard conditions.

The CCW-Net wrapper SCM

Figure 2. The CCW-Net wrapper SCM. Every path from XX to Y^\hat{Y} passes through the concept representation MM, and there is no direct Z→Y^Z \to\hat{Y} edge. This gives mediator-outcome ignorability within the SCM (Prop. 2).

  • Ignorability. There is no unmeasured confounding of the mediator-outcome relation given XX, that is, Y^(m)⊥M∣X\hat{Y}(m) \perp M \mid X in the wrapper SCM. Prop. 2 shows that this holds by construction.

  • Positivity. For every xx in the support of XX, the conditional distribution p(Mj∣X=x)p(M_j \mid X = x) has support around the observed concept representations. This condition concerns the counterfactual draws that the mediator model supplies to the necessity loss during training. The zero reference used by the sufficiency and independence losses is instead defined by the architecture (Prop. 1), not a property that occurs in the data.

  • Overlap. In evaluation (§ 5.4), the mediator model is replaced with real data test inputs. For each test input ii, both sets A\mathcal{A} and B\mathcal{B} should contain inputs within a radius of ii, so that the matched concept representations come from comparable state configurations. When no input is within the radius, the estimator uses the nearest neighbor.

  • Consistency. For the realized concept representation M=mM = m, the observed Y^\hat{Y} equals Y^(m)\hat{Y}(m) under the head hϕh_\phi.

Under these conditions, the effects decompose as in Eq. (10), with IEμ\mathrm{IE}_\mu collecting the interactions that cannot be attributed to any single concept [37].

Model-level ignorability in the wrapper SCM

The ignorability condition above holds by construction in the wrapper SCM. The following proposition shows this holds even when the wrapper has stochastic exogenous inputs such as in stochastic policies or with dropout.

Proposition 2 (Model-level mediator-outcome ignorability). Consider the wrapper SCM with structural equations

Z=f(X,Uf),M=gθ(Z,Ug),Y^=hϕ(M,Uh),Z = f(X, U_f), \qquad M = g_\theta(Z, U_g), \qquad\hat{Y} = h_\phi(M, U_h),

where Uf,Ug,UhU_f, U_g, U_h are exogenous noise variables. Suppose:

  1. Uh⊥(X,Uf,Ug)U_h \perp(X, U_f, U_g), so the head’s noise is independent of everything upstream.

  1. All randomness used for counterfactual sampling from the mediator model FψF_\psi depends only on (X,Us)(X, U_s) with Us⊥UhU_s \perp U_h.

Then for every concept representation value mm in the support of M∣XM \mid X,

Y^(m)⊥M∣X.\hat{Y}(m) \perp M \mid X.

Hence the mediator-outcome ignorability required to identify IEj\mathrm{IE}_j, TE\mathrm{TE}, and IEμ\mathrm{IE}_\mu holds within the wrapper SCM.

Proof. For a fixed mm, the potential outcome Y^(m)=hϕ(m,Uh)\hat{Y}(m) = h_\phi(m, U_h) is a function of UhU_h alone. MM is a function of (X,Uf,Ug)(X, U_f, U_g), and UhU_h is independent of (X,Uf,Ug)(X, U_f, U_g) by assumption 1. Hence Y^(m)\hat{Y}(m) is independent of (X,M)(X, M), and in particular Y^(m)⊥M∣X\hat{Y}(m) \perp M \mid X. A counterfactual draw is a function of (X,Us)(X, U_s), and Us⊥UhU_s \perp U_h by assumption 2, so the same argument applies with the draw in place of MM. □

Architecture details

Concept encoder gθg_\theta

The concept encoder is a three-layer multi-layer perceptron with ReLU activations. It maps the backbone latent Z=f(X)Z = f(X) to JJ concept representations,

gθ(Z)=MLP⁡(Z)∈RJ×D.(11)g_\theta(Z) = \operatorname{MLP}(Z) \in\mathbb{R}^{J \times D}. \tag*{(11)}

The hidden width is 64 for the models in Table 1 and Table 2, and 256 for the CUB-200 models in Table 3 and the ablations in App. § 16 outside its last group. We use D=16D = 16 on aircraft control and D=1D = 1 on CarRacing and CUB-200, and the ablations in App. § 16 vary DD.

ModelConcept acc. (%)All Active ↑All Inactive ↓DisentanglementCompletenessInformativeness
CCW-Net (Ours)99.6 ±0.091.3 ±0.38.7 ±0.30.895 ±0.0070.936 ±0.0070.993 ±0.001
CBM97.7 ±0.141.6 ±0.658.4 ±0.60.732 ±0.0110.789 ±0.0110.985 ±0.001

Table 3. CUB-200: fraction of the effect the active concepts carry, per input (§ 5.4), averaged over the test split. CBM is the concept bottleneck model of Koh et al. [ [33]. No CUB-200 model is trained with the causal alignment losses. Concept accuracy is over the 112 attributes. Means over ten seeds with two-sided 95% Student-t intervals.

Each concept representation then passes through the capsule-style squash nonlinearity [55],

squash⁡(v)=∥v∥21+∥v∥2v∥v∥,(12)\operatorname{squash}(v) = \frac{\lVert v \rVert^2}{1 + \lVert v \rVert^2} \frac{v}{\lVert v \rVert}, \tag*{(12)}

applied to each of the JJ concepts separately. The squash bounds each representation’s length to [0,1)[0, 1), and the concept classification loss trains this length to cluster near 0 and 1 (avoiding the mid ranges) as the concept’s presence (§ 4.1).

Attention head hϕh_\phi

The head is a single-head attention layer with one learned query qr∈RDq_r \in\mathbb{R}^D per output rr. The concept representations M∈RJ×DM \in\mathbb{R}^{J \times D} serve as both keys and values. The query, key, value, and output projections WQ,WK,WV,WO∈RD×DW_Q, W_K, W_V, W_O \in\mathbb{R}^{D \times D} are all bias-free. For output rr, the head computes the context

cr=∑j=1JαrjWOWVMj,αrj=softmax⁡j((WQqr)⊤WKMjD).(13)c_r = \sum_{j=1}^{J} \alpha_{rj} W_O W_V M_j, \qquad\alpha_{rj} = \operatorname{softmax}_j\left(\frac{(W_Q q_r)^\top W_K M_j}{\sqrt{D}}\right). \tag*{(13)}

and the output

Y^r=tanh⁡(wrTcr+br),(14)\hat{Y}_r = \tanh(w_r^{\mathsf{T}}c_r + b_r), \tag*{(14)}

where wr∈RDw_r \in\mathbb{R}^{D} and br∈Rb_r \in\mathbb{R} are the weight and bias for output rr. Since the projections are bias-free, a zero concept representation produces a zero key and a zero value. It therefore contributes no value to crc_r, even though its attention weight stays positive (Prop. 1). On CUB-200, the tanh outputs of CCW-Net and the linear outputs of CBM are trained with the mean-squared error to the one-hot species label.

Per-concept invertible flow FψF_\psi

Our chosen mediator model is a conditional normalizing flow with one independent flow per concept. Any modeling approach may be used. Each flow is conditioned on the labels of concept jj’s mutually exclusive set, the input, and a learned vector identifying concept jj. For D>1D > 1, each flow is a stack of 8 affine coupling layers whose conditioner networks have hidden width 256. For D=1D = 1, a coupling layer cannot split the representation, so each flow is instead a stack of 8 conditional affine maps with hidden width 256. To draw a counterfactual for concept jj, we flip the labels of its set and sample from the flow conditioned on them and the input (Eq. (1)). The flow has its own optimizer (App. § 14) and is trained on the negative log-likelihood of the encoder’s concept representations.

Evaluation estimator

In short, we compare similar test inputs that differ in one concept and measure how much of the change in the model’s output passes through each concept’s representation (i.e., the fraction of change). The causal attribution estimator (§ 5.4) computes each reported fraction as follows. Let ℓ\ell index concept label combinations, nℓn_\ell be the number of test inputs with concept label combination ℓ\ell, and C(ℓ)\mathcal{C}(\ell) be the comparisons in which ℓ\ell forms one of the two sets A\mathcal{A} and B\mathcal{B} (test inputs with original and swapped concept labels). Each comparison cc swaps one active concept for a mutually exclusive alternative, so exactly two concept slots change labels. These two concept slots form one group, the swapped pair GcswG_c^{\mathrm{sw}}, and every other concept slot forms its own group.

Matching. We z-score the matching features z∈RKz \in\mathbb{R}^{K} (§ 5.4) over the test split. For a test input ii and a set S∈{A,B}S \in\{\mathcal{A},\mathcal{B}\}, a match i′∈Si' \in S is drawn with probability

p(i′∣i)∝exp⁡(−dii′2/2τ2)1[dii′≤ϵ]1[i′≠i],dii′=(1K∑k=1K(zik−zi′k)2)1/2,(15)p(i' \mid i) \propto\exp\left(-d_{ii'}^{2}/2\tau^{2}\right)\mathbb{1}[d_{ii'} \le\epsilon]\mathbb{1}[i' \ne i], \qquad d_{ii'} = \left(\frac{1}{K}\sum_{k=1}^{K}(z_{ik}-z_{i'k})^{2}\right)^{1/2}, \tag*{(15)}

with bandwidth τ=0.25\tau= 0.25 and radius ϵ=1.5\epsilon= 1.5. When no input of SS is within the radius, we take the nearest one. Each input receives 96 independently drawn matches for each group and set.

Comparisons. We form a comparison only when ∣A∣≥100|\mathcal{A}| \ge100 and ∣B∣≥100|\mathcal{B}| \ge100. For each concept label combination ℓ\ell, we fix one random subset of min⁡(nℓ,1000)\min(n_\ell, 1000) test inputs, and these inputs serve as ii in every comparison in C(ℓ)\mathcal{C}(\ell). Matches come from all test inputs of each set.

Group effects. IEG(c)\mathrm{IE}_{G}^{(c)} is Eq. (6) for comparison cc, averaged over the inputs, the drawn matches, and all orderings of the groups. We use the Euclidean norm ∥IEG(c)∥\|\mathrm{IE}_{G}^{(c)}\| of this averaged change in the model’s output.

Concept slot effects. For concept label combination ℓ\ell, let Cj(ℓ)={c∈C(ℓ):j∉Gcsw}\mathcal{C}_j(\ell) = \{c \in\mathcal{C}(\ell): j \notin G_c^{\mathrm{sw}}\} be the comparisons that keep concept slot jj outside the swapped pair, and let Gc(j)G_c(j) be concept slot jj’s group in comparison cc. Concept slot jj’s effect is

∥IEj∥(ℓ)={1∣Cj(ℓ)∣∑c∈Cj(ℓ)∥IEGc(j)(c)∥if Cj(ℓ)≠∅,1∣C(ℓ)∣∑c∈C(ℓ)∥IEGcsw(c)∥if Cj(ℓ)=∅ and cj=1.(16)\|\mathrm{IE}_j\|^{(\ell)} = \begin{cases} \frac{1}{|\mathcal{C}_j(\ell)|}\sum_{c\in\mathcal{C}_j(\ell)}\|\mathrm{IE}_{G_c(j)}^{(c)}\| & \text{if }\mathcal{C}_j(\ell)\ne\varnothing,\\[1.2em] \frac{1}{|\mathcal{C}(\ell)|}\sum_{c\in\mathcal{C}(\ell)}\|\mathrm{IE}_{G_c^{\mathrm{sw}}}^{(c)}\| & \text{if }\mathcal{C}_j(\ell)=\varnothing\text{ and }c_j=1. \end{cases} \tag*{(16)}

In the second case, concept slot jj is active and lies in the swapped pair of every comparison in C(ℓ)\mathcal{C}(\ell). In any other case, concept label combination ℓ\ell is not scored. The fractions ρj(ℓ)\rho^{(\ell)}_j, ρactive(ℓ)\rho^{(\ell)}_{\mathrm{active}}, and ρinactive(ℓ)\rho^{(\ell)}_{\mathrm{inactive}} then follow from Eq. (7).

Overall values. All Active and All Inactive weight the scored concept label combinations Λ\Lambda that have an active concept by their test counts,

ρˉactive=∑ℓ∈Λnℓρactive(ℓ)∑ℓ∈Λnℓ,ρˉinactive=1−ρˉactive,(17)\bar{\rho}_{\mathrm{active}} = \frac{\sum_{\ell\in\Lambda} n_{\ell}\rho^{(\ell)}_{\mathrm{active}}}{\sum_{\ell\in\Lambda} n_{\ell}}, \qquad\bar{\rho}_{\mathrm{inactive}} = 1-\bar{\rho}_{\mathrm{active}}, \tag*{(17)}

and we report their means over ten seeds with two-sided 95% Student-tt intervals.

Effect decomposition. The total effect, measured on the real matched inputs, equals the sum of the group effects plus a residual IEμ\mathrm{IE}_{\mu} (Eq. (10)), and this identity holds exactly. Here IEμ\mathrm{IE}_{\mu} is the difference between real inputs and hybrids whose groups come from independent matches.

Training details

Algorithm 1 outlines CCW-Net training. The wrapper (gθ,hϕ)(g_{\theta}, h_{\phi}) and the flow Fψ\mathcal{F}_{\psi} have separate optimizers. Training is conducted in three phases. During warmup, the wrapper learns the task and concept classification. During the intermission, the mediator model is fit to the encoder’s concept representations. During alignment, the wrapper trains on the full objective (§ 4.4), while the mediator model supplies the counterfactual draws for the necessity loss. The mediator model is refit every ErE_r epochs during alignment so that it remains current with the encoder. Since the CUB-200 models train without the alignment losses they remain in the warmup phase throughout.

Algorithm 1 CCW-Net training. pψp_{\psi} denotes the flow’s conditional density.

Require: Dataset D={(Xi,Yi,ci)}\mathcal{D} = \{(X_i, Y_i, c_i)\}, frozen backbone ff, warmup epochs EwE_w, total epochs EE, refit interval ErE_r, draws per concept SS

  1. Initialize encoder gθg_{\theta} and head hϕh_{\phi}

  2. for epoch =1,…,Ew= 1,\ldots,E_w do ▷ Warmup

  3. for batch (X,Y,c)∈D(X,Y,c) \in\mathcal{D} do

  4. M←gθ(f(X)),Y^←hϕ(M)M \leftarrow g_{\theta}(f(X)),\quad\hat{Y} \leftarrow h_{\phi}(M)

  5. Update (θ,ϕ)(\theta,\phi) on Ltask+λclsLcls\mathcal{L}_{\mathrm{task}}+\lambda_{\mathrm{cls}}\mathcal{L}_{\mathrm{cls}}

  6. end for

  7. end for

  8. Fit Fψ\mathcal{F}_{\psi} on Lflow=−E[∑jlog⁡pψ(Mj∣cj,X)]\mathcal{L}_{\mathrm{flow}}=-\mathbb{E}\left[\sum_j \log p_{\psi}(M_j\mid c_j,X)\right] with MM held fixed ▷ Intermission

  9. for epoch =Ew+1,…,E= E_w+1,\ldots,E do ▷ Alignment

  10. if ErE_r epochs have passed since the last fit then

  11. Refit Fψ\mathcal{F}_{\psi} on the current encoder’s concept representations

  12. end if

  13. for batch (X,Y,c)∈D(X,Y,c) \in\mathcal{D} do

  14. M←gθ(f(X)),Y^←hϕ(M)M \leftarrow g_{\theta}(f(X)),\quad\hat{Y} \leftarrow h_{\phi}(M)

  15. Draw SS counterfactuals M~j∼Fψ(⋅∣1−cj,X)\widetilde{M}_j \sim\mathcal{F}_{\psi}(\cdot\mid1-c_j,X) for every concept jj ▷ no gradient to ψ\psi

  16. Compute Δ0\Delta^0, Δj0\Delta^0_j, Δjcf\Delta^{\mathrm{cf}}_j, and Lalign\mathcal{L}_{\mathrm{align}} (§ 4.3)

  17. Update (θ,ϕ)(\theta,\phi) on Lwrap=Ltask+λclsLcls+Lalign\mathcal{L}_{\mathrm{wrap}}=\mathcal{L}_{\mathrm{task}}+\lambda_{\mathrm{cls}}\mathcal{L}_{\mathrm{cls}}+\mathcal{L}_{\mathrm{align}}

  18. end for

  19. end for

Loss weights

Loss weights for each domain are shown in Table 5. The task loss has weight 1 everywhere, and the four alignment losses share a common weight. The presence threshold is set as β=1/∑jcj\beta= 1/\sum_j c_j for equal share across each active concept. This gives β=0.5\beta= 0.5 on aircraft control, where two concepts are active per input, and β=1\beta= 1 on CarRacing, where one concept is active for any given input.

Domainλcls\lambda_{\mathrm{cls}}λnec\lambda_{\mathrm{nec}}λsuf\lambda_{\mathrm{suf}}λind\lambda_{\mathrm{ind}}λpres\lambda_{\mathrm{pres}}β\beta
Aircraft control1.00.10.10.10.10.5
CarRacing1.00.10.10.10.11.0
CUB-200, CCW-Net1.0—————
CUB-200, CBM0.01—————

Table 5. Loss weights per domain. The CUB-200 models train without causal alignment losses.

Optimizers and learning rates

CCW-Net and the mediator model each use Adam with no weight decay, and the mediator model uses the wrapper’s batch size (Table 6).

DomainWrapper learning rateFlow learning rateBatch size
Aircraft control5×10−45 \times10^{-4}1×10−31 \times10^{-3}2048
CarRacing, Table 21×10−31 \times10^{-3}1×10−31 \times10^{-3}32
CarRacing, App. § 16 canonical1×10−31 \times10^{-3}1×10−31 \times10^{-3}128
CUB-2005×10−45 \times10^{-4}—512

Table 6. Optimizer settings per domain. The CUB-200 models use no mediator model as they had no causal alignment losses active. App. § 16 lists the batch size of each CarRacing ablation.

Training schedule

DomainWarmup epochs EwE_wTotal epochs EEFlow fit epochsRefit interval ErE_r
Aircraft control101005010
CarRacing10505010
CUB-200100100——

Table 7. Training schedule per domain. The mediator model is fit for 50 epochs at the start of alignment and refit every 10 alignment epochs to refresh with the current concept representations. Each alignment step uses S=8S = 8 counterfactual draws per concept. The CUB-200 models train the task and concept losses for all 100 epochs.

Data quantities

  • Aircraft control: 500K samples for the main models. The data-quantity ablations use sets of 5K, 50K, and 5M samples.

  • CarRacing: 15,102 samples from 20 episodes.

  • CUB-200: 11,788 images, split into 72% train, 13% validation, and 15% test (8,516, 1,503, and 1,769 images).

Task details

Aircraft control

In extended trail formation [70, 71], a chase aircraft maintains a volume of space behind a lead aircraft that flies dynamic maneuvers. The simulator contains a high-fidelity aircraft dynamics model with six degrees of freedom [22]. For this experiment, the lead aircraft follows a scripted trajectory, and the chase aircraft is controlled by a reinforcement learning policy trained with proximal policy optimization [59] using the aircraft environment and codebase of So and Fan [ [64].

Backbone and action space. The frozen backbone policy maps the state-based observation XX to a two-dimensional action YY of pitch and roll commands. Concepts. J=4J = 4 binary concepts drawn from operational pilot vocabulary [70, 71] providing real-world external validity to the concept set. No real-world concepts were dropped from the operational ontology for this task:

  • Lead pursuit: the chase aircraft’s nose points ahead of the lead aircraft.

  • Lag pursuit: the chase aircraft’s nose points behind the lead aircraft.

  • Climb: the aircraft is ascending in altitude.

  • Dive: the aircraft is descending in altitude.

The pursuit concept set (Lead, Lag) and the vertical concept set (Climb, Dive) are each mutually exclusive. Exactly one concept per set and two concepts overall are active per sample.

CarRacing

CarRacing-v1 [7] is a top-down driving task with pixel inputs. The agent receives a 96×9696 \times96 RGB image of the track and outputs continuous steering, throttle, and brake commands. We use the recorded latents, actions, and concept labels released with CW-Net [29].

Backbone and action space. The frozen backbone is the convolutional policy from that release, trained end-to-end on CarRacing-v1. The action space is three-dimensional, with steering in [−1,1][-1, 1], throttle in [0,1][0, 1], and brake in [0,1][0, 1].

Concepts. J=3J = 3 binary concepts, which the CW-Net authors labeled manually on over 15,000 examples [29]:

  • Straight: drive straight.

  • Left: left turn.

  • Right: right turn.

The three concepts are mutually exclusive and exhaustive, so exactly one concept is active per sample. The labels do not follow the agent’s instantaneous steering command.

CUB-200 classification

CUB-200-2011 [77] is an image classification dataset of 200 bird species. We follow the concept bottleneck setup of Koh et al. [ [33], in which 112 binary visual attributes, assigned per species, exist between the image and the species label.

Backbone and output space. The frozen backbone is Inception-v3, fine-tuned as the joint concept bottleneck model of Koh et al. [ [33] on a species-stratified 80% of all 11,788 CUB-200 images. This fine-tuning set includes about 80% of our test images. The wrapper output is a 200-way species prediction.

Concepts. J=112J = 112 binary visual attributes (e.g., has yellow belly, has pointed beak, has streaked wing). Each species has its own subset of attributes, so the number of active concepts varies by image, with a mean of about 7 over the test split.

Splits. We split the images into 72% train, 13% validation, and 15% test (8,516, 1,503, and 1,769 images), with a different split for each seed.

Full ablation matrix

Tables 8 and 9 report every ablation on aircraft control and CarRacing. Outside the last group, every CCW-Net model uses an encoder of width 256 (App. § 12) and compares against the canonical model in the first row, and the baselines use their own architectures. The last group uses an encoder of width 64, the width of the models in Table 1 and Table 2. All Active and All Inactive average ρactive\rho_{\mathrm{active}} and ρinactive\rho_{\mathrm{inactive}} over the label combinations, weighted by each combination’s number of test inputs (App. § 13). Loss combinations name the alignment losses used, N (necessity), S (sufficiency), I (independence), and P (presence), and the canonical model uses all four. All values are means over ten seeds with two-sided 95% Student-tt intervals, computed from the trained weights. App. § 13 gives the estimator’s settings.

Aircraft control

CarRacing

References

  1. [1]Reduan Achtibat, Maximilian Dreyer, Ilona Eisenbraun, Sebastian Bosse, Thomas Wiegand, Wojciech Samek, and Sebastian Lapuschkin. From attribution maps to human-understandable explanations through Concept Relevance Propagation. Nature Machine Intelligence, 5(9):1006–1019, 2023.DOI
  2. [2]Julius Adebayo, Justin Gilmer, Michael Muelly, Ian Goodfellow, Moritz Hardt, and Been Kim. Sanity checks for saliency maps. In Proceedings of the 32nd Conference on Advances in Neural Information Processing Systems (NeurIPS), 2018.arxiv.org/abs/1810.03292
  3. [3]David Alvarez-Melis and Tommi S. Jaakkola. Towards robust interpretability with self-explaining neural networks. In Proceedings of the 32nd Conference on Advances in Neural Information Processing Systems (NeurIPS), 2018.
  4. [4]Shahin Atakishiyev, Mohammad Salameh, and Randy Goebel. Safety implications of explainable artificial intelligence in end-to-end autonomous driving. IEEE Transactions on Intelligent Transportation Systems, 26(10):14516–14535, 2025.arxiv.org/abs/2403.12176
  5. [5]Andrew Bai, Chih-Kuan Yeh, Neil Y.C. Lin, Pradeep Kumar Ravikumar, and Cho-Jui Hsieh. Concept gradient: Concept-based interpretation without linear assumption. In Proceedings of the 11th International Conference on Learning Representations (ICLR), 2023.arxiv.org/abs/2208.14966
  6. [6]Ioana Bica, Daniel Jarrett, Alihan Hüyük, and Mihaela van der Schaar. Learning “what-if” explanations for sequential decision-making. In Proceedings of the 9th International Conference on Learning Representations (ICLR), 2021.arxiv.org/abs/2007.13531
  7. [7]Greg Brockman, Vicki Cheung, Ludwig Pettersson, Jonas Schneider, John Schulman, Jie Tang, and Wojciech Zaremba. OpenAI Gym. arXiv preprint arXiv:1606.01540, 2016.arxiv.org/abs/1606.01540
  8. [8]Viviana Celli. Causal mediation analysis in economics: Objectives, assumptions, models. Journal of Economic Surveys, 36(1):214–234, 2022.DOI
  9. [9]Ricky T. Q. Chen, Xuechen Li, Roger Grosse, and David Duvenaud. Isolating sources of disentanglement in variational autoencoders. In Proceedings of the 32nd Conference on Advances in Neural Information Processing Systems (NeurIPS), 2018.
  10. [10]Devleena Das, Sonia Chernova, and Been Kim. State2Explanation: Concept-based explanations to benefit agent learning and user understanding. In Proceedings of the 37th Conference on Advances in Neural Information Processing Systems (NeurIPS), 2023.arxiv.org/abs/2309.12482
  11. [11]Giovanni De Felice, Arianna Casanova Flores, Francesco De Santis, Silvia Santini, Johannes Schneider, Pietro Barbiero, and Alberto Termine. Causally reliable concept bottleneck models. Advances in Neural Information Processing Systems, 38:149099–149139, 2025.arxiv.org/abs/2503.04363
  12. [12]Quentin Delfosse, Sebastian Sztybertnia, Mark Rothermel, Wolfgang Stammer, and Kristian Kersting. Interpretable concept bottlenecks to align reinforcement learning agents. In Proceedings of the 38th Conference on Advances in Neural Information Processing Systems (NeurIPS), 2024.
  13. [13]Gabriele Dominici, Pietro Barbiero, Mateo Espinosa Zarlenga, Alberto Termine, Martin Gjoreski, Giuseppe Marra, and Marc Langheinrich. Causal concept graph models: Beyond causal opacity in deep learning. In International Conference on Learning Representations, volume 2025, pages 55102–55131, 2025a.arxiv.org/abs/2405.16507
  14. [14]Gabriele Dominici, Pietro Barbiero, Francesco Giannini, Martin Gjoreski, Giuseppe Marra, and Marc Langheinrich. Counterfactual concept bottleneck models. In Proceedings of the 13th International Conference on Learning Representations (ICLR), 2025b.arxiv.org/abs/2402.01408
  15. [15]Cian Eastwood and Christopher K. I. Williams. A framework for the quantitative evaluation of disentangled representations. In Proceedings of the 6th International Conference on Learning Representations (ICLR), 2018.
  16. [17]Atticus Geiger, Hanson Lu, Thomas Icard, and Christopher Potts. Causal abstractions of neural networks. Advances in Neural Information Processing Systems, 34:9574–9586, 2021.arxiv.org/abs/2106.02997
  17. [18]Atticus Geiger, Zhengxuan Wu, Hanson Lu, Josh Rozner, Elisa Kreiss, Thomas Icard, Noah Goodman, and Christopher Potts. Inducing causal structure for interpretable neural networks. In International Conference on Machine Learning, pages 7324–7338. PMLR, 2022.arxiv.org/abs/2112.00826
  18. [19]Atticus Geiger, Duligur Ibeling, Amir Zur, Maheep Chaudhary, Sonakshi Chauhan, Jing Huang, Aryaman Arora, Zhengxuan Wu, Noah Goodman, Christopher Potts, and Thomas Icard. Causal abstraction: A theoretical foundation for mechanistic interpretability. Journal of Machine Learning Research, 26(83):1–64, 2025.
  19. [20]Yash Goyal, Amir Feder, Uri Shalit, and Been Kim. Explaining classifiers with causal concept effect (CaCE). arXiv preprint arXiv:1907.07165, 2019.arxiv.org/abs/1907.07165
  20. [21]Balint Gyevar, Cheng Wang, Christopher G. Lucas, Shay B. Cohen, and Stefano V. Albrecht. Causal explanations for sequential decision-making in multi-agent systems. In Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 2024.
  21. [22]Peter Heidlauf, Alexander Collins, Michael Bolender, and Stanley Bak. Verification challenges in F-16 ground collision avoidance and other automated maneuvers. In Proceedings of the 5th International Workshop on Applied Verification of Continuous and Hybrid Systems (ARCH), 2018.DOI
  22. [23]Tue Herlau and Rasmus Larsen. Reinforcement learning of causal variables using mediation analysis. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 36, pages 6910–6917, 2022.
  23. [24]Patrick Highland, Thomas Schnell, Katharine Woodruff, and Gianna Avdic-McIntire. Towards human objective real-time trust of autonomy measures for combat aviation. The International Journal of Aerospace Psychology, 33(1):1–34, 2023.DOI
  24. [25]Kosuke Imai, Luke Keele, and Dustin Tingley. A general approach to causal mediation analysis. Psychological Methods, 15(4):309–334, 2010.DOI
  25. [26]Aya Abdelsalam Ismail, Julius Adebayo, Héctor Corrada Bravo, Stephen Ra, and Kyunghyun Cho. Concept bottleneck generative models. In International Conference on Learning Representations, volume 2024, pages 34114–34132, 2024.
  26. [27]Armin Kekić, Jan Schneider, Dieter Büchler, Bernhard Schölkopf, and Michel Besserve. Learning nonlinear causal reductions to explain reinforcement learning policies. In Proceedings of the 14th International Conference on Learning Representations (ICLR), 2026.arxiv.org/abs/2507.14901
  27. [28]Eoin M Kenny, Mycal Tucker, and Julie Shah. Towards interpretable deep reinforcement learning with human-friendly prototypes. In Proceedings of the 11th International Conference on Learning Representations (ICLR), 2023.
  28. [29]Eoin M Kenny, Akshay Dharmavaram, Sang Uk Lee, Tung Phan-Minh, Shreyas Rajesh, Yunqing Hu, Laura Major, Momchil S Tomov, and Julie A Shah. Explainable deep learning improves human mental models of self-driving cars. Nature, 657(8130):114–120, 2026.
  29. [30]Ilyes Khemakhem, Diederik P. Kingma, Ricardo P. Monti, and Aapo Hyvärinen. Variational autoencoders and nonlinear ICA: A unifying framework. In Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics (AISTATS), 2020.arxiv.org/abs/1907.04809
  30. [31]Been Kim, Martin Wattenberg, Justin Gilmer, Carrie Cai, James Wexler, Fernanda Viégas, and Rory Sayres. Interpretability beyond feature attribution: Quantitative testing with concept activation vectors (TCAV). In Proceedings of the 35th International Conference on Machine Learning (ICML), 2018.arxiv.org/abs/1711.11279
  31. [32]Hyunjik Kim and Andriy Mnih. Disentangling by factorising. In Proceedings of the 35th International Conference on Machine Learning (ICML), 2018.arxiv.org/abs/1802.05983
  32. [33]Pang Wei Koh, Thao Nguyen, Yew Siang Tang, Stephen Mussmann, Emma Pierson, Been Kim, and Percy Liang. Concept bottleneck models. In Proceedings of the 37th International Conference on Machine Learning (ICML), 2020.arxiv.org/abs/2007.04612
  33. [34]Sonia Laguna, Riĉards Marcinkevičs, Moritz Vandenhirtz, and Julia E. Vogt. Beyond concept bottleneck models: How to make black boxes interpretable? Advances in Neural Information Processing Systems, 37:85006–85044, 2024.arxiv.org/abs/2401.13544
  34. [35]Hopin Lee, Aidan G Cashin, Sarah E Lamb, Sally Hopewell, Stijn Vansteelandt, Tyler J VanderWeele, David P MacKinnon, Gemma Mansell, Gary S Collins, Robert M Golub, et al. A guideline for reporting mediation analyses in randomized trials and observational studies: the AGReMA statement. Journal of the American Medical Association, 326(11):1045–1056, 2021.
  35. [36]Mingxuan Li, Junzhe Zhang, and Elias Bareinboim. Confounding robust deep reinforcement learning: A causal approach. In Proceedings of the 39th Conference on Advances in Neural Information Processing Systems (NeurIPS), 2025.arxiv.org/abs/2510.21110
  36. [37]Wen Wei Loh, Beatrijs Moerkerke, Tom Loeys, and Stijn Vansteelandt. Disentangling indirect effects through multiple mediators without assuming any causal structure among the mediators. Psychological Methods, 27(6):982–999, 2022.DOI
  37. [38]Scott M Lundberg and Su-In Lee. A unified approach to interpreting model predictions. In Proceedings of the 31st Conference on Advances in Neural Information Processing Systems (NeurIPS), 2017.arxiv.org/abs/1705.07874
  38. [39]Joseph Lyons, Patrick Highland, Nathan Bos, David Lyons, Anna Skinner, Thomas Schnell, and Ryan Hefron. Measuring perceived agent appropriateness in a live-flight human-autonomy teaming scenario. Ergonomics in Design, 32(4):12–17, 2024.
  39. [40]David P MacKinnon. Introduction to Statistical Mediation Analysis. Lawrence Erlbaum Associates, 2008. ISBN 9780805839746.
  40. [41]Prashan Madumal, Tim Miller, Liz Sonenberg, and Frank Vetere. Explainable reinforcement learning through a causal lens. In Proceedings of the 34th AAAI Conference on Artificial Intelligence (AAAI), 2020.arxiv.org/abs/1905.10958
  41. [42]Saaduddin Mahmud, Sandhya Saisubramanian, and Shlomo Zilberstein. Verification and validation of AI systems using explanations. In Proceedings of the AAAI Symposium on AI Trustworthiness and Risk Assessment for Challenging Contexts (ATRACC), 2024.DOI
  42. [43]Samer B Nashed, Saaduddin Mahmud, Claudia V Goldman, and Shlomo Zilberstein. Causal explanations for sequential decision making. Journal of Artificial Intelligence Research, 83(17), 2025.
  43. [44]Daniel Omeiza, Helena Webb, Marina Jirotka, and Lars Kunze. Explanations in autonomous driving: A survey. IEEE Transactions on Intelligent Transportation Systems, 23(8):10142–10162, 2022.DOI
  44. [45]Judea Pearl. Causality: Models, Reasoning and Inference. Cambridge University Press, USA, 2nd edition, 2009. ISBN 052189560X.
  45. [46]Judea Pearl. The causal mediation formula – A guide to the assessment of pathways and mechanisms. Prevention Science, 13(4):426–436, 2012.
  46. [47]Jonas Peters, Dominik Janzing, and Bernhard Schölkopf. Elements of Causal Inference: Foundations and Learning Algorithms. The MIT Press, 2017. ISBN 0262037319.
  47. [48]Tung Phan-Minh, Forbes Howington, Ting-Sheng Chu, Momchil S Tomov, Robert E Beaudoin, Sang Uk Lee, Nanxiang Li, Caglayan Dicle, Samuel Findler, Francisco Suarez-Ruiz, Bo Yang, Sammy Omari, and Eric M Wolff. DriveIRL: Drive in real life with inverse reinforcement learning. In Proceedings of the 2023 IEEE International Conference on Robotics and Automation (ICRA), 2023.
  48. [49]Adrian P Pope, Jaime S Ide, Daria Mićović, Henry Diaz, Jason C Twedt, Kevin Alcedo, Thayne T Walker, David Rosenbluth, Lee Ritholtz, and Daniel Javorskek. Hierarchical reinforcement learning for air combat at DARPA’s AlphaDogfight trials. IEEE Transactions on Artificial Intelligence, 4(6):1371–1385, 2023.DOI
  49. [50]Yilue Qian, Peiyu Yu, Ying Nian Wu, Yao Su, Wei Wang, and Lifeng Fan. Learning concept-based causal transition and symbolic reasoning for visual planning. In Proceedings of the 2024 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), 2024.arxiv.org/abs/2310.03325
  50. [51]Marco Tulio Ribeiro, Sameer Singh, and Carlos Guestrin. “Why should I trust you?”: Explaining the predictions of any classifier. In Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), 2016.arxiv.org/abs/1602.04938
  51. [52]Joshua Rountree, Patrick Hipelius, Brian Dienst, Jonathan Aronoff, Ryan Neely, Robert Steigerwald, Skylar Griffis, David de Schweinitz, Chiawei Lee, and Ryan Hefron. Testing artificial intelligence in high-performance, tactical aircraft. In Proceedings of the 2021 IEEE Aerospace Conference (50100), 2021.DOI
  52. [53]Kangrui Ruan, Junzhe Zhang, Xuan Di, and Elias Bareinboim. Causal imitation learning via inverse reinforcement learning. In Proceedings of the 11th International Conference on Learning Representations (ICLR), 2023.
  53. [54]Cynthia Rudin. Stop explaining black box machine learning models for high stakes decisions and use interpretable models instead. Nature Machine Intelligence, 1(5):206–215, May 2019.DOI
  54. [55]Sara Sabour, Nicholas Frosst, and Geoffrey E Hinton. Dynamic routing between capsules. In Proceedings of the 31st Conference on Advances in Neural Information Processing Systems (NeurIPS), 2017.arxiv.org/abs/1710.09829
  55. [56]Lindsay Sanneman and Julie A Shah. The situation awareness framework for explainable AI (SAFE-AI) and human factors considerations for XAI systems. International Journal of Human–Computer Interaction, 38 (18-20):1772–1788, 2022.DOI
  56. [57]Lindsay Sanneman, Mycal Tucker, and Julie A Shah. An information bottleneck characterization of the understanding-workload tradeoff in human-centered explainable AI. In Proceedings of the 2024 ACM Conference on Fairness, Accountability, and Transparency (FAccT), 2024.DOI
  57. [58]Bernhard Schölkopf, Francesco Locatello, Stefan Bauer, Nan Rosemary Ke, Nal Kalchbrenner, Anirudh Goyal, and Yoshua Bengio. Toward causal representation learning. Proceedings of the IEEE, 109(5):612–634, 2021.DOI
  58. [59]John Schulman, Filip Wolski, Prafulla Dhariwal, Alec Radford, and Oleg Klimov. Proximal policy optimization algorithms. arXiv preprint arXiv:1707.06347, 2017.arxiv.org/abs/1707.06347
  59. [60]Oliver Schulte and Pascal Poupart. When should reinforcement learning use causal reasoning? Transactions on Machine Learning Research, 2025. ISSN 2835-8856.
  60. [61]Ramprasaath R Selvaraju, Michael Cogswell, Abhishek Das, Ramakrishna Vedantam, Devi Parikh, and Dhruv Batra. Grad-CAM: Visual explanations from deep networks via gradient-based localization. In Proceedings of the 2017 IEEE International Conference on Computer Vision (ICCV), 2017.
  61. [62]Karen Simonyan, Andrea Vedaldi, and Andrew Zisserman. Deep inside convolutional networks: Visualising image classification models and saliency maps. In ICLR Workshop, 2014.arxiv.org/abs/1312.6034
  62. [63]Daniel Smilkov, Nikhil Thorat, Been Kim, Fernanda Viégas, and Martin Wattenberg. SmoothGrad: Removing noise by adding noise. In ICML 2017 Workshop on Visualization for Deep Learning, 2017.arxiv.org/abs/1706.03825
  63. [64]Oswin So and Chuchu Fan. Solving stabilize-avoid optimal control via epigraph form and deep reinforcement learning. In Proceedings of Robotics: Science and Systems (R:SS), 2023.arxiv.org/abs/2305.14154
  64. [65]David Sobrín-Hidalgo, Ángel Manuel Guerrero-Higueras, and Vicente Matellán-Olivera. Generating explanations for autonomous robots: a systematic review. IEEE Access, 13:20413–20426, 2025.
  65. [66]Sarath Sreedharan, Anagha Kulkarni, and Subbarao Kambhampati. Explainable Human-AI Interaction: A Planning Perspective. Synthesis Lectures on Artificial Intelligence and Machine Learning. Morgan & Claypool Publishers, 2022. ISBN 9781636392905.arxiv.org/abs/2405.15804
  66. [67]Mukund Sundararajan, Ankur Taly, and Qiqi Yan. Axiomatic attribution for deep networks. In Proceedings of the 34th International Conference on Machine Learning (ICML), 2017.arxiv.org/abs/1703.01365
  67. [68]Andong Tan, Fengtao Zhou, and Hao Chen. Explain via any concept: Concept bottleneck model with open vocabulary concepts. In Proceedings of the 18th European Conference on Computer Vision (ECCV), 2024.arxiv.org/abs/2408.02265
  68. [69]Chen Tang, Ben Abbate­matteo, Jia­heng Hu, Rohan Chandra, Roberto Martín-Martín, and Peter Stone. Deep reinforcement learning for robotics: A survey of real-world successes. In Proceedings of the 39th AAAI Conference on Artificial Intelligence (AAAI), 2025.
  69. [70]United States Air Force. Flying operations: T-38C flying fundamentals. Manual AETCMAN 11-251, Department of Defense, San Antonio, TX, September 2024. URL https://static.e-publishing.af.mil/production/1/aetc/publication/aetcman11-251/aetcman11-251.pdf. 10 September 2024.
  70. [71]United States Air Force. Flying operations: T-6 primary flying. Manual AETCMAN 11-248, Department of Defense, San Antonio, TX, August 2025. URL https://static.e-publishing.af.mil/production/1/aetc/publication/aetcman11-248/aetcman11-248.pdf. 13 August 2025.
  71. [72]Tyler J VanderWeele. Explanation in Causal Inference: Methods for Mediation and Interaction. Oxford University Press, 2015. ISBN 9780199325870.
  72. [73]Stijn Vansteelandt and Rhian M Daniel. Interventional effects for mediation analysis with multiple mediators. Epidemiology, 28(2):258–265, 2017.DOI
  73. [74]Pulkit Verma and Julie A Shah. Interpretability analysis of symbolic representations for sequential decision-making systems. In HRI 2025 Workshop on Explainability for Human-Robot Collaboration: Real-World Concerns (X-HRI), 2025.
  74. [75]Pulkit Verma and Siddharth Srivastava. Learning causally accurate models for autonomous assessment of deterministic black-box agents. Technical Report TR-ASUSCAI-2024-001, Arizona State University, 2024.
  75. [76]Jesse Vig, Sebastian Gehrmann, Yonatan Belinkov, Sharon Qian, Daniel Nevo, Yaron Singer, and Stuart Shieber. Investigating gender bias in language models using causal mediation analysis. In Proceedings of the 34th Conference on Advances in Neural Information Processing Systems (NeurIPS), 2020.
  76. [77]Catherine Wah, Steve Branson, Peter Welinder, Pietro Perona, and Serge Belongie. The Caltech-UCSD Birds-200-2011 dataset. Technical Report CNS-TR-2011-001, California Institute of Technology, 2011.
  77. [78]Tom Ward. The US Air Force is moving fast on AI-piloted fighter jets. WIRED, March 2023.
  78. [79]Zhengxuan Wu, Karel D’Oosterlinck, Atticus Geiger, Amir Zur, and Christopher Potts. Causal proxy models for concept-based model explanations. In International Conference on Machine Learning, pages 37313–37344. PMLR, 2023.arxiv.org/abs/2209.14279
  79. [80]Yilun Zhou, Serena Booth, Marco Tulio Ribeiro, and Julie Shah. Do feature attribution methods correctly attribute features? In Proceedings of the 36th AAAI Conference on Artificial Intelligence (AAAI), 2022.

Paper details

vlnc:W_y8hu65ft
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Computer Science

Not recorded for this paper

View statement
Looking for related papers…
Contents