Dynamic Bundling with Large Language Models for Zero-Shot Inference on Text-Attributed Graphs
Yusheng Zhao, Qixin Zhang, Xiao Luo, Weizhi Zhang, Zhiping Xiao, Wei Ju, Philip S. Yu, Ming Zhang
Abstract
Large language models (LLMs) have been used in many zero-shot learning problems, with their strong generalization ability. Recently, adopting LLMs in textattributed graphs (TAGs) has drawn increasing attention. However, the adoption of LLMs faces two major challenges: limited information on graph structure and unreliable responses. LLMs struggle with text attributes isolated from the graph topology. Worse still, they yield unreliable predictions due to both information insufficiency and the inherent weakness of LLMs (e.g., hallucination). Towards this end, this paper proposes a novel method named Dynamic Text Bundling Supervision (DENSE) that queries LLMs with bundles of texts to obtain bundlelevel labels and uses these labels to supervise graph neural networks. Specifically, we sample a set of bundles, each containing a set of nodes with corresponding texts of close proximity. We then query LLMs with the bundled texts to obtain the label of each bundle. Subsequently, the bundle labels are used to supervise the optimization of graph neural networks, and the bundles are further refined to exclude noisy items. To justify our design, we also provide theoretical analysis of the proposed method. Extensive experiments across ten datasets validate the effectiveness of the proposed method. Preprint. Under review.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 48d887e6-9d9f-4a52-9f7d-a8efd612fadbCited by top-tier papers2
- Beyond One-Size-Fits-All: Adaptive Subgraph Denoising for Zero-Shot Graph Learning with Large Language ModelsFengzhi Li, Liang Zhang, Yuan Zuo, Ruiqing Zhao et al.KDD 2026 · 1 citation
- Sample Lottery: Unsupervised Discovery of Critical Instances for LLM ReasoningZhiping Xiao, Yusheng Zhao, Qixin Zhang, Jiaye Xie et al.ICLR 2026
Builds on24
- Beyond Homophily in Graph Neural Networks: Current Limitations and Effective DesignsJiong Zhu, Yujun Yan, Lingxiao Zhao, Mark Heimann et al.NeurIPS 2020 · 1,490 citations
- GraphMAE: Self-Supervised Masked Graph AutoencodersZhenyu Hou, Xiao Liu, Yukuo Cen, Yuxiao Dong et al.KDD 2022 · 533 citations
- Graph Neural Networks with HeterophilyJiong Zhu, Ryan A. Rossi, Anup Rao, Tung Mai et al.AAAI 2021 · 393 citations
- One For All: Towards Training One Graph Model For All Classification TasksHao Liu, Jiarui Feng, Lecheng Kong, Ningyue Liang et al.ICLR 2024 · 253 citations
- Talk like a Graph: Encoding Graphs for Large Language ModelsBahare Fatemi, Jonathan Halcrow, Bryan PerozziICLR 2024 · 194 citations
Related papers
- Generalization Principles for Inference over Text-Attributed Graphs with Large Language ModelsHaoyu Peter Wang, Shikun Liu, Rongzhe Wei, Pan LiICML 2025
- LLMs Are Noisy Oracles! LLM-based Noise-aware Graph Active Learning for Node ClassificationZeang Sheng, Weiyang Guo, Yingxia Shao, Wentao Zhang et al.KDD 2025 · 1 citation
- Leveraging Large Language Models for Node Generation in Few-Shot Learning on Text-Attributed GraphsJianxiang Yu, Yuxiang Ren, Chenghua Gong, Jiaqi Tan et al.AAAI 2025 · 32 citations
- Leveraging Large Language Models for Effective Label-free Node Classification in Text-Attributed GraphsTaiyan Zhang, Renchi Yang, Yurui Lai, Mingyu Yan et al.SIGIR 2025 · 3 citations
- GNN-as-Judge: Unleashing the Power of LLMs for Graph Learning with GNN FeedbackRuiyao Xu, Kaize DingICLR 2026 · 5 citations
