Cause-Aware Heterogeneous Graph Learning

• The paper introduces a cause-aware heterogeneous graph learning architecture that integrates causal inference to enhance comorbidity risk prediction.
• It leverages causal nonnegative latent factorization and relation-specific message passing to fuse and assess causal signals across diverse node and edge types.
• By incorporating counterfactual interventions and a composite loss function, the framework improves interpretability and robustness in predictive modeling.

A cause-aware heterogeneous graph learning architecture integrates principles of causal inference with heterogeneous graph neural network design to address the challenge of distinguishing causation from spurious correlation in relational data. In the context of comorbidity risk prediction for chronic obstructive pulmonary disease (COPD), such an architecture explicitly encodes different node and edge types—e.g., patients and diseases—and fuses causal representations via tailored message passing, counterfactual interventions, and specialized objective functions. The method aims to enhance the detection of genuine causal relationships among entities, thereby improving the interpretability and robustness of predictive models (Zhou et al., 22 Dec 2025).

1. Heterogeneous Graph Definition and Construction

The approach begins with the construction of a heterogeneous comorbidity graph, defined as $G = (V, E, T_v, T_E, R)$, where:

• $V = P \cup D$ is the set of nodes, partitioned into patients ($P$) and diseases ($D$).
• $T_v$ enumerates node types ("Patient", "Disease").
• $E$ is the edge set, partitioned by relation set $R$.
• $T_E$ defines edge types, specifically:
  • $r_1$: Patient–Patient relations (e.g., similarity or contact)
  • $r_2$: Disease–Disease relations (e.g., comorbidity, shared etiology)
  • $V = P \cup D$0: Patient–Disease relations (direct comorbid links)

Each relation $V = P \cup D$1 induces a sparse adjacency matrix $V = P \cup D$2. The collection $V = P \cup D$3 can be indexed as a relation-type incidence tensor. Initial node features are provided as follows: for patients, 68-dimensional laboratory test vectors, often incomplete, are embedded using causal non-negative latent factorization (see Section 2); for diseases, one-hot or learned embeddings are used.

2. Model Architecture: Preprocessing and Causal Graph Neural Inference

The cause-aware framework consists of two major components:

A. Causal Nonnegative Latent Factorization (CSINLF) for Preprocessing:

• Patient lab measurements (matrix $V = P \cup D$4) are factorized into $V = P \cup D$5 and $V = P \cup D$6, optimizing:

$V = P \cup D$7

where $V = P \cup D$8 regularizes towards known causal constraints (e.g., disease $V = P \cup D$9 lab value). Latent vector $P$0 for patient $P$1 is used as initial graph input.

B. Heterogeneous Graph Neural Network with Causal Attention and Counterfactual Reasoning:

For each layer $P$2:

1. Relation-Specific Message Passing: Relation-wise message aggregation,

$P$3

2. Pairwise Causal Strength Estimation: Computation of $P$4,

$P$5

3. Causal Attention: Computation of edge-wise attention score $P$6,

$P$7

4. Do-Intervention (Counterfactual Feature Transformation):

$P$8

1. Causal Message Passing: Message $P$9
2. Causal Aggregation: Sum of received causal messages,

$D$0

1. Feature Fusion: Additive combination of base and causal outputs,

$D$1

After $D$2 layers, a patient’s embedding $D$3 is the input for a multilayer perceptron (MLP) or linear-softmax classifier to yield predicted risk scores $D$4.

3. Integrated Causal Inference Mechanisms

The architecture adopts a structural causal model (SCM) perspective:

• Variables: Node representations $D$5, edge-level causal strengths $D$6, and attentions $D$7 are considered endogenous variables governed by the model's structural equations.
• Treatment Variable: The do-intervention $D$8 (Eq.(5)) operationalizes the "treatment" by actively modifying source node features, thereby blocking confounding from the graph context.
• Outcome: The predicted risk $D$9 for each patient node post-aggregation.
• Confounders: Baseline lab features and graph-neighborhood messages that, unadjusted, may introduce non-causal associations.

For each patient, two outputs are constructed: the factual prediction $T_v$0 and a counterfactual $T_v$1 simulating intervened features. The difference between these is used to quantify and adjust for estimated causal effects. While no formal do-calculus is applied, the inclusion of explicit intervention operations and their integration into the optimization criteria aligns the method with SCM-based learning.

4. Objective Function and Optimization

The CHGRL method minimizes a composite loss:

$T_v$2

where:

• Classification Loss $T_v$3: Cross-entropy over patient labels, enforcing predictive accuracy.

$T_v$4

• Counterfactual Reasoning Loss $T_v$5: Penalizes disparities between factual and intervention-based predictions:

$T_v$6

• Causal Regularization Loss $T_v$7: Enforces consistency of latent representations with causal constraints, arising from $T_v$8 on factorized embeddings and, in general, penalizes spurious edges or encourages similarity between $T_v$9 and $E$0.

This multi-term loss enforces that the learned representations retain predictive power, maintain counterfactual (causal) consistency, and adhere to known mechanistic knowledge.

5. Workflow Summary: Layerwise and Loss Function Overview

Step	Key Formula (Eq.)	Description
Relation-specific MP	(2): $E$1	Aggregation per edge type
Causal strength	(3): $E$2	Neural pairwise causal estimator
Causal attention	(4): $E$3	Learnable edge weighting using $E$4
Do-intervention	(5): $E$5	Counterfactual transformation on $E$6
Causal message	(6): $E$7	Attention-weighted causal message
Aggregation	(7): $E$8	Sum of incoming messages at $E$9
Feature fusion	(8): $R$0	Combine base and causal features
Full loss	(9): $R$1	Overall objective (classification, counterfactual, regularizer)

In this architecture, each component targets a fundamental aspect of cause-aware learning: initial embeddings reflect feasible causal structures (via CSINLF); edge propagation selectively weights paths based on causal salience; counterfactual operations ensure that the system focuses on genuine interventions, and the composite loss penalizes non-causal or confounded explanations.

6. Relevance, Significance, and Relation to Prior Work

The cause-aware heterogeneous graph learning architecture, as instantiated in CHGRL (Zhou et al., 22 Dec 2025), addresses the limitations of standard GNNs in medical prediction tasks where causal distinction is critical. By integrating edge-type specific propagation, explicit modeling of pairwise causal influences, and counterfactual interventions, it provides a unified framework for causal discovery and risk prediction. The inclusion of the counterfactual loss and causal regularization differentiates this method from correlation-focused approaches.

A plausible implication is the extensibility of the approach to other domains where graph-structured confounding is prevalent. While CHGRL does not enumerate meta-paths, its multi-relation aggregation and explicit causal weighting generalize the meta-path attention paradigm by making each edge a candidate for causal interpretation. The structure ensures that the model is robust to spurious correlations often encountered in heterogeneous biomedical and social graphs. This suggests utility in early disease detection settings, but also motivates future exploration of formal SCM analysis and integration with broader families of causal GNNs.