Plain Transformers are Surprisingly Powerful Link Predictors
Quang Truong, Yu Song, Donald Loveland, Mingxuan Ju, Tong Zhao, Neil Shah, Jiliang Tang

TL;DR
This paper introduces PENCIL, a simple encoder-only Transformer model for link prediction that captures complex graph structures efficiently, outperforming more complex methods and challenging the need for elaborate engineering.
Contribution
PENCIL demonstrates that a plain Transformer with local subgraph attention can effectively perform link prediction, reducing complexity and improving scalability compared to existing GNN and GT approaches.
Findings
PENCIL outperforms heuristic-informed GNNs in link prediction tasks.
PENCIL is more parameter-efficient than ID-embedding-based models.
PENCIL remains competitive even without node features.
Abstract
Link prediction is a core challenge in graph machine learning, demanding models that capture rich and complex topological dependencies. While Graph Neural Networks (GNNs) are the standard solution, state-of-the-art pipelines often rely on explicit structural heuristics or memory-intensive node embeddings -- approaches that struggle to generalize or scale to massive graphs. Emerging Graph Transformers (GTs) offer a potential alternative but often incur significant overhead due to complex structural encodings, hindering their applications to large-scale link prediction. We challenge these sophisticated paradigms with PENCIL, an encoder-only plain Transformer that replaces hand-crafted priors with attention over sampled local subgraphs, retaining the scalability and hardware efficiency of standard Transformers. Through experimental and theoretical analysis, we show that PENCIL extracts…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Neural Networks · Graph Theory and Algorithms · Complex Network Analysis Techniques
