跳到主要导航 跳到搜索 跳到主要内容

Formulating and Unveiling In-context Learning over Graph Tasks

  • Chunhui Zhang
  • , Lizhong Ding*
  • , Pengqi Li
  • , Jiarun Fu
  • , Peng Yang
  • , Yanyu Ren
  • , Tianlong Gu
  • , Liang Chang
  • , Ye Yuan
  • , Guoren Wang
  • *此作品的通讯作者
  • Beijing Institute of Technology
  • Jinan University
  • Guilin University of Electronic Technology

科研成果: 期刊稿件文章同行评审

摘要

In-context learning (ICL) enables large language models (LLMs) to adapt to new tasks by conditioning on demonstrations, without updating model parameters. While recent studies have examined the ICL capabilities of LLMs over graph tasks, the mechanism by which demonstrations influence model behavior remains difficult to formalize and poorly understood. In this paper, we present thorough formulations, innovative mechanisms, and comprehensive benchmarks for investigating ICL over graph tasks. We introduce the first unified formulation that explicitly models demonstration number, graph structure, and task category over graph tasks, enabling independent variation of these factors and systematic analysis of their effects. We unveil how demonstrations in graph tasks activate the ICL capabilities of LLMs, showing that LLMs adjust their predictions by weighting and aggregating the representations of the query and demonstrations. We introduce two new benchmarks designed to enable rigorous evaluation under controlled structural and task variations, comprising a total of 17,155 graph questions across graphs of varying sizes and multiple task categories. Using these benchmarks, our experiments explore how demonstrations activate the ICL capabilities of LLMs over graph tasks from the perspectives of demonstration number, graph structure, and task category, and provide empirical support for the proposed formulations and mechanisms. The benchmarks and code are available at: https://github.com/zhangchunhui2024/Graph-ICL .

源语言英语
期刊论文编号104581
期刊Information Fusion
137
DOI
出版状态已出版 - 1月 2027
已对外发布

学术指纹

探究 'Formulating and Unveiling In-context Learning over Graph Tasks' 的科研主题。它们共同构成独一无二的学术指纹。

引用此