- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper studies federated node classification on text-attributed graphs under non-IID client partitions. The authors propose CSRI-FGL, which uses a frozen client-side LLM to extract node-level semantic representations and pairwise textual consistency scores to supervise local semantic edge generators, then obtains a global semantic edge generator through federated aggregation, applies the local and global generators to add edges within each client's own node set, and finally uses a dual-branch GraphSAGE architecture to process the two enhanced graphs and fuse their representations with textual semantic representations for node classification. The method does not generate cross-client edges. Experiments show that, in the reported mean macro-F1 results, CSRI-FGL outperforms the compared baselines on Collaborative Test across all five datasets while maintaining competitive Local Test performance.
Critical strengths
- The method shifts the object of collaboration from concrete node relations to reusable connection functions. It distills semantic supervision from local node pairs into aggregatable semantic edge generators, enabling other clients to apply the learned rules to their own node pairs without exchanging node-level representations, aligning nodes across clients, or constructing a server-side global graph.
- The method provides a targeted mechanism to mitigate potential negative transfer caused by shared structural priors. The two branches perform message passing separately on different enhanced graphs, avoiding the merging of the two sets of added edges into a single neighborhood beforehand; the branch-level consistency term uses stop-gradient local representations as a reference to guide the global branch toward alignment. In Table 4, the variant using global-pattern enhancement without dual-branch decoupling performs worse on Collaborative Test than the local-pattern enhancement variant, whereas the full model performs better, which is consistent with the motivation of preserving a local structural view while leveraging shared relation knowledge.
Critical weaknesses
- The ablations do not sufficiently isolate the benefit of federated edge-generator aggregation. In Table 4, global w/o Dual-branch underperforms both + Local-pattern and Baseline on Collaborative Test. The full model also changes the branch architecture, leaving the contribution of shared connection patterns unclear. A matched dual-branch control without edge-generator aggregation would clarify this contribution.
- Baseline adaptations under the common information constraints remain unclear. FedEgo uploads mashed ego-graphs, while DFGL2GS uses client-generated graphs for server-side learning. The main paper does not clarify whether these transmissions and core mechanisms are retained.
Questions for authors
- With semantic inputs, dual-branch architecture, edge budgets, and federated GNN training fixed, how does disabling edge-generator aggregation affect performance, and how is its regularization handled?
- In Collaborative Test, how are reserved nodes connected and predictions produced or aggregated? Are the evaluation rules and accessible information consistent across baselines?
2 comments
Thank you for the detailed response. The proposed experiments and analyses address several of my concerns. I will retain my current rating.
Author Response to Reviewer hNAd
We thank the reviewer for recognizing the motivation for transferable semantic relation functions and the dual-branch design. We address both concerns below.
W1Q1: Independent contribution of federated edge-generator aggregation.
The original Table 4 ablations change both graph-enhancement components and branch configurations, so they do not independently isolate generator aggregation. We therefore introduced Full w/o Generator Aggregation within the complete dual-branch framework. In this variant, server-side aggregation and redistribution of edge-generator parameters are disabled, while each client independently retains and updates its local generator. The Local-pattern branch remains unchanged, and the Global-pattern branch uses the corresponding client-local generator instead of the aggregated generator. Both GraphSAGE branches, candidate-pair scoring, structural-semantic fusion, threshold/top-κ selection, edge budgets, and downstream training settings are retained. The asymmetric consistency objective also retains its original coefficient and stop-gradient direction. Under the original Table 4 setting (K = 6; Citeseer, PubMed, and Wiki), Full w/o Generator Aggregation achieves a mean Collaborative Test Macro-F1 of 0.7936, compared with 0.8193 for Full CSRI-FGL, corresponding to an improvement of 2.57 percentage points. These results demonstrate the empirical benefit of federated semantic relation-function sharing over independently trained client-local generators under the evaluated setting. Our contribution lies in the federated sharing and application of transferable semantic relation functions, rather than proposing a new FedAvg algorithm.
W2Q2: Collaborative Test protocol and baseline fidelity.
Collaborative Test. Before non-IID client partitioning, approximately 30% of nodes are reserved by class-stratified sampling. These nodes and all their original incident edges are removed from the training graphs. They do not participate in local training, validation, Local Test, training-time message passing, edge-generator optimization, or model selection. The remaining nodes are partitioned across clients and split 80%/10%/10% locally (Section 4.1). At inference, each reserved node is assigned to exactly one participating client without using its ground-truth label for client assignment, and temporarily inserted into that client's local evaluation graph. Its original features and cached Mistral semantic representation are available, but its original incident edges remain fully masked. CSRI-FGL may generate semantic links between reserved and existing local nodes or between reserved nodes, strictly within the assigned client. No cross-client edges, neighbor queries, node-level representation sharing, or raw-graph exchange are involved in CSRI-FGL inference. Predictions are evaluated only for reserved nodes. We pool these predictions across all clients and compute one Collaborative Macro-F1 over the combined reserved set rather than averaging client-level scores. Ground-truth labels are used for the initial class-stratified sampling and final metric computation, not for client assignment, reserved-node training, or model selection. Thus, Collaborative Test evaluates previously unseen nodes within participating clients, not zero-shot generalization to entirely unseen clients. Baseline fidelity. FedEgo retains its mashed ego-graph upload mechanism, whereas DFGL2GS retains client-generated graph uploads and server-side graph learning. Neither mechanism is replaced with CSRI-FGL's generator-parameter sharing. We keep datasets, client partitions, evaluation splits, and metrics comparable while preserving each baseline's own collaboration and learning procedures.