- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
In this paper, the authors study GDA from a data-centric perspective, where they argue that existing methods implicitly assume all source nodes contribute positively to alignment, while structurally deviated source nodes may cause negative transfer. To address this issue, they propose SNIP, a model-agnostic source node pruning framework. SNIP measures the structural discrepancy between each source node and the target graph using multiple centrality measures, combines them through rank-based normalization, and prunes a predefined proportion of source nodes with the lowest scores before training existing GDA backbones. Experiments on different benchmarks verify the performance of the proposed SNIP.
Critical strengths
- The paper considers GDA from a data-centric perspective, and examines whether all source nodes contribute positively to cross-domain alignment.
- Experiments on citation and social network benchmarks verify the performance of the proposed SNIP.
Critical weaknesses
- This paper is incremental. Selecting or reweighting source samples to reduce domain discrepancy is a classical idea in domain adaptation [1, 2], and data-level refinement of the source graph has also been explored in GDA [3, 4]. SNIP mainly prunes source nodes with several centrality-based heuristics, so I think it does not constitute a new research paradigm from "how to align" to "what to align" as claimed in the main manuscript.
- Some key claims of the main manuscript are not verified by experiments. For example, the claim that structurally deviated source nodes lack semantic counterparts in the target domain is not clearly examined.
- I also have concerns about the reliability of the experimental results. For instance, in Table 1, the results of AdaGCN on C→A and D→A are exactly the same, and the results of SGC on C→A and D→C are also exactly the same. Please double check these same results.
- Typos and presentation issues:
- "We vary r from 0. to 0.6" in Section 5.4, while Figure 4 only shows the range up to 0.5;
- "we remove one component at a time" in Section 5.3 without a capital letter;
[1] Huang J, Gretton A, Borgwardt K, et al. Correcting sample selection bias by unlabeled data[J]. Advances in neural information processing systems, 2006, 19.
[2] Cao Z, Ma L, Long M, et al. Partial adversarial domain adaptation[C]//European conference on computer vision. Cham: Springer International Publishing, 2018: 139-155.
[3] Liu S, Li T, Feng Y, et al. Structural re-weighting improves graph domain adaptation[C]//International conference on machine learning. PMLR, 2023: 21778-21793.
[4] Huang R, Xu J, Jiang X, et al. Can modifying data address graph domain adaptation?[C]//Proceedings of the 30th ACM SIGKDD conference on knowledge discovery and data mining. 2024: 1131-1142.
Questions for authors
Please see weaknesses.
2 comments
Thanks for the response, but my main concerns remain. AdaGCN is the backbone of SNIP, and the improvements in Table 1 are computed against its numbers, so the duplicated results on C→A and D→A directly affect whether the claimed gains hold. I think the backbone should be rerun rather than copied from earlier papers. The response also lacks any experimental comparison with StruRW or GraphAlign. Since no new evidence is provided, I will keep my original rating.
Response to Reviewer B9gd
Q1. The proposed method is incremental because source selection and reweighting have already been studied in domain adaptation.
Response: SNIP addresses a distinct problem in UGDA: identifying structurally incompatible source nodes using target-domain topological information and refining the source graph before adaptation. Unlike conventional sample selection, node pruning in graphs affects not only the training samples but also graph connectivity and message passing. Furthermore, SNIP differs fundamentally from StruRW, which reweights structural relationships, and GraphAlign, which synthesizes graph data through feature and topology optimization. SNIP instead directly constructs a structurally compatible induced subgraph from the original source graph based on target-aware structural compatibility. Its novelty lies in explicitly incorporating cross-domain structural compatibility into source-node refinement, providing a lightweight, model-agnostic approach complementary to existing UGDA methods.
Q2. The claim of shifting the research paradigm from "how to align" to "what to align" is overstated.
Response: The distinction between "how to align" and "what to align" reflects a fundamental difference in how cross-domain distribution shifts are addressed. Existing UGDA methods primarily focus on improving alignment mechanisms while largely treating the entire source graph as transferable. Although reweighting methods account for heterogeneous contributions by adjusting the importance of samples or structural relationships during training, they generally retain the original source graph. In contrast, SNIP explicitly identifies and removes structurally incompatible source nodes before adaptation, thereby refining both the source-node population and its underlying topology.
This distinction is particularly important under structural shifts, where forcing incompatible source structures into alignment may introduce negative transfer. Simply adjusting their contributions during training does not directly address whether these structures should be included in the adaptation process. SNIP addresses this issue at the data level, shifting the focus from how to align existing source knowledge to what source knowledge should participate in alignment. Importantly, SNIP is complementary to existing approaches, improving adaptation without modifying their architectures or optimization objectives.
Q3. The claim that structurally deviated nodes lack semantic counterparts in the target domain is not directly verified.
Response: Our central hypothesis is that structurally incompatible source nodes may contribute negatively to cross-domain alignment, rather than that every structurally deviated node necessarily lacks a semantic counterpart. Fig. 2 provides direct empirical motivation for this hypothesis. Under matched pruning ratios, structural pruning consistently outperforms random pruning, indicating that the structural compatibility criterion helps distinguish source nodes with different contributions to adaptation. Furthermore, the improvements achieved across different backbones and transfer scenarios reinforce the practical relevance of selective source-node utilization. These results support the proposed mechanism without requiring a strict one-to-one correspondence between source and target nodes.
Q4. Identical baseline results appear across different transfer scenarios in Table 1.
Response: As explicitly stated in Section 5.2, the baseline results are adopted from previously published studies [1-2] rather than independently reproduced in this work. Therefore, identical entries should first be examined in relation to their original sources and cannot, by themselves, be taken as evidence of unreliable SNIP experiments. Importantly, the evaluation of SNIP focuses on comparisons with its corresponding backbones, AdaGCN and A2GNN, under the same transfer settings. We will verify the identified entries against the original references and correct any transcription errors to ensure accurate reporting.
[1] Rethinking propagation for unsupervised graph domain adaptation. In Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, AAAI, pp. 13963–13971, 2024.
[2] Smoothness really matters: A simple yet effective approach for unsupervised graph domain adaptation. In Proceedings of the AAAI Conference on Artificial Intelligence, AAAI, pp. 15875–15883, 2025.
Q5. Typographical and presentation inconsistencies.
Response: We thank the reviewer for identifying these presentation issues. We will correct the inconsistency between the pruning-ratio range described in Section 5.4 and that displayed in Fig. 4, as well as the capitalization error in Section 5.3. These corrections do not affect the methodology or experimental conclusions.