Efficient Text-Attributed Graph Learning through Selective Annotation and Graph Alignment
Abstract
In the realm of Text-attributed Graphs (TAGs), traditional graph neural networks (GNNs) often fall short due to the complex textual information associated with each node. Recent methods have improved node representations by leveraging large language models (LLMs) to enhance node text features, but these approaches typically require extensive annotations or fine-tuning across all nodes, which is both time-consuming and costly. To overcome these challenges, we introduce GAGA, an efficient framework for TAG representation learning. GAGA reduces annotation time and cost by focusing on annotating only representative nodes and edges. It constructs an annotation graph that captures the topological relationships among these annotations. Furthermore, GAGA employs a two-level alignment module to effectively integrate the annotation graph with the TAG, aligning their underlying structures. Experiments show that GAGA achieves classification accuracies on par with or surpassing state-of-the-art methods while requiring only 1\
Benchmark Results
Tested on 3 datasets 15 baseline values reported too low
Tables show presented results in global context (best 3 papers + GCN + MLP).
Classic
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | GraphSAGE+CNA | 0.9418
±0.0033 | |
| 2 | GCN+CNA | 0.9366
±0.0048 | |
| 3 | TransformerConv | 0.9350
±0.0058 | |
| 11 | ENGINE | 0.9148
±0.0010 | This paper |
| 14 | TAPE | 0.9119
±0.0012 | prev best: Graph Agent: Explicit Reasoning Agent for Graphs (2023) |
| 15 | InstructGLM | 0.9077 best reported | best at pub: Graph Agent: Explicit Reasoning Agent for Graphs (2023) |
| 21 | GCN | 0.9004 best reported | best at pub: Understanding Heterophily for Graph Neural Networks (ICML 2024) |
| 26 | GAGA | 0.8967
±0.0012 | This paper |
| 39 | SAGE | 0.8911
±0.0012 | prev best: Efficient Tuning and Inference for Large Language Models on Textual Graphs (IJCAI 2024) |
| 40 | RevGAT | 0.8911
±0.0010 | This paper |
| 93 | SimTEG | 0.8804
±0.0012 | This paper |
| 141 | GraphSAGE | 0.8708
±0.0085 | |
| 200 | GLEM | 0.8560
±0.0009 best reported | best at pub: Efficient Tuning and Inference for Large Language Models on Textual Graphs (IJCAI 2024) |
| 203 | GIANT | 0.8552
±0.0018 | This paper |
| 456 | Graphormer | 0.8262
±0.0012 best reported | best at pub: Language is All a Graph Needs (2023) best today: Toward a Unified Geometry Understanding: Riemannian Diffusion Framework for Graph Generation and Prediction (NeurIPS 2025) |
| 724 | MLP | 0.7768 best reported | best at pub: Understanding Heterophily for Graph Neural Networks (ICML 2024) |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | LGTL | 0.9518
±0.0011 | |
| 2 | MixHop (LO) | 0.9513
±0.0038 | |
| 3 | GraphSAGE (LO) | 0.9511
±0.0036 | |
| 10 | GAGA | 0.9462
±0.0020 | This paper |
| 12 | TAPE | 0.9431
±0.0015 | This paper |
| 15 | InstructGLM | 0.9384
±0.0015 | This paper |
| 18 | GCN | 0.9296
±0.0015 best reported | |
| 19 | GLEM | 0.9257
±0.0020 | This paper |
| 116 | SAGE | 0.8881
±0.0015 | prev best: Marginal Nodes Matter: Towards Structure Fairness in Graphs (KDD 2023) |
| 125 | GraphSAGE | 0.8864
±0.0030 | |
| 131 | RevGAT | 0.8850
±0.0020 | This paper |
| 151 | Graphormer | 0.8824
±0.0015 | This paper |
| 210 | MLP | 0.8690
±0.0074 best reported | best at pub: On the Equivalence of Graph Convolution and Mixup (TMLR 2023) Difference within reported uncertainty; not counted as underperformance. |
| 310 | GIANT | 0.8275
±0.0028 best reported | |
| 360 | SimTEG | 0.8120
±0.0001 | This paper |
| 803 | ENGINE | 0.7472
±0.0015 | This paper |
OGB
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | Jacobi | 0.8968 | |
| 2 | GPR | 0.8953 | |
| 3 | LEMP4HG | 0.8939 | |
| 4 | SAGE | 0.8933 best reported | |
| 6 | GCN | 0.8868 best reported | |
| 8 | RevGAT | 0.8859 best reported | |
| 15 | GLEM | 0.8736
±0.0007 best reported | best at pub: SimTeG: A Frustratingly ple Approach Improves xtual raph Learning (2023) |
| 39 | SimTEG | 0.8540
±0.0028 best reported | best at pub: SimTeG: A Frustratingly ple Approach Improves xtual raph Learning (2023) |
| 83 | GraphSAGE | 0.8287 | |
| 90 | TAPE | 0.8234
±0.0036 best reported | |
| 137 | GIANT | 0.8049
±0.0028 best reported | best at pub: Train Your Own GNN Teacher: Graph-Aware Distillation on Textual Graphs (2023) |
| 145 | ENGINE | 0.8005
±0.0015 | This paper |
| 171 | Graphormer | 0.7934
±0.0025 best reported | best at pub: Automatic Graph Topology-Aware Transformer (2024) |
| 195 | GAGA | 0.7887
±0.0018 | This paper |
| 351 | MLP | 0.6605
±0.0020 best reported | best at pub: SCR: Training Graph Neural Networks with Consistency Regularization (2021) best today: Latent Graph Inference using Product Manifolds (ICLR 2022) |
| 356 | InstructGLM | 0.6532
±0.0002 | This paper |
