Thank you for taking the time to review our rebuttal. We are grateful for the increased score and are enthusiastic about addressing your remaining concerns to enhance our submission further.
> Question 1
We appreciate your feedback on feature-wise CL, and will elaborate on its mechanism in the revised paper. In addition to rows, columns of feature matrix also have semantic information. [1] proposed that these columns could be regarded as representations of clusters. It is possible to consider the columns as soft labels for features and to perform discrimination among groups of similar features. This approach inspires us to learn generalizable node representations for LLM, independent of other instances [1], enhancing transferability across datasets.
To obtain node representations understandable by LLMs, we employ PCA to select the top k principal components from the LLM token embedding space. Given that in high-dimensional spaces, vectors are almost invariably orthogonal [2], these k principal components serve as the axes that maximize variance in the LLM token embedding space. By projecting the original feature matrix onto these k principal components and then applying FC, we can achieve node representations that are aligned with LLM and possess enhanced generalizability.
Existing experimental results have confirmed that FC indeed achieves more generalizable node representations, playing a crucial role in handling cross-task challenges. Additionally, we report the legality rate of the model without FC (more about legality rate see Appendix B.1). Results in **bold** indicate the **poorest** outcomes, indicating a minimal impact on the language model by FC. This further demonstrates that FC yields node representations that are more easily understood by LLMs.
||Arxiv|Computer|Pubmed|Cora|Children|History|Photo|Sports|
|:----:|:----:|:----:|:----:|:----:|:----:|:----:|:----:|:----:|
|Vicuna-7B-v1.5|**99.3**|**96.7**|100.0|95.8|99.2|98.9|94.1|99.6 |
|LLaGA|100.0|100.0|**98.9**|**79.9**|93.1|**92.4**|**77.8**|**94.3**|
|TEA-GLM (without FC)|100.0|100.0|100.0|89.0|**92.9**|99.6|98.4|98.1|
|TEA-GLM|100.0|100.0|100.0|92.6|97.0|99.6|99.2|98.5|
> Question 2
Our approach of mapping a single node representation to multiple LLM tokens (graph tokens) is not meant to introduce new or extra information. Rather, it ensures that the complex information within graph structures is adequately conveyed. Our experiments on the number of graph tokens (Figure 3, Appendix C) confirm the necessity of multiple tokens. This approach achieves SOTA zero-shot performance without fine-tuning the LLM, demonstrating its novelty.
> Question 3
Our code is publicly available, and if necessary, we can provide the trained model files. Appendix D includes the prompt for the link prediction task. For instance, for citation datasets, the LLM would respond with either 'These two papers have citation relationships' or 'These two papers may not have citation relationships'.
> Question 4
We agree on the importance of pooling information. Our design avoids inputting all neighboring node tokens into the prompt, as the order significantly influences the LLM's output, conflicting with the graph's node permutation invariance. We use a readout operation to extract representations, then map them to a fixed number of graph tokens.
We conducted experiments using both mean and max readout operations, though due to time constraints, these were limited to citation datasets. The results clearly show that the choice of readout operation influences the experimental outcomes. However, both sum and mean readout operations produced effective results, enabling the model to perform inference successfully. This suggests that an OOD (Out-of-Distribution) scenario may not be present. A possible reason is that, in GNNs, node representations are computed as a weighted sum of the central node and its neighbors. Since both sum and mean readout operations are essentially special cases of a weighted sum, the link representations generated still align with the distribution of node representations produced by GNNs. Therefore, the OOD scenario may not be applicable in this context.
Thank you once more for your constructive feedback. We have enhanced the presentation to provide a clearer explanation of the key concepts in our paper. We believe that our revisions adequately address your concerns. **We would greatly appreciate it if you could consider raising your score further.** If you have any further concerns, we are ready to address them quickly to enhance our submission.
||Arxiv|Pubmed|Cora|
|:----:|:----:|:----:|:----:|
|Vicuna-7B|0.513|0.543|0.527|
|GraphGPT-std|0.649|0.501|0.520|
|LLaGA|0.570|0.569|0.537|
|SoftPrompt|0.537|0.535|0.565|
|TEA-GLM(max)|0.639|0.650|0.566|
|TEA-GLM(sum)|0.657|0.689|0.586|
|TEA-GLM(mean)|**0.659**|**0.690**|**0.588**|
[1] Li Y, et al. Contrastive clustering. AAAI. 2021.
[2] Hopcroft, et al. Computer Science in the Information Age. 2017.