- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper presents Barlow Twins-Guided Adaptive Alignment (BTGA) for unsupervised multi-view graph domain adaptation. It combines feature-aware graph filtering, a shared encoder, intra-domain Barlow Twins regularization, and adaptive cross-domain alignment. Shared PCA summaries enable correlation estimation between domains with unpaired nodes. Consistency and redundancy scores determine weights for aligning source-target view pairs through multi-kernel MMD. Training additionally uses source supervision and target entropy minimization. Experiments on twelve ACM and MAG transfer tasks report improvements over existing baselines. Ablation studies and efficiency comparisons provide supporting evidence, although several methodological and experimental inconsistencies require clarification.
Critical strengths
- The paper addresses a relevant limitation of multi-view graph adaptation: domain shifts vary across relation pairs, motivating differentiated alignment rather than uniform treatment.
- Reported results consistently outperform the evaluated baselines across twelve transfer tasks, with particularly substantial improvements on ACM and gains in both accuracy and macro-F1.
- The evaluation includes component ablations, parameter sensitivity analyses, and computational comparisons, providing useful evidence about the framework’s behavior beyond its main classification results.
Critical weaknesses
- The ablations omit uniform weighting with otherwise identical components. Removing alignment entirely cannot isolate the contribution of adaptive weighting, leaving the central methodological advantage over ordinary multi-view MMD alignment insufficiently demonstrated.
- Section 4.3 lists several hyperparameter choices but does not explain how they or the final checkpoint are selected without target labels.
- Figure 1 shows an association between the proposed scores and MMD on one transfer task. It does not establish why prioritizing already similar view pairs should improve target classification or when this strategy might fail.
- The paper reports five runs but provides no standard deviations or confidence intervals. This makes it difficult to judge the reliability of the smaller MAG gains and the differences between ablation variants.
Questions for authors
See the weaknesses.
5 comments
Official Comment by Authors (2/2)
W3. Rationale for prioritizing view pairs with smaller domain discrepancies.
Thank you for highlighting this concern. We explain the rationale and empirical evidence below, including performance when view-pair matching deteriorates. The strategy comparison has been added to Section 4.5 of the main text (p. 8–9, lines 431–438, Figure 4).
-
(i) Rationale and empirical evidence. Our aim is to prioritize information useful for target classification. We believe that smaller-discrepancy view pairs offer a more reliable basis for transfer. BTGA therefore gives them greater relative weights while retaining all pairs in alignment.
We fix the task and target view, retaining the full model and other losses. From the same state after five epochs without alignment, we compare no alignment with aligning either source view (coefficient 1). The table below reports some of the results.
Task (target view) Aligned pair MK-MMD² Target ACC No-alignment ACC ACM2→ACM1 (PAP) PAP→PAP 0.5345 0.528 0.434 ACM2→ACM1 (PAP) PSP→PAP 0.8000 0.471 0.434 DE→CN (PP) PP→PP 0.3881 0.469 0.423 DE→CN (PP) PAP→PP 0.3918 0.438 0.423 Both alignment settings improve upon no alignment, but the smaller-discrepancy pair yields higher ACC by 5.7 and 3.1 percentage points, respectively. Thus, larger discrepancy does not necessarily imply greater alignment benefit. Full results are in Table G.3, Appendix G.3 (p. 30, lines 1600–1610).
-
(ii) Comparison with large-discrepancy prioritization. In Section 4.5 of the main text (p. 8–9, lines 431–438, Figure 4), we compare BTGA with a control assigning higher weights to larger-discrepancy view pairs, keeping other components unchanged. The table below reports some of the ACC results.
Method ACM2→ACM1 US→CN JP→CN DE→CN FR→DE US→RU Large-discrepancy prioritization 0.566 0.433 0.492 0.428 0.521 0.424 BTGA 0.687 0.558 0.546 0.461 0.564 0.477 BTGA achieves higher ACC on all twelve tasks, supporting its strategy of dynamically assigning greater relative weights to high-consistency, low-redundancy view pairs. Full results with standard deviations are in Table E.4, Appendix E.4 (p. 25, lines 1327–1340).
-
(iii) When the strategy may fail. Alignment weights express relative priorities among available pairs. When all pairs are poorly matched, reweighting alone cannot ensure reliable transfer. We progressively increase target-attribute Gaussian noise using , scaled by each feature's standard deviation, and retrain BTGA at each level (Appendix G.3, p. 31, lines 1622–1631). The table below reports some of the ACC results.
Noise multiplier DE→FR CN→JP JP→CN RU→US 0 (clean) 0.545 0.533 0.494 0.387 2 0.461 0.428 0.433 0.338 4 0.374 0.319 0.346 0.275 6 0.335 0.239 0.294 0.227 ACC declines as noise increases on these tasks (Appendix G.3, Figure G.5(b), p. 31, lines 1652–1655). At , all four view pairs in each task show lower consistency and higher redundancy than their clean counterparts. These results illustrate a limitation: relative weighting does not prevent classification degradation when all available view pairs deteriorate.
W4. Statistical reliability of experimental results.
Thank you for highlighting the need to report variability. We have added mean ± standard deviation across five runs for BTGA's main results, component ablations, and filtering/alignment comparisons in Appendix E.4, Tables E.1–E.4 (p. 24–25, lines 1273–1340). The table below reports some of the results.
| Method / metric | ACM1→ACM2 | CN→US | DE→FR | RU→US |
|---|---|---|---|---|
| BTGA / ACC | 0.666 ± 0.019 | 0.592 ± 0.004 | 0.560 ± 0.004 | 0.430 ± 0.013 |
| BTGA / Macro-F1 | 0.664 ± 0.013 | 0.410 ± 0.005 | 0.494 ± 0.005 | 0.418 ± 0.017 |
| w/o Alignment / ACC | 0.361 ± 0.009 | 0.554 ± 0.008 | 0.544 ± 0.005 | 0.384 ± 0.009 |
| Consistency Only / ACC | 0.383 ± 0.020 | 0.563 ± 0.028 | 0.534 ± 0.013 | 0.384 ± 0.016 |
| Redundancy Only / ACC | 0.384 ± 0.010 | 0.564 ± 0.008 | 0.523 ± 0.027 | 0.383 ± 0.005 |
These additions make run-to-run variability explicit for the MAG results and ablation variants. We assess the reported mean differences together with these SDs, providing a more transparent basis for evaluating their reliability.
Looking forward to hearing from you
Dear Reviewer 4QrY,
We deeply appreciate your time and effort in reviewing our submission and providing valuable feedback. Your insights are crucial to our work.
Following your suggestions, we have added a uniform-weighting comparison, clarified hyperparameter and checkpoint selection, explained the alignment priority and its limitations, and reported means and standard deviations across five runs. These additional analyses and experiments have greatly improved the quality of our paper.
As the discussion deadline approaches, we would be grateful for your feedback and will do our best to address any remaining concerns.
Best regards,
The Authors of Submission 31342
Official Comment by Authors (1/2)
Thank you very much for your time and thoughtful feedback. We greatly appreciate your constructive and insightful suggestions.
Thank you for suggesting this comparison. We have added it to the ablation study in Section 4.5 of the main text (p. 8–9, lines 431–438, Figure 4) to assess the contribution of adaptive view-pair weighting.
We agree that w/o Alignment evaluates alignment as a whole and does not isolate adaptive weighting. We have therefore added ordinary multi-view MMD alignment as a uniform-weight control, assigning equal weights to all source–target view pairs while keeping other components unchanged. The table below reports some of the ACC results.
BTGA achieves higher ACC than uniform weighting on all twelve ACM and MAG tasks. These results support dynamically assigning alignment weights according to view-pair consistency and redundancy, enabling adaptive cross-domain alignment with better target classification. Full results with standard deviations are in Table E.4, Appendix E.4 (p. 25, lines 1327–1340).
Thank you for highlighting this issue. We have clarified the original selection protocol and added supplementary analyses without target-domain labels in Appendix B.3 (p. 17–20, lines 885–1051).
(i) A shared challenge in unsupervised domain adaptation. Hyperparameter and checkpoint selection is challenging without an independent labeled target-domain validation set. This challenge arises in both visual and graph domain adaptation.
(ii) Selection protocol for the main experiments. Following SAGA's emphasis on consistent training and evaluation [1], we compare BTGA and the baselines under the same data partitions and evaluation conditions. BTGA's hyperparameters are selected using target-domain test performance, and its reported checkpoint is the epoch with the highest target ACC within the predefined training budget. Target labels are used for hyperparameter selection, reporting-epoch selection, and evaluation, but not model parameter optimization.
(iii) Supplementary selection without target-domain labels. We have added Soft Neighborhood Density (SND) [2] and Importance Weighted Cross-Validation (IWCV) [3] analyses. SND maximizes a neighborhood-density score from unlabeled target predictions; IWCV minimizes an importance-weighted source-validation loss.
We independently vary α and β over 0.25,0.5,1,2,4 times their task-specific defaults, keeping other hyperparameters fixed. Candidates are scored and selected using fixed final checkpoints, without target-domain labels. The supplementary analysis therefore does not select the reporting epoch by target ACC. The table below reports some of the ACC results.
The selected configurations achieve ACC within 0.3 and 0.4 percentage points of the corresponding main results. On the representative transfer tasks presented, both criteria identify configurations whose classification performance is close to that reported in the main experiments. These results support the effectiveness of SND and IWCV for selecting BTGA’s α and β within the examined candidate ranges without using target-domain labels. Further selection analyses are provided in Figures B.2–B.3 (p. 19–20, lines 1014–1017 and 1043–1046).
References
[1] Fang et al. SAGA: Structural aggregation guided alignment with dynamic view and neighborhood order selection for multiview graph domain adaptation. ICLR 2026.
[2] Saito et al. Tune it the right way: Unsupervised validation of domain adaptation via soft neighborhood density. ICCV 2021.
[3] Sugiyama et al. Covariate shift adaptation by importance weighted cross validation. JMLR 2007.