- Rating
- 3(+2)
- Confidence
- 2(−2)
- Informativeness
- 2(+1)
- Presentation
- 2
- Soundness
- 2(+1)
Read review
Paper summary
In this paper, the authors study GDA from the perspective of prediction paths. They argue that existing GDA methods mainly focus on adapting graph representations, but still rely on a single graph-propagating path for target prediction. To address this issue, they propose EviGDA. EviGDA consists of a graph-aware expert built on A2GNN with entropy-aware exact-sampling alignment, which assigns higher sampling probabilities to lower-entropy target nodes during MMD alignment, and a graph-free local expert implemented as an MLP trained only on source node features and labels. The two experts are optimized independently and combined at inference through a task-level probability mixture. Experiments on multiple GDA benchmarks verify the performance of the proposed EviGDA.
Critical strengths
-
The paper considers GDA from the perspective of prediction paths, and examines whether the adapted graph representation exhausts the predictive evidence available in the target domain.
-
Experiments on multiple GDA benchmarks verify the performance of the proposed EviGDA.
Critical weaknesses
- The paper does not propose a new technique or new theory for GDA. It mainly assembles existing GDA techniques [1,2,3]. Moreover, both parts of Proposition 1 directly follow from the chain rule of conditional entropy and the classical ambiguity decomposition, which provide limited new theoretical insight. So, the novelty of this paper is limited.
- The claimed insight that graph domain adaptation does not end with representation learning is not well supported. The claims in the main manuscript can be largely explained by the known behavior of GNNs under heterophily [4].
- The design of the local expert is inconsistent with the motivation of GDA. The local expert is trained only on source features and labels without any adaptation, which is essentially a source-only model.
- Typos and presentation issues:
- "Most closely to our concern" in Section 2;
- the abbreviation "EAM" is used in Section 2 before it is defined;
- "Graph 2" in Section 4.3 is not defined;
- Figure 1 uses "Feature-Only Predictor" and , which are inconsistent with "graph-free local expert" and in the text.
[1] Long M, Cao Z, Wang J, et al. Conditional adversarial domain adaptation[J]. Advances in neural information processing systems, 2018, 31.
[2] Zeng H, Lyu H, Hu D, et al. Mixture of weak and strong experts on graphs[C]//International Conference on Learning Representations. 2024, 2024: 24462-24502.
[3] Lim D, Hohne F, Li X, et al. Large scale learning on non-homophilous graphs: New benchmarks and strong simple methods[J]. Advances in neural information processing systems, 2021, 34: 20887-20902.
[4] Zhu J, Yan Y, Zhao L, et al. Beyond homophily in graph neural networks: Current limitations and effective designs[J]. Advances in neural information processing systems, 2020, 33: 7793-7804.
Questions for authors
Please see weaknesses.
2 comments
Thanks for your replies. I changed my score.
Official Rebuttal
Dear Reviewer Tpam,
We thank the reviewer for the careful assessment.
W1: Contribution and novelty
EviGDA addresses a specific question in GDA: whether a feature-only prediction path remains useful after cross-domain graph adaptation. Our contribution is a prediction-path formulation that keeps the adapted graph expert and the feature-only expert independently optimized, then combines their predictions through a task-level probability mixture. This separation enables controlled tests of complementarity after adaptation through parameter-matched models, graph–graph ensembles, and frozen-representation readouts.
CDAN [1] conditions adversarial alignment on classifier predictions, and Mowst [2] learns node-wise cooperation between an MLP and a GNN. EviGDA preserves independent optimization and uses a mixture coefficient shared by all nodes within a transfer task. Prior work on non-homophilous graphs [3,4] motivates the value of feature-only prediction; our study examines its complementary role after source–target graph adaptation. Within the graph branch, entropy-aware exact-sampling alignment (EAM) changes target-node sampling probabilities while retaining the multi-kernel MMD estimator and nonzero sampling support for every target node.
Proposition 1 applies standard entropy and ensemble identities to distinguish the existence of predictive information beyond the adapted Graph state from the conditions under which a trained local expert improves the mixture. This distinction motivates two complementary tests: the conditional-readout comparison assesses the predictive utility of Local inputs with Graph inputs fixed, while the expert and fusion controls assess whether the trained predictors turn complementarity into improved predictions.
The local expert has a distinct role within the adaptation system. The graph branch performs cross-domain adaptation, while the local branch supplies a separately learned, source-supervised feature-only prediction path. Its value is assessed through its contribution to the combined target predictor. The comparison with the better single expert directly tests whether combining the two paths adds predictive benefit.
W2: Evidence beyond heterophily
We test complementarity after adaptation using topology interventions, matched prediction controls, and an exploratory frozen-representation readout comparison. Degree-preserving topology interventions modify target connectivity while keeping node features and local predictions fixed. At maximum corruption, Graph-only Macro-F1 decreases by 27.020 percentage points, while local-exclusive correctness increases by 14.132 percentage points, averaged over four tasks relative to their clean graphs. Across 20 task–perturbation combinations (4 tasks × 5 nonzero perturbation levels), each averaged over five seeds, the two changes have a Spearman correlation of 0.973. This correlation is descriptive because the 20 points include repeated measurements within tasks.
In the paper's reported clean-graph control experiments across 16 transfer tasks, Graph+Local improves average Macro-F1 over the parameter-matched graph control, Graph+Graph, and the better single expert by 5.130, 4.837, and 1.982 percentage points, respectively. These matched comparisons support the predictive value of combining heterogeneous paths. The supplementary width comparison in Table 2 (reported in our response to Reviewer jMhR) separately evaluates three local capacities using a common frozen Graph checkpoint.
In the paired conditional-readout comparison (Table 3, reported in our response to Reviewer AmFm), adding the Local representation and predictions to the frozen Graph inputs increased average Macro-F1 by 2.100 percentage points, with a positive task-averaged gain in each of the five runs. CtoA was effectively tied; decreases occurred on B2E, E2B, and EN2DE. Holding the adapted Graph inputs fixed, this comparison directly measures the additional predictive utility of Local inputs for the tested readout.
W3: Presentation
“Graph 2” denotes the second, independently initialized graph expert in the Graph+Graph control. We will make this definition explicit, define EAM at its first occurrence, replace “Most closely to our concern” with “Most closely related to our work,” and align Figure 1's label and notation with “graph-free local expert.”
References
[1] Long et al. Conditional Adversarial Domain Adaptation. NeurIPS, 2018. [2] Zeng et al. Mixture of Weak and Strong Experts on Graphs. ICLR, 2024. [3] Lim et al. Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methods. NeurIPS, 2021. [4] Zhu et al. Beyond Homophily in Graph Neural Networks: Current Limitations and Effective Designs. NeurIPS, 2020.
Best,
Authors