- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes Calibrated Bounded Message Passing (CBMP), a graph neural network framework designed to improve robustness against anomalous features and node injection attacks. CBMP combines two-stream input normalization, bounded nonlinear message transformations, and clean-data-based calibration to limit the influence of corrupted neighbors before aggregation. The paper provides theoretical bounds on message perturbations and conduct extensive experiments on five node classification datasets to demonstrate improved robustness over existing baselines.
Critical strengths
-
Extensive experimental evaluation. The paper conducts comprehensive experiments across five datasets under various feature corruption and node injection attacks. The authors also include numerous baselines and ablation studies to investigate the effectiveness of different components.
-
Clear presentation and theoretical analysis. The paper is generally well-written and logically organized, with clear explanations of the motivation and proposed method.
Critical weaknesses
-
The proposed CBMP consists of three core components: RMSNorm, an MLP with a tanh activation, and channel statistics derived from a graph used for "clean" training. None of these components are entirely novel in themselves. The primary innovation of the paper lies in combining them to constrain the magnitude of messages prior to their aggregation from neighboring nodes. However, a question arises: given that using tanh to achieve a bounded mapping is a straightforward and common design choice, why does this specific combination constitute a sufficiently significant algorithmic contribution?
-
Although CBMP offers significant improvements over the original GCN, its advantage narrows considerably when compared against baseline models that employ robust normalization techniques. This raises the question: to what extent can these improvements be attributed to the proposed "bounded message mechanism"? Furthermore, the baselines used are not sufficiently up-to-date.
-
Limited Methodological Novelty. The proposed CBMP primarily combines existing normalization techniques, a standard bounded nonlinear message function, and a calibration mechanism. Prior work has already explored bounded message functions before aggregation (e.g., Deep Tensor Neural Networks, 2017), normalization-based defenses against graph attacks (e.g., GRB, NeurIPS 2021), and robust neighborhood aggregation (e.g., Geisler et al., NeurIPS 2020). Although their specific formulations differ, the paper does not sufficiently clarify the fundamental novelty of CBMP beyond combining these established techniques. Moreover, the ablation results suggest that calibration provides limited or inconsistent improvements, further weakening the claimed methodological contribution.
Questions for authors
Please see the weakness.
Point-by-Point Response to Reviewer SERy
We thank the reviewer. We agree with the premise of each weakness and revised the paper to claim only what the measurements support; please also see the general response.
W1. None of the three components is new; tanh is a common way to bound a map. We agree. The introduction states that each part exists, and Section 2 names the prior uses:
The contribution is a measured account of when a bounded message bounds anything and what it adds:
W2. The advantage narrows against normalised baselines; how much is due to the bounded message? The factorial design (Table 3; intervals in Table 17) gives every cell its own tuning:
Baselines not up to date.
W3. Novelty relative to DTNN, GRB and Soft Median; calibration gives limited or inconsistent improvements.
Relation to prior work. Section 2 states what differs from each:
Calibration. The reviewer is right, and the paper now says so directly.