- Rating
- 4(+1)
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper studies graph domain adaptation when both source and target graphs have missing edges. The authors call this setting Edge-Incomplete Graph Domain Adaptation (EIGDA). Using GRADE, they show that the domain gap grows as more edges are removed. Their method, MIRAGE, keeps the observed edges and considers adding edges between nodes with similar features, using top-K neighbors. It predicts a probability for each candidate edge and adds the edge if this probability exceeds a threshold computed from the two node embeddings. Training combines a binary cross-entropy loss on the observed adjacency, mutual information (MI) objectives within and across domains, and source classification on the reconstructed graph.
Critical strengths
1.This paper makes sense in considering domain alignment when reconstructing the graph. Table 5 also suggests that applying VGAE before GDA is not enough. This is the main reason I lean toward acceptance. 2.The paper evaluates four datasets and five deletion rates. It also includes BFS-based deletion, additional transfer directions, ablations, and analyses of hyperparameters, efficiency, and variance. The gains at 60–80% deletion are large. I would find them more convincing if the concerns below were addressed.
Critical weaknesses
1.UDAGCN reports the same accuracy at every deletion rate on Blog and Airport: 0.167 and 0.249, respectively. These results suggest that it may be predicting a single class. On Blog, six of the eight GDA baselines also perform worse than GCN+VGAE, which does not use domain adaptation. 2.The paper does not report which edges MIRAGE adds. Specifically, BCE loss treats all unobserved candidate edges as negatives, while the threshold increases with the embedding dot product. More evidence is needed to show that reconstructing edges with domain alignment in mind is what drives the gains.
Questions for authors
1.How were the baselines tuned? In particular, why does UDAGCN report identical accuracies across deletion rates on Blog and Airport?Do the baseline results at 0% deletion match previously reported results? 2.Could you evaluate StruRW and HGDA with the same top-K edges? If they use degrees from the full graph, they retain information about edges deleted later. Could this explain why MIRAGE's accuracy changes so little on Airport? 3.How many edges are added, and what fraction connect nodes with the same label? Could the authors also compare the dynamic threshold with a fixed threshold? 4.Could you include StruRW and HGDA in Table 4?
5 comments
Response to Reviewer mWwq
Part 2/3
3. Reconstructed Edges and Their Role in Domain Adaptation (W2, Q3)
The paper does not report which edges MIRAGE adds. Specifically, BCE loss treats all unobserved candidate edges as negatives, while the threshold increases with the embedding dot product. More evidence is needed to show that reconstructing edges with domain alignment in mind is what drives the gains.
How many edges are added, and what fraction connect nodes with the same label?
We thank the reviewer for these questions. First, we clarify that Eq. (2) is not optimized independently. As shown in Eq. (5), MIRAGE jointly optimizes adjacency reconstruction and MI objectives. In particular, structure-level cross-domain MI depends on candidate-edge probabilities and provides additional gradients during optimization. Thus, although BCE penalizes unobserved candidate edges, these edges can still be selected through MI-guided reconstruction. The threshold based on embedding similarity does not independently determine which edges are selected, as the learned embeddings and candidate-edge probabilities are influenced by the joint objectives.
To characterize the reconstructed edges, we report the numbers of added edges and their same-label proportions on Citation and Airport under 60% and 80% edge deletion rates in Table R2.
| Dataset | Deletion | Domain | Added Edges | Same-label (%) |
|---|---|---|---|---|
| Citation | 60% | ACMv9 | 3904 | 83.1 |
| DBLPv7 | 2850 | 84.6 | ||
| Citation | 80% | ACMv9 | 5971 | 82.3 |
| DBLPv7 | 4420 | 83.9 | ||
| Airport | 60% | Brazil | 305 | 61.3 |
| USA | 3921 | 74.6 | ||
| Airport | 80% | Brazil | 416 | 60.1 |
| USA | 5345 | 74.5 |
Table R2. Number of added edges and percentage connecting nodes with the same label.
The results show that MIRAGE adds more edges as the deletion rate increases, with a substantial proportion connecting nodes of the same class. We also examine the effect of reconstruction on source-target homophily discrepancy in Section 7 (in lines 523-529 on page 10, highlighted in blue), where MIRAGE achieves smaller homophily gaps than both the observed graphs and feature-NN augmentation.
More importantly, MIRAGE aims to reconstruct connections that address domain discrepancy rather than recover the original topology exactly. To examine this distinction, we compare MIRAGE with its variant without cross-domain MI on ACMv9→DBLPv7. As shown in Table R3, removing cross-domain MI improves edge recovery F1 but reduces target classification accuracy.
| Variant | Recovery F1 60% | Target Acc. 60% | Recovery F1 80% | Target Acc. 80% |
|---|---|---|---|---|
| MIRAGE | 0.333 | 0.618 | 0.306 | 0.596 |
| MIRAGE w/o cross-domain MI | 0.460 | 0.552 | 0.401 | 0.535 |
Table R3. Comparison of edge recovery F1 and target classification accuracy on ACMv9→DBLPv7.
Removing cross-domain MI improves edge recovery F1 but decreases target accuracy by 0.066 and 0.061 at 60% and 80% deletion, respectively. This shows that a higher overlap with the original topology does not necessarily lead to better domain adaptation.
We provide further evidence in Appendix G (Figs. 8 and 9, on page 20, highlighted in blue). The edge overlap analysis shows that MI components influence which edges are selected, while the classification loss gap analysis shows that full MIRAGE consistently achieves smaller source-target performance discrepancies than its MI ablation variants. At 80% deletion, full MIRAGE reduces the losWs gap by 13.6% on ACMv9$\to$DBLPv7 and 25.6% on Brazil$\to$USA compared with the variant without MI. These results support the role of MI-guided reconstruction in improving domain adaptation under edge incompleteness.
Response to Reviewer mWwq
Part 3/3
4. Dynamic vs. Fixed Thresholds (Q3)
We additionally compare the dynamic threshold with three fixed thresholds (0.4, 0.6, and 0.8) on ACMv9$\to$DBLPv7 (A$\to$D) and Blog1$\to$Blog2 (B1$\to$B2) under 60% and 80% edge deletion rates. The results are reported in Table 10 of Appendix I on page 22 . The dynamic threshold achieves the highest target classification accuracy in all four settings, outperforming the best fixed threshold by 0.012–0.024. These results demonstrate the effectiveness of dynamically adjusting the threshold based on node representations for edge selection.
5. Additional Results under BFS-Based Edge Deletion (Q4)
We have added StruRW and HGDA to the BFS-based edge deletion experiment, with the new results highlighted in blue in lines 439-441 on page 9. MIRAGE consistently outperforms both methods across all three deletion rates, achieving improvements of 0.100, 0.098, and 0.099 percentage over the strongest baseline at 40%, 60%, and 80% deletion, respectively. These results further demonstrate the effectiveness of MIRAGE under BFS-based edge deletion.
Response to Reviewer mWwq
Part 1/3
We thank the reviewer for the detailed feedback and constructive suggestions. We address the concerns and questions below and provide additional experimental results where requested.
1. Baseline Results and Experimental Settings (W1, Q1)
Thank you for this question. For all baselines, we use the default hyperparameters provided in their publicly available implementations. For UDAGCN, these include 200 training epochs and an encoder dimension of 16, with a random seed of 200.
Regarding the identical UDAGCN results across deletion rates, we examined its predictions and confirmed that all target nodes are predicted as the same class on both Blog and Airport. This explains why its accuracy and Macro-F1 remain unchanged across different deletion rates.
Regarding the results at 0% deletion, the datasets used in our experiments differ from those in the original UDAGCN paper, which does not report results on Blog or Airport. Therefore, a direct numerical comparison with its originally reported results is not possible. We evaluate all baselines on the same datasets and transfer tasks for a consistent comparison.
We agree with this observation. Unlike the GDA baselines that directly perform adaptation on the input graphs, GCN+VGAE first reconstructs the source and target graphs using VGAE before node classification. This reconstruction may provide useful neighborhood information for classification, even without explicit domain adaptation. In contrast, missing edges can affect the node representations learned by conventional GDA methods and make cross-domain alignment more difficult.
2. Comparison with StruRW and HGDA (Q2)
We conduct additional experiments with two baselines, kNN-Aug+StruRW and kNN-Aug+HGDA, as reported in Table R1 (also added as Table 7, in lines 979-981 on page 19, highlighted in blue). Both methods preserve the observed edges and add edges based on node feature similarity, with the number of added edges matched to MIRAGE separately for each domain. The results show that MIRAGE consistently outperforms the strongest baseline by 6.4–14.6 percentage points across all six settings, demonstrating that feature-based edge augmentation alone cannot explain MIRAGE's improvements.
Table R1. Comparison with kNN-Aug+StruRW and kNN-Aug+HGDA. The best results are in bold, and the second-best are underlined.
Regarding the concern about information leakage, all methods, including MIRAGE, StruRW, and HGDA, use only the observed incomplete graphs during training. Any degree information is computed from the graphs after edge deletion, without access to the original complete adjacency matrices.
On Airport, MIRAGE's accuracy decreases by only 0.019 from 0% to 80% edge deletion, compared with 0.074 and 0.077 for StruRW and HGDA, respectively. This suggests that MIRAGE is less sensitive to missing edges, consistent with its MI-guided reconstruction, which selects additional connections to mitigate domain shift rather than relying only on the observed graph structures.