UniGTE: Unified Graph-Text Encoding for Zero-Shot Generalization across Graph Tasks and Domains
This addresses the problem of zero-shot generalization across diverse graph tasks and domains for researchers and practitioners in graph machine learning, representing a novel method rather than an incremental improvement.
The paper tackles the challenge of generalizing to unseen graph tasks without task-specific supervision by introducing UniGTE, a framework that unifies structural and semantic reasoning, achieving new state-of-the-art zero-shot results across node classification, link prediction, graph classification, and graph regression in cross-task and cross-domain settings.
Generalizing to unseen graph tasks without task-specific supervision is challenging: conventional graph neural networks are typically tied to a fixed label space, while large language models (LLMs) struggle to capture graph structure. We introduce UniGTE, an instruction-tuned encoder-decoder framework that unifies structural and semantic reasoning. The encoder augments a pretrained autoregressive LLM with learnable alignment tokens and a structure-aware graph-text attention mechanism, enabling it to attend jointly to a tokenized graph and a natural-language task prompt while remaining permutation-invariant to node order. This yields compact, task-aware graph representations. Conditioned solely on these representations, a frozen LLM decoder predicts and reconstructs: it outputs the task answer and simultaneously paraphrases the input graph in natural language. The reconstruction objective regularizes the encoder to preserve structural cues. UniGTE is instruction-tuned on five datasets spanning node-level, edge-level, and graph-level tasks across diverse domains, yet requires no fine-tuning at inference. It achieves new state-of-the-art zero-shot results on node classification, link prediction, graph classification, and graph regression under cross-task and cross-domain settings, demonstrating that tight integration of graph structure with LLM semantics enables robust, transferable graph reasoning.