REVIEW 13 cited by
Language is All a Graph Needs
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
read the original abstract
The emergence of large-scale pre-trained language models has revolutionized various AI research domains. Transformers-based Large Language Models (LLMs) have gradually replaced CNNs and RNNs to unify fields of computer vision and natural language processing. Compared with independent data samples such as images, videos or texts, graphs usually contain rich structural and relational information. Meanwhile, language, especially natural language, being one of the most expressive mediums, excels in describing complex structures. However, existing work on incorporating graph problems into the generative language modeling framework remains very limited. Considering the rising prominence of LLMs, it becomes essential to explore whether LLMs can also replace GNNs as the foundation model for graphs. In this paper, we propose InstructGLM (Instruction-finetuned Graph Language Model) with highly scalable prompts based on natural language instructions. We use natural language to describe multi-scale geometric structure of the graph and then instruction finetune an LLM to perform graph tasks, which enables Generative Graph Learning. Our method surpasses all GNN baselines on ogbn-arxiv, Cora and PubMed datasets, underscoring its effectiveness and sheds light on generative LLMs as new foundation model for graph machine learning. Our code is open-sourced at https://github.com/agiresearch/InstructGLM.
Forward citations
Cited by 13 Pith papers
-
Enhancing Large Language Model for Knowledge Graph Completion via Structure-Aware Alignment-Tuning
SAT uses hierarchical contrastive alignment and a unified graph instruction to tune a lightweight adapter for knowledge graph completion, reporting large link prediction gains.
-
Harnessing Adaptive Topology Representations for Zero-Shot Graph Question Answering
DynamicTRF learns question-level preferences over eight graph representations and routes each query to the best one, improving zero-shot graph QA accuracy and output brevity on seven algorithmic and two downstream tasks.
-
Quantizing Text-attributed Graphs for Semantic-Structural Integration
STAG quantizes fused graph-structure and text embeddings into discrete tokens from a frozen LLM vocabulary, enabling competitive few-shot and zero-shot node classification with or without an LLM.
-
Efficient Text-Attributed Graph Learning through Selective Annotation and Graph Alignment
GAGA matches or exceeds state-of-the-art accuracy on several text-attributed graph benchmarks while requiring large language model annotations for only 1% of nodes or edges.
-
Are Large Language Models Good Temporal Graph Learners?
TGTalker prompts LLMs with the most recent edges and neighbor history of a temporal graph, achieving link prediction accuracy competitive with specialized temporal graph neural networks on five real-world datasets.
-
MLaGA: Multimodal Large Language and Graph Assistant
MLaGA extends LLM-based graph reasoning from text-only graphs to multimodal graphs with image and text node attributes via a structure-aware aligner and multimodal instruction tuning.
-
TrustGLM: Evaluating the Robustness of GraphLLMs Against Prompt, Text, and Structure Attacks
GraphLLMs are broadly vulnerable to text, graph structure, and prompt label attacks, but the severity depends heavily on the model and dataset.
-
Graph-MLLM: Harnessing Multimodal Large Language Models for Multimodal Graph Learning
A unified comparison across six multimodal graph datasets shows that fine-tuned multimodal LLMs used as direct predictors achieve the highest node classification accuracy, even without graph structure input.
-
Masked Language Models are Good Heterogeneous Graph Generalizers
A masked language model fine-tuned on metapath-derived text and cloze-style task templates transfers across heterogeneous graph datasets better than HGNN and LLM baselines, though link prediction results are compromis...
-
NOCL: Node-Oriented Conceptualization LLM for Graph Tasks without Message Passing
NOCL lets an LLM handle node, edge, and graph tasks on text and non-text graphs by compressing each node's description into one semantic embedding and turning the graph into a text prompt.
-
Intellectual Property in Graph-Based Machine Learning as a Service: Attacks and Defenses
A systematic review that organizes graph-ML IP protection into model-level and data-level attacks and defenses, and ships a benchmark library, PyGIP.
-
DistRAG: Towards Distance-Based Spatial Reasoning in LLMs
Retrieving distance facts from a spatial graph improves LLM answers to direct and nearest-city distance questions, while complex distance-comparison questions remain unsolved.
-
Graph Prompting for Graph Learning Models: Recent Advances and Future Directions
A survey of graph prompting methods that categorizes them by the stage at which prompts are applied: data, representation, or task.
Discussion (0). Continue with ORCID to comment.