- Rating
- 3(+1)
- Confidence
- 4
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
This paper proposes Reliability-Guided Semantic Memory for Graph Purification (RGSM-GP), a framework for defending graph neural networks against structural adversarial attacks. Building on the iterative GPR-GAE purifier, RGSM-GP introduces evolving semantic memory to replace fixed feature conditioning across purification rounds. Node unreliability is estimated from structural correction residuals, edge-posterior uncertainty, and temporal instability. Candidate screening and budget-normalized soft gating determine which semantic states are updated, while reliability-weighted neighborhood aggregation provides update information. The updated memory subsequently guides structural purification and contributes to final prediction through bounded feature fusion. Experiments on Cora, Citeseer, and PubMed under PRBCD and LRBCD attacks compare RGSM-GP with four defenses. The reported results show the highest robust-average accuracy point estimates in all attack settings.
Critical strengths
-
The paper identifies a meaningful limitation of iterative graph purification. While the adjacency structure is progressively refined, conventional methods may continue using unchanged feature conditioning. Introducing semantic feedback across purification rounds provides a reasonable way to exploit information from the evolving neighborhood structure.
-
The experimental protocol makes a useful effort toward robust evaluation. Attacks are generated separately for each defense rather than simply transferred from another model.
-
The paper is well-written and easy to follow.
Critical weaknesses
-
The semantic branch is trained to reconstruct the original node features using cosine similarity, while the preservation loss penalizes deviations from those same features. Since the memory is initialized as , an identity mapping that leaves memory unchanged could minimize both semantic objectives without learning to repair corrupted neighborhood information. It is therefore unclear what prevents the semantic network from learning to preserve raw features rather than extracting newly available reliable context.
-
The semantic network is trained using a single update from the original features, with zero initial temporal instability. However, inference repeatedly feeds modified semantic memory into the structural purifier, and the reliability score depends partly on changes across previous rounds. In addition, gradients from the semantic objectives are detached from the structural purifier. Thus, it seems that the model is not explicitly optimized for the multi-round feedback behavior that constitutes its main contribution.
-
The proposed unreliability score combines structural residuals, edge uncertainty, and temporal instability. However, substantial structural changes do not necessarily imply that a node’s semantic representation is corrupted. The reported touched-node ROC-AUC just measures agreement with attack-affected nodes, not the ability to identify semantically corrupted representations. A more direct evaluation could measure whether estimated reliability correlates with representation deviations or actual improvement after semantic updates.
-
The experiments use only 3 very classical graph datasets: Cora, Citeseer, and PubMed, all of which are citation networks with predominantly homophilic characteristics. No heterophilic, substantially larger, or inductive graph benchmarks are considered. In addition, robustness is evaluated only under PRBCD and LRBCD. While these are meaningful attacks, it remains unclear whether the proposed reliability signals and semantic memory behave similarly on graphs with different structural or feature distributions.
Questions for authors
Please response to my mentioned weaknesses, and add more types of datasets or large-scale datasets for more comprehensive model analysis.
2 comments
Thanks for the reply. The authors’ responses and additional experiments have addressed most of my earlier concerns. The context-shuffling experiment and the feedback ablation provide more convincing evidence that the model uses contextual information and benefits from multi-round feedback. The added analysis relating reliability-related scores to representation deviations also provides a more direct justification for the scoring mechanism. Furthermore, the results on Chameleon-filtered strengthen the empirical evaluation by extending it beyond citation networks to a heterophilic graph. These additions improve my confidence in the proposed method, and I have increased my score accordingly.
Response to Q1
Purified edge weights and neighbor reliability jointly determine the weights for neighborhood aggregation, guiding the network toward using reliable context. However, this does not guarantee that the network will use such context. We therefore empirically test whether the trained network relies on context and whether semantic updates improve prediction performance.
To test whether the network merely copies its input, we shuffled only the node–context correspondence, keeping all else fixed. Relative changes in first-round candidates (Euclidean distance divided by the pre-shuffle candidate norm) were 31.64%±2.80%/34.70%±0.43% on Cora/Citeseer (mean±SD across seeds). This shows that the network uses context. With structure and classification fusion weights fixed, first-round semantic updates improved test accuracy by 0.366/0.697 percentage points, respectively, compared with no update. This supports context use and first-round prediction gains.
Response to Q2
Training does not explicitly optimize the full feedback trajectory, consistent with our modular design. The structural loss trains the purifier. Reconstruction and preservation losses train the local semantic candidate generator with original features as fixed targets. Semantic gradients do not update the purifier. This retains each module's objective and avoids multi-round unrolling costs. At inference, memory conditions the next purification round without updating purifier parameters.
The rationale for multi-round inference is: updated memory informs the next structure estimate; new edge weights, reliability, and context then inform semantic updates. Each round performs the same local task: generating candidates from memory and reliable context. Thus, the same network can use new feedback. Single-step training learns a local mapping; multi-round inference uses new states arising from its interaction with structural purification.
In the paper's repeated paired ablations, we retained memory updates and final feature fusion but stopped feeding updated memory into the next purification round. Disabling this feedback reduced robust average accuracy by 2.00/2.48 percentage points on Cora/Citeseer. This supports the benefit of multi-round feedback under the current training scheme in the evaluated settings.
Response to Q3
We agree that touched-node ROC-AUC measures score alignment with attack-affected nodes, but cannot establish its relation to representation deviation. We therefore added paired clean/perturbed graph experiments.
Using the same trained model and the actual classification fusion scheme, we extracted classifier hidden representations before the first semantic update. Deviation is the cosine distance between the same node's representations on clean and perturbed graphs. Clean graphs are used only for post-hoc evaluation, not for updates or node selection on perturbed graphs. Spearman correlations between scores and deviations on Cora/Citeseer were 0.631±0.023/0.468±0.055 for all nodes and 0.688±0.049/0.401±0.061 for test nodes (mean±SD over three seeds; positive for every seed). Higher scores thus generally correspond to larger representation deviations, supporting an association.
Response to Q4
We added Chameleon-filtered, a heterophilic Wikipedia link network with duplicate nodes removed. It has 890 nodes, 2,325 features, and 5 classes. It tests reliable aggregation in a non-citation network where neighbors may have different classes.
We reevaluated all five methods under PRBCD/LRBCD using the official splits for three seeds. Splits, attack-budget definitions, evaluation loss, and attack iteration settings were shared across methods. Tables report mean±sample SD over three runs. Robust average accuracy excludes clean graphs.
Chameleon-filtered — PRBCD
Chameleon-filtered — LRBCD
RGSM-GP leads in robust average accuracy and mean accuracy at every nonzero budget under both attacks. This supports its effectiveness beyond the original citation datasets, on this heterophilic web network.
We will clarify these points in the revision. Thank you for your valuable comments.