- Rating
- 3
- Confidence
- 4
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
This paper proposes a cross-domain graph pre-training, TSCGFM, which measure the agreement between each node's topological and semantic (feature-induced) neighborhoods by using structural concordance. Each node receives information from two coordinators (high and low), with the weights determined by its concordance score. And Meta-coordinators are used to share knowledge across different graphs. Experiments across diverse graph benchmarks consistently demonstrate improved unseen-domain over existing method.
Critical strengths
S1. The proposed method is clear and easy to follow.
S2. The experiments cover diverse graph benchmarks and useful ablation studies.
S3. The paper provides theoretical analysis to support the method.
Critical weaknesses
W1. Structural concordance is too abstract. Although figure 1 shows its distribution across datasets, more visual examples would help readers understand this concept. Its connection to the learned embeddings and cross-domain transfer is also unclear.
W2. The paper utilizes SVD to align the dimension of different datasets without any adaptation. This will probably make the feature spaces still unaligned, especially when transferring to an unseen domain.
W3. The paper gives little detail on the cost of constructing feature-induced neighborhoods. Section 3.2 connects coordinators across all pairs of domains. This suggests (O(M^2)) cross-domain edges, but Section 5 reports (O(M)).
Questions for authors
Refer to W1-W3.
5 comments
W2. The paper utilizes SVD to align the dimension of different datasets without any adaptation. This will probably make the feature spaces still unaligned, especially when transferring to an unseen domain.
A2. We thank the reviewer for raising this important concern. We clarify that SVD is used as a preprocessing step to ensure dimensional compatibility across heterogeneous graphs, rather than to explicitly align their feature semantics or distributions. This is a common practice in multi-domain graph pre-training, where representative methods such as GCOPE, MDGFM, and SAMGPT also employ dimensionality reduction techniques, including SVD or PCA, to accommodate heterogeneous input feature dimensions.
Importantly, explicit feature distribution alignment is not necessarily required for transferable representation learning in multi-domain graph pre-training. Different graphs may exhibit substantially different feature semantics and structural characteristics, and directly enforcing similar feature or embedding distributions across domains does not necessarily establish semantic correspondence and may suppress useful domain-specific information. Instead of explicitly aligning feature distributions, TSCGFM facilitates cross-domain knowledge transfer through structural concordance and hierarchical coordination. Specifically, structural concordance is computed independently within each graph based on the agreement between topological and feature-induced neighborhoods, without requiring direct feature correspondence across domains. These node-level topology–feature relationships guide concordance-conditioned soft routing to complementary coordinators, while cross-domain coordinator connections and meta coordination facilitate information exchange across heterogeneous graphs. Together with the shared GNN encoder and joint self-supervised pre-training, this mechanism aims to learn transferable representations without requiring explicit alignment of feature or embedding distributions.
For an unseen target domain, following the transfer protocol of GCOPE, we apply the same dimensionality-unification procedure to the target graph and subsequently fine-tune the pre-trained GNN encoder using available target-domain labels. Although the target features may differ semantically from those of the source graphs, our framework aims to transfer knowledge of local topology–feature relationships learned across diverse source domains, rather than requiring explicit feature correspondence between source and target graphs.
W3. The paper gives little detail on the cost of constructing feature-induced neighborhoods. Section 3.2 connects coordinators across all pairs of domains. This suggests cross-domain edges, but Section 5 reports .
A3. We thank the reviewer for highlighting the need to clarify the computational cost of feature-induced neighborhood construction and the inconsistency in our analysis of cross-domain coordination complexity. We provide a detailed breakdown below.
(1) Feature-induced neighborhood construction. For each source graph with nodes and aligned feature dimension , constructing the feature-induced neighborhoods involves two steps:
- Pairwise similarity computation: Computing the cosine similarities between all pairs of nodes requires time.
- Degree-matched neighbor selection: For each node , we select the most similar nodes from the remaining nodes. Using linear-time selection, this requires time per node, resulting in time across all nodes.
Therefore, the total construction complexity is per graph, and across all source graphs.
Importantly, feature-induced neighborhood construction is performed only once as a preprocessing step, before learning the GNN and coordinator node representations. The constructed neighborhoods remain fixed throughout the entire training process. Thus, this computational cost is incurred only once before model training and does not contribute to the computational complexity of subsequent training iterations.
(2) Graph augmentation and training complexity. We agree with the reviewer that the pairwise cross-domain coordinator connections introduce edges, rather than as previously stated in Section 5. We clarify the graph augmentation complexity as follows.
- Additional coordinator nodes: Each of the source graphs introduces two graph-specific coordinators and one meta coordinator, resulting in additional nodes. Thus, the augmented graph contains nodes, where .
- Node-to-coordinator connections: Each original node connects to its two graph-specific coordinators, introducing additional edges.
- Cross-domain coordinator connections: For each pair of distinct source graphs, the corresponding high-concordance coordinators and low-concordance coordinators are connected, introducing two edges per graph pair. In addition, the corresponding meta coordinators are connected across source graphs, introducing one additional edge per pair. Therefore, the total number of cross-domain coordinator edges is .
- Meta-coordinator connections: Each graph-specific coordinator connects to its corresponding meta coordinator, introducing additional edges.
Consequently, the augmented graph contains
\qquad |E'| =|E|+2N+3M(M-1)/2 =|E|+2N+1.5 M^2 - 1.5M,$$ where $|E|=\sum_{m=1}^{M}|E_m|$. Therefore, the augmented graph has $O(N+M)$ nodes and $O(| E|+N+M^2)$ edges. Since GNN training operates on the fixed augmented graph, its message-passing complexity depends on the augmented graph size, independently of the one-time feature-induced neighborhood construction. Although the additional coordinator connections introduce $O(N+M^2)$ edges, the quadratic term is negligible in our experimental settings, where $M^2\ll N$. Therefore, the coordination structure introduces only $O(N)$ additional edges under this condition, resulting in $O(N+M)$ nodes and $O(|E|+N)$ edges in the augmented graph, while maintaining efficient message passing. Figure 6 further compares the empirical running time and accuracy of TSCGFM with GCOPE, MDGFM, and SAMGPT, demonstrating that TSCGFM maintains comparable computational efficiency while achieving consistently higher accuracy. We have revised Sections 5 to explicitly correct the cross-domain coordination complexity from $O(M)$ to $O(M^2)$.
W1. Structural concordance is too abstract. Although figure 1 shows its distribution across datasets, more visual examples would help readers understand this concept. Its connection to the learned embeddings and cross-domain transfer is also unclear.
A1. We thank the reviewer for this valuable suggestion. To provide a more intuitive understanding of structural concordance and its role in cross-domain knowledge transfer, we provide an additional visual illustration (see Figure or Figure 2 in the revised manuscript) comparing three coordination mechanisms for multi-domain graph pre-training.
(1) Visual illustration of hierarchical coordination. The figure illustrates three different ways of organizing information exchange across graph domains. The left subfigure shows isolated pre-training, where graphs are processed independently without cross-domain connections or message passing. The middle subfigure illustrates GCOPE, which introduces graph-specific virtual coordinators to facilitate cross-domain communication. However, its coordination mechanism primarily operates at the graph level, without explicitly distinguishing nodes according to their local structural characteristics. In contrast, the right subfigure illustrates our proposed hierarchical coordination framework, which introduces complementary high- and low-concordance coordinators, node-wise adaptive routing, and global meta coordination. This design explicitly accounts for node-level structural heterogeneity within each graph, enabling more fine-grained cross-domain knowledge exchange rather than treating all nodes within a domain uniformly.
(2) How structural concordance facilitates cross-domain knowledge transfer. As illustrated in Figure 1, although the distributions of structural concordance differ across graph domains, each graph contains nodes exhibiting varying concordance levels, including relatively high- and low-concordance nodes. This observation motivates organizing cross-domain knowledge transfer according to local topology–feature agreement rather than graph identity alone.
Specifically, as shown in Figure or Figure 2 in the revised manuscript, for each graph m, we introduce two virtual coordinators: a high-concordance coordinator cmh and a low-concordance coordinator cml. Each node u is connected to both coordinators, with routing weights determined by its structural concordance score su. Nodes v with higher concordance scores assign greater routing weights avh to cmh and smaller weights avl to cml, whereas nodes with lower concordance scores exhibit the opposite routing preference. These concordance-conditioned connections allow nodes with different local topology–feature relationships to receive different mixtures of coordinator information, thereby influencing their learned representations.
Furthermore, the global meta coordinator connects the graph-specific coordinators across domains, facilitating information exchange between corresponding concordance regimes in different graphs. Through this hierarchical mechanism, nodes exhibiting similar concordance levels across heterogeneous domains can preferentially benefit from shared information, while graph-specific coordinators preserve domain-specific characteristics. Thus, structural concordance serves not merely as a descriptive graph statistic, but as an explicit routing signal that shapes representation learning and organizes cross-domain knowledge transfer.