arXiv Machine Learning

On the Token Collapse Phenomenon in Textual Graph Soft Prompting

The paper investigates graph soft prompting, where a graph neural network generates graph-specific tokens for large language model prompts. It identifies a problem called token collapse, in which these tokens become nearly identical across different inputs, rendering them ineffective at conveying graph information. The authors show that even simple constant prompts can match or outperform collapsed tokens, and propose a two‑stage method to produce more varied tokens while maintaining performance.

arXiv Machine Learning
Sep 4

LLM as GNN: Graph Vocabulary Learning for Text-Attributed Graph Foundation Models

The paper introduces PromptGFM, a Graph Foundation Model designed for text‑attributed graphs (TAGs). It integrates Large Language Models (LLMs) and Graph Neural Networks (GNNs) through a Graph Understanding Module that prompts LLMs to emulate GNN workflows, and a Graph Inference Module that creates a language‑based graph vocabulary for better alignment and scalability. Experiments show PromptGFM outperforms existing methods and transfers effectively across various graphs and tasks.

By Xi Zhu, Haochen Xue, Ziwei Zhao, Wujiang Xu, Jingyuan Huang, Minghao Guo, Qifan Wang, Kaixiong Zhou, Imran Razzak, Yongfeng Zhang
arXiv Machine Learning
Jun 11

GraphInfer-Bench: Benchmarking LLM's Inference Capability on Graphs

arXiv:2606. 11562v1 Announce Type: new Abstract: Graph analysis underlies many applications whose answers cannot be looked up in a single record or retrieved along a path: laundering rings, drug repurposing, user preference, and scientific theme are all inferred from a node together with its neighbourhood.

By Zhuoyi Peng, Jingzhou Jiang, Hanlin Gu, Lixin Fan, Yi Yang