- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
Unlike existing federated graph domain generalization methods which mainly assume globally aligned label space, this paper addresses a practical and novel problem, i.e., Federated Few-Shot Graph Domain Generalization with Non-Aligned Label Spaces, where different clients do not share common label space and target classes may be unseen during training. This paper proposes a FedDARC method to address the problem, which combines optimization-response-based domain characterization, domain-state-guided residual calibration, and task-relative relational inference.
Critical strengths
- The paper addresses a practical and novel problem, i.e., Federated Few-Shot Graph Domain Generalization with Non-Aligned Label Spaces, where different clients do not share common label space and target classes may be unseen during training.
- The paper provides theoretical analyze to support the calibration-induced relational improvement.
- Experimental results demonstrate the effectiveness of the proposed method compared with multiple baselines.
Critical weaknesses
- This paper aims to address Federated Few-Shot Graph Domain Generalization with Non-Aligned Label Spaces. However, in the proposed model design, it is unclear which parts are actually devised for graph data, i.e., how the graph topological structures are utilized?
- In the addressed Federated Few-Shot Graph Domain Generalization problem, the target graph has a few accessible labels for each target class, thus, it is possible to directly conduct few-shot node classification solely on the target graph. What is the benefit of conducting Federated Few-Shot Graph Domain Generalization in such case? How much improvement can be obtained by transferring the knowledge from the source graphs, as compared to few-shot node classification solely on the target graph?
- The proposed method seems to be quite complex, combining multiple components, but the motivation of each component is not clear enough.
- It seems that the selected baselines are not designed for the scenario with Non-Aligned Label Spaces. It is confused how to adapt them to the task of Federated Few-Shot Graph Domain Generalization with Non-Aligned Label Spaces for fair comparison.
Questions for authors
- In the proposed method, which components are actually devised for graph data, i.e., how the graph topological structures of the source graphs and the target graph are utilized?
- In the addressed Federated Few-Shot Graph Domain Generalization problem, the target graph has a few accessible labels for each target class, thus, it is possible to directly conduct few-shot node classification solely on the target graph. What is the benefit of conducting Federated Few-Shot Graph Domain Generalization in such case? In experiments, how much improvement can be obtained by Federated Graph Domain Generalization, as compared to few-shot node classification directly on the target graph?
- In experiments, how to adapt the baselines which are not devised for the shared label space to the new task of Federated Few-Shot Graph Domain Generalization with Non-Aligned Label Spaces?
5 comments
W4 & Q3. Baseline Adaptation and Fair Comparison
Thank you for raising this concern.
-
Baseline Adaptation. Most existing FL/FDG baselines were originally designed for aligned label spaces, making their fixed-output classifiers unsuitable for direct transfer across domains with different class cardinalities and semantics. As described in , our evaluation uses their adapted versions. Baselines requiring target-specific adaptation are further trained using only the few labeled target context nodes to accommodate the target label space, without accessing target query labels. In contrast, FedDARC performs context-conditioned relational prediction with fixed learned parameters, without target-specific fine-tuning.
-
Fair Comparison. All methods use the same source-domain training data, target context–query splits, and label budgets. We also maintain approximately equal total federated communication budgets, adjusting the number of communication rounds according to each method's per-round cost, as detailed in . Target-specific adaptation does not involve additional client–server communication.
These protocols ensure consistent data access, target supervision, and federated communication constraints across methods, while accommodating their different prediction mechanisms under non-aligned label spaces.
Esteemed Reviewer,
We sincerely thank you for the time and effort you have devoted to evaluating our work.
We hope that our responses and revisions have adequately addressed your questions and concerns. If so, we would be grateful if you could kindly consider whether the current revisions might merit a reassessment of the score. Of course, should any technical quality points remain unclear or if you have further suggestions, we would be most happy to hear from you.
Best regards,
Authors
We appreciate the reviewer's thoughtful comments and the opportunity to clarify the key aspects of our work.
W1 & Q1. Graph-Specific Design
Thank you for highlighting this ambiguity. We address this concern from two perspectives: why graph-specific considerations matter (Graph-Specific Challenges) and how graph topology is incorporated into FedDARC (Graph Encoding and Domain Calibration and Relational Classification).
Graph-Specific Challenges. Unlike independent samples, node representations in graphs depend on both node features and neighborhood structures. Consequently, cross-graph shifts in topology and feature distributions can alter message passing and learned representations, making transfer to unseen graphs challenging. Combined with non-aligned label spaces, these challenges motivate our domain-aware representation calibration and task-relative relational classification.
Graph Encoding. Our proposed FedDARC employs a two-layer GraphSAGE GNN encoder, which explicitly incorporates graph topology through neighborhood aggregation. Thus, node representations capture both node attributes and structural information, rather than treating nodes independently. More details are provided in Appendix C.1.
Domain Calibration and Relational Classification. Domain states are derived from the GNN's optimization responses, which are influenced by graph topology, node features, and supervision. These states guide representation calibration across heterogeneous graph domains. Relational classification then matches topology-aware query and context embeddings using task-relative labels, enabling prediction without globally aligned class semantics. Thus, graph structure influences both domain characterization and relational prediction, rather than being used only as an encoder input.
We will clarify these graph-specific design in the revised manuscript.
W2 & Q2. Federated Source-Graph Transfer
We explain the benefits of source-graph transfer and quantify them through a target-only comparison.
Benefits of Source-Graph Training. Source-graph training learns transferable node representations and query-to-context matching rules, improving prediction when only a few labeled target nodes are available. Table 4 in the main paper further shows that performance improves as more source graphs are used for training.
Comparison with Target-Only Classification. The following Table 1 compares our method with target-only few-shot classification under the same target-data settings. It can be seen that our method improves accuracy by 19.20/18.33 points on Computers. These results support the value of transferring source-graph knowledge for few-shot prediction on unseen target graphs.
W3. Clarification of the Components
FedDARC combines two complementary components to address cross-graph distribution shifts and non-aligned label spaces.
Domain-state-guided representation calibration. Cross-graph shifts can affect node representations and weaken relational matching. We therefore derive domain states from a common reference encoder's optimization responses and use them to guide residual calibration. This enables domain-dependent adjustments while retaining the original node representations.
Label-space-agnostic relational classification. Representation calibration alone cannot resolve differences in class cardinalities and semantics. We therefore use task-relative labels and query-to-context matching instead of a fixed-output classifier, enabling prediction without cross-domain label correspondence.
Supporting Evidence. Table 2 shows that removing domain calibration reduces Cora 5-shot accuracy from 58.20% to 54.13%, while removing label-relative inference further reduces accuracy to 13.04%, supporting the importance of task-relative prediction. Moreover, Proposition 1 characterizes the conditions under which calibration improves relational predictions, with supporting empirical analysis in Table 3 .
These results support the complementary roles of domain characterization, representation calibration, and label-space-agnostic relational classification.