REVIEW 5 cited by
GraphText: Graph Reasoning in Text Space
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
GraphText: Graph Reasoning in Text Space
read the original abstract
Large Language Models (LLMs) have gained the ability to assimilate human knowledge and facilitate natural language interactions with both humans and other LLMs. However, despite their impressive achievements, LLMs have not made significant advancements in the realm of graph machine learning. This limitation arises because graphs encapsulate distinct relational data, making it challenging to transform them into natural language that LLMs understand. In this paper, we bridge this gap with a novel framework, GraphText, that translates graphs into natural language. GraphText derives a graph-syntax tree for each graph that encapsulates both the node attributes and inter-node relationships. Traversal of the tree yields a graph text sequence, which is then processed by an LLM to treat graph tasks as text generation tasks. Notably, GraphText offers multiple advantages. It introduces training-free graph reasoning: even without training on graph data, GraphText with ChatGPT can achieve on par with, or even surpassing, the performance of supervised-trained graph neural networks through in-context learning (ICL). Furthermore, GraphText paves the way for interactive graph reasoning, allowing both humans and LLMs to communicate with the model seamlessly using natural language. These capabilities underscore the vast, yet-to-be-explored potential of LLMs in the domain of graph machine learning.
Forward citations
Cited by 5 Pith papers
-
Formalizing and Mitigating Structural Distortion in LLM Attention for Graph Reasoning
Rotary embeddings create bandwidth-dependent attention decay during graph linearization; GaLA corrects this at inference time to boost performance on text-attributed graphs.
-
GraphReview: Scientific Paper Evaluation via LLM-Based Graph Message Passing
GraphReview models paper evaluation as LLM-driven message passing on a semantic paper graph that links intrinsic quality, contemporaneous papers, and prior work, then applies Personalized PageRank for ranking and revi...
-
Bridging Input Feature Spaces Towards Graph Foundation Models
ALL-IN projects node features to a random shared space and uses covariance operators to produce representations invariant to input feature permutations and orthogonal transformations, enabling transfer across graph datasets.
-
Revisiting Graph-Tokenizing Large Language Models: A Systematic Evaluation of Graph Token Understanding
GTokenLLMs do not fully understand graph tokens, exhibiting over-sensitivity or insensitivity to instruction changes and relying heavily on text for reasoning even when graph information is preserved.
-
AgentGL: Towards Agentic Graph Learning with LLMs via Reinforcement Learning
AgentGL is an RL-driven LLM agent framework for agentic graph learning that uses graph-native tools and curriculum training to outperform GraphLLM and GraphRAG baselines by up to 17.5% on node classification and 28.4%...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.