- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This work builds on supervised lower bounds for causal information flow and introduces a single-objective training approach tailored for out-of-distribution graph classification. The graph encoder outputs two separate representation channels. During classifier training, the second-channel embedding of one graph is swapped with that from a different graph, and the classifier is tasked with recovering the original graph label. The authors test their method across fourteen dataset setups and six backbone architectures, assessing both predictive performance and the model’s ability to uncover underlying rationales. Aggregated empirical results suggest this objective can yield competitive performance without explicitly tuning tradeoffs among multiple auxiliary loss terms.
Critical strengths
-
The training objective is simple and practically appealing. By swapping representations across graphs during training, the method uses a single objective without requiring multiple auxiliary losses or their associated weighting coefficients, while achieving competitive performance.
-
The evaluation considers both classification and rationale discovery across six backbones, providing a broader assessment of the method. The results highlight that strong predictive performance does not necessarily imply accurate rationale recovery, offering useful insight into the behavior of different architectures.
Critical weaknesses
- The core theory lacks sufficient substantiation. Swapping the second channel merely encourages the model to avoid relying on it; it does not prevent the first channel from retaining spurious correlations. Consequently, one cannot definitively conclude that the model has learned true causal factors. This is the most fundamental issue.
- The experimental results are insufficient to establish the stability or the source of the observed gains. The primary tables report aggregated means without uncertainty estimates, and some comparisons exclude certain experimental runs—which are not accounted for. Furthermore, the absence of critical control experiments makes it difficult to determine whether the gains stem from causal mechanisms or simply from general representation enhancement and regularization.
Questions for authors
-
Please specify under what assumptions Equation (17) extracts causal information instead of concentrating predictive information, including spurious correlations, into the first channel? Does Theorem 5.2 exclude this shortcut solution, or does it presuppose an effective causal decomposition?
-
Please provide the performance differences and uncertainty estimates of pairings on the same dataset and with five random seeds, and compare them with the cross-entropy baseline using only the first channel under the same architecture. It is suggested to fix the motif and replace the background on an existing synthetic dataset to examine whether CIF truly reduces the dependence on spurious correlations, rather than simply causing the classifier to ignore the second channel.