HopRank: Self-Supervised LLM Preference-Tuning on Graphs for Few-Shot Node Classification
Ziqing Wang, Kaize Ding

TL;DR
HopRank is a self-supervised framework that leverages graph topology and LLMs for node classification without labeled data, outperforming prior methods on TAG benchmarks.
Contribution
It reformulates node classification as link prediction, using hop-based sampling and adaptive preference learning to avoid label dependence.
Findings
HopRank matches fully-supervised GNNs in performance.
HopRank outperforms prior graph-LLM methods.
It achieves strong results with zero labeled data.
Abstract
Node classification on text-attributed graphs (TAGs) is a fundamental task with broad applications in citation analysis, social networks, and recommendation systems. Current GNN-based approaches suffer from shallow text encoding and heavy dependence on labeled data, limiting their effectiveness in label-scarce settings. While large language models (LLMs) naturally address the text understanding gap with deep semantic reasoning, existing LLM-for-graph methods either still require abundant labels during training or fail to exploit the rich structural signals freely available in graph topology. Our key observation is that, in many real-world TAGs, edges predominantly connect similar nodes under the homophily principle, meaning graph topology inherently encodes class structure without any labels. Building on this insight, we reformulate node classification as a link prediction task and…
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.
