- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
In this paper, the authors study graph domain adaptation under edge imbalance. They argue that existing class-imbalanced GDA methods mainly focus on the imbalanced number of nodes across classes, while overlooking intra-domain edge imbalance and cross-domain edge-distribution discrepancies. To address this issue, they propose ProTA, a plug-and-play topology augmentation framework. ProTA constructs topology-aware source prototypes through diffusion over a class-preserving source graph, and uses them together with node attribute similarity to score candidate edges for minority-class nodes in both domains. The augmentation budget for each class pair is then allocated according to intra-domain edge deficits and cross-domain edge-distribution discrepancies, and the augmented graphs are directly fed into existing GDA backbones. Experiments on multiple GDA benchmarks verify the performance of the proposed ProTA.
Critical strengths
-
The paper considers edge imbalance in graph domain adaptation, which complements existing class-imbalanced GDA methods that mainly focus on the imbalanced number of nodes across classes.
-
ProTA is designed as a plug-and-play module without modifying the backbone architecture, and experiments on multiple benchmarks verify the performance of the proposed ProTA.
Critical weaknesses
- In Section 4.2, the minority class is identified using pseudo labels produced by the GDA backbone. How to ensure the identified minority class in the target domain aligns with the real minority class? ProTA adds edges to nodes in different classes to reduce edge-distribution discrepancies. Does this augmentation change the original homophily or neighborhood structure of the graphs?
- Several recently published GDA methods can be included in the experiment to evaluate the performance of ProTA, such as [1] [2] [3].
- Typos and presentation issues:
- "consisits" in Section 1;
- "summerize" in Section 5.1;
- "improvedas" and the incomplete sentence "across the six In a few cases" in Section 5.3;
- "Tables ??–??" in Appendix E.1;
- Appendix E.4 contains only the section title without any content;
[1] Learning Structure-Semantic Evolution Trajectories for Graph Domain Adaptation. Chen et al., ICLR 2026.
[2] On the Benefits of Attribute-Driven Graph Domain Adaptation. Fang et al., ICLR 2025.
[3] Homophily Enhanced Graph Domain Adaptation. Fang et al., ICML 2025.
Questions for authors
Please carefully address the weaknesses.
4 comments
Part 2/3
W2. Comparisons with Recent GDA Methods
We thank the reviewer for suggesting comparisons with more recent GDA methods. We agree that including these methods provides a more comprehensive evaluation of ProTA.
To address this comment, we have extended our experiments to include DiffGDA [1] and HGDA [3]. Specifically, we evaluate both methods and integrate ProTA into their respective frameworks. For GAA [2], whose implementation is not publicly available, we additionally report its published results from DiffGDA [1] on the same Citation transfer tasks. We have incorporated these experimental results into Tables 1–3 of the revised manuscript, with the corresponding parameters settings summarized in Table 17 and 18. We conduct experiments on 12 transfer tasks across four datasets, with representative results presented in Table R3.
(1) Comparison with recent GDA methods. Table R3 presents the results of DiffGDA and HGDA on four representative Citation transfer tasks, together with the published results of GAA. These additional results extend our evaluation to the recent methods suggested by the reviewer. For example, DiffGDA+ProTA achieves 73.44%, 76.58%, and 77.78% Ma-F1 on A→D, D→A, and C→D, respectively, compared with the reported GAA results of 68.07%, 62.66%, and 71.40%.
(2) Generalizability to recent GDA architectures. We further evaluate whether ProTA can complement DiffGDA and HGDA. As shown in Table 1, integrating ProTA consistently improves DiffGDA’s Ma-F1 across the four Citation tasks, with gains ranging from 0.50 to 1.48 percentage points. ProTA also improves HGDA’s Ma-F1 on all four tasks, with gains ranging from 0.23 to 0.83 percentage points. These results provide additional evidence that ProTA can be integrated with GDA methods beyond the six backbones originally evaluated. The complete experimental results are presented in Tables 1–3 of the main manuscript.
Table R3. Comparison with recent GDA methods and their ProTA-enhanced variants on four Citation transfer tasks (Mean ± Std).
| Method | A→D Mi-F1 | A→D Ma-F1 | D→A Mi-F1 | D→A Ma-F1 | C→D Mi-F1 | C→D Ma-F1 | D→C Mi-F1 | D→C Ma-F1 |
|---|---|---|---|---|---|---|---|---|
| GAA [2], reported in [1] | 73.32 ± 0.67 | 68.07 ± 1.09 | 68.32 ± 0.43 | 62.66 ± 0.93 | 76.04 ± 0.39 | 71.40 ± 0.16 | 78.27 ± 0.31 | 72.74 ± 0.76 |
| DiffGDA | 75.79 ± 0.23 | 72.92 ± 0.33 | 74.48 ± 0.79 | 75.10 ± 0.52 | 78.52 ± 0.62 | 77.27 ± 0.37 | 77.44 ± 0.10 | 72.63 ± 0.34 |
| DiffGDA + ProTA | 76.29 ± 0.20 | 73.44 ± 0.36 | 75.26 ± 0.86 | 76.58 ± 0.42 | 79.03 ± 0.61 | 77.78 ± 0.40 | 78.33 ± 0.03 | 73.87 ± 0.06 |
| Δ | +0.50 | +0.52 | +0.78 | +1.48 | +0.51 | +0.50 | +0.89 | +1.25 |
| HGDA | 32.64 ± 0.58 | 11.88 ± 0.35 | 29.87 ± 0.36 | 12.42 ± 0.07 | 33.59 ± 0.84 | 15.26 ± 0.44 | 28.09 ± 0.13 | 10.34 ± 0.23 |
| HGDA + ProTA | 33.04 ± 0.48 | 12.68 ± 0.32 | 30.28 ± 0.57 | 13.25 ± 0.48 | 34.81 ± 0.09 | 15.49 ± 0.71 | 27.60 ± 0.96 | 11.17 ± 0.03 |
| Δ | +0.40 | +0.80 | +0.41 | +0.83 | +1.22 | +0.23 | −0.49 | +0.83 |
W3. Typos and Presentation Issues
We thank the reviewer for carefully identifying these typos and presentation issues. We have corrected all the reported errors, resolved the unresolved table references in Appendix E.1, and completed the missing content in Appendix E.4. Additionally, we have carefully reviewed the entire manuscript and corrected other similar issues to improve its clarity, consistency, and overall presentation. We appreciate the reviewer's constructive suggestions, which have helped us improve the quality of the manuscript.
[1] Learning Structure-Semantic Evolution Trajectories for Graph Domain Adaptation. Chen et al., ICLR 2026.
[2] On the Benefits of Attribute-Driven Graph Domain Adaptation. Fang et al., ICLR 2025.
[3] Homophily Enhanced Graph Domain Adaptation. Fang et al., ICML 2025.
Part 3/3
Other Changes in Our Revision During the Rebuttal
To further strengthen the empirical validation of ProTA and clarify its motivation and applicability, we have conducted additional experiments and analyses and incorporated the corresponding results into the revised manuscript. Specifically, we have expanded comparisons with recent GDA methods and cross-network transfer settings, further investigated the distinction between node imbalance and edge imbalance, examined alternative edge-distribution strategies for budget allocation, and evaluated the robustness and applicability of ProTA under different structural conditions. For ease of review, we summarize the key additional changes below:
-
Expanded baseline comparisons. We have incorporated two additional GDA methods, DiffGDA and HGDA, and evaluated their performance before and after integrating ProTA. For GAA, whose implementation is not publicly available, we additionally report its published results on the same Citation transfer tasks for reference. The corresponding results are presented in Tables 1–3 of the main manuscript and Table 6 of the Appendix.
-
Expanded cross-network transfer evaluation. We have added 22 additional transfer settings for the six original GDA baselines (UDAGCN, TDSS, DGSDA, ADAlign, PALA, and ImGDA), extending the evaluation beyond the four settings considered in the original submission. We report the performance of each baseline and its ProTA-enhanced counterpart, providing broader empirical evidence of ProTA's effectiveness across diverse cross-network transfer scenarios. The additional results are provided in Appendix Tables 7–13.
-
Additional robustness evaluation under varying structural imbalance. We have conducted controlled experiments to evaluate six GDA backbones under five levels of intra-domain edge imbalance and cross-domain edge-distribution discrepancy, varying the two structural factors independently. We compare the original backbones with their ProTA-enhanced counterparts using both Micro-F1 and Macro-F1. The results are presented in Appendix Figure 2, providing further evidence of ProTA's robustness to varying degrees of structural imbalance.
-
Distinction between node imbalance and edge imbalance. We have added an analysis of the relationship between node-class distributions and edge-pair distributions using the Blog1 and Blog2 datasets. Although both datasets exhibit relatively balanced node-class distributions, their edge-pair distributions remain substantially non-uniform and exhibit distinct connectivity patterns. This analysis highlights that node-level balance does not necessarily imply balanced edge distributions. The corresponding results are presented in Appendix Figure 1.
-
Comparison of global and conditional edge distributions. We have further compared two edge-budget allocation strategies: ProTA, which uses conditional neighbor distributions, and ProTA*, which uses global class-pair edge distributions. Experiments on eight Citation and Twitch transfer tasks show that both strategies achieve comparable downstream classification performance, suggesting that both global and conditional edge distributions can effectively guide edge-budget allocation. The results are provided in Appendix Table 3.
-
Evaluation under balanced node-class distributions. We have further evaluated an extended variant of ProTA on node-balanced but edge-imbalanced graphs. By adapting augmentation-target selection from minority classes to underrepresented class-pair connections, the extended variant preserves the core mechanisms of prototype-guided edge scoring and discrepancy-aware budget allocation. Experiments with UDAGCN on four transfer tasks show consistent improvements in both Micro-F1 and Macro-F1, with average gains of 1.97 and 2.85 percentage points, respectively. The results are presented in Appendix Table 5.
After checking the rebuttal, I keep my initial score.
Part 1/3
We sincerely thank Reviewer 3 for the constructive and insightful comments. In response, we have conducted additional experiments on target minority-class identification and graph homophily, expanded comparisons with recent GDA methods, and revised the manuscript to improve its presentation. Our point-by-point responses are provided below.
W1. Reliability of Target-Domain Minority-Class Identification
1. Reliability of target minority-class identification
We appreciate the reviewer's insightful concern regarding the reliability of minority-class identification in the unlabeled target domain. We agree that inaccurate pseudo-labels may introduce biases into the estimated target-class distributions and affect subsequent topology augmentation.
To mitigate this issue, ProTA does not identify target minority classes directly from all predicted labels. Instead, as described in Section 4.2 (Eqs. 7–8), we employ a dual-criterion reliability filter based on prediction confidence and prototype-similarity margins. Specifically, target nodes are selected only when their prediction confidence exceeds τ and their similarity margin relative to competing source-class prototypes exceeds γ. Target minority classes are then identified based on the pseudo-label counts of these reliable nodes, reducing reliance on uncertain predictions.
To directly evaluate the reliability of target minority-class identification, we compare UDAGCN and UDAGCN+ProTA across six transfer tasks on MAG and Twitch. As shown in Table R1, UDAGCN+ProTA achieves minority-class identification accuracies of 72.6%–90.2%, consistently outperforming UDAGCN across all six tasks. The improvements range from 20.4 to 29.9 percentage points, with an average gain of 23.98 percentage points. These results demonstrate that incorporating ProTA substantially improves the accuracy of target minority-class identification, providing empirical support for the effectiveness of the proposed framework.
Table R1. Minority-class accuracy (%) with UDAGCN and UDAGCN+ProTA.
2. Effect on homophily and neighborhood structure.
To examine whether ProTA changes graph homophily, we measure edge homophily before and after augmentation on four Twitch transfer tasks with TDSS. As shown in Table R2, the mean changes are small: the absolute change is at most 0.251 percentage points for the source graphs and 0.277 percentage points for the target graphs. Thus, the overall edge homophily remains close to its original level in these tested settings.
ProTA improves GDA performance by adjusting underrepresented class-pair connections and accounting for cross-domain edge-distribution discrepancies. Since it adds edges, it necessarily changes the neighborhoods of nodes incident to those edges. Nevertheless, the small changes in overall homophily indicate that these local modifications do not substantially alter the proportion of same-class edges at the graph level in the tested settings.
Table R2. Edge homophily before and after ProTA augmentation with TDSS
on Twitch transfer tasks.