Let Your Graph Do the Talking: Encoding Structured Data for LLMs

• URL: http://arxiv.org/abs/2402.05862v1
• Date: Thu, 8 Feb 2024 17:51:44 GMT
• Title: Let Your Graph Do the Talking: Encoding Structured Data for LLMs
• Authors: Bryan Perozzi, Bahare Fatemi, Dustin Zelle, Anton Tsitsulin, Mehran Kazemi, Rami Al-Rfou, Jonathan Halcrow
• Abstract summary: We introduce a parameter-efficient method to explicitly represent structured data for large language models (LLMs) Our method, GraphToken, learns an encoding function to extend prompts with explicit structured information. We show that explicitly representing the graph structure allows significant improvements to graph reasoning tasks.
• Score: 22.358472780103057
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: How can we best encode structured data into sequential form for use in large language models (LLMs)? In this work, we introduce a parameter-efficient method to explicitly represent structured data for LLMs. Our method, GraphToken, learns an encoding function to extend prompts with explicit structured information. Unlike other work which focuses on limited domains (e.g. knowledge graph representation), our work is the first effort focused on the general encoding of structured data to be used for various reasoning tasks. We show that explicitly representing the graph structure allows significant improvements to graph reasoning tasks. Specifically, we see across the board improvements - up to 73% points - on node, edge and, graph-level tasks from the GraphQA benchmark.

Related papers

• Are Large Language Models In-Context Graph Learners? [31.172657860606297]
  Large language models (LLMs) have remarkable in-context reasoning capabilities across a wide range of tasks. However, they struggle to handle structured data, such as graphs, due to their lack of understanding of non-Euclidean structures. We show that learning on graph data can be conceptualized as a retrieval-augmented generation (RAG) process. We propose a series of RAG frameworks to enhance the in-context learning capabilities of LLMs for graph learning tasks.
  arXiv  Detail & Related papers  (2025-02-19T09:14:19Z)
• GraphiT: Efficient Node Classification on Text-Attributed Graphs with Prompt Optimized LLMs [0.0]
  GraphiT (Graphs in Text) is a framework for encoding graphs into a textual format. We show how GraphiT leads to measurably better results without prompt tweaking.
  arXiv  Detail & Related papers  (2025-02-14T19:38:41Z)
• An Automatic Graph Construction Framework based on Large Language Models for Recommendation [49.51799417575638]
  We introduce AutoGraph, an automatic graph construction framework based on large language models for recommendation. LLMs infer the user preference and item knowledge, which is encoded as semantic vectors. Latent factors are incorporated as extra nodes to link the user/item nodes, resulting in a graph with in-depth global-view semantics.
  arXiv  Detail & Related papers  (2024-12-24T07:51:29Z)
• NT-LLM: A Novel Node Tokenizer for Integrating Graph Structure into Large Language Models [26.739650151993928]
  Graphs are a fundamental data structure for representing relationships in real-world scenarios. Applying Large Language Models (LLMs) to graph-related tasks poses significant challenges. We introduce Node Tokenizer for Large Language Models (NT-LLM), a novel framework that efficiently encodes graph structures.
  arXiv  Detail & Related papers  (2024-10-14T17:21:57Z)
• Parameter-Efficient Tuning Large Language Models for Graph Representation Learning [62.26278815157628]
  We introduce Graph-aware. Efficient Fine-Tuning - GPEFT, a novel approach for efficient graph representation learning. We use a graph neural network (GNN) to encode structural information from neighboring nodes into a graph prompt. We validate our approach through comprehensive experiments conducted on 8 different text-rich graphs, observing an average improvement of 2% in hit@1 and Mean Reciprocal Rank (MRR) in link prediction evaluations.
  arXiv  Detail & Related papers  (2024-04-28T18:36:59Z)
• GraphEdit: Large Language Models for Graph Structure Learning [62.618818029177355]
  Graph Structure Learning (GSL) focuses on capturing intrinsic dependencies and interactions among nodes in graph-structured data. Existing GSL methods heavily depend on explicit graph structural information as supervision signals. We propose GraphEdit, an approach that leverages large language models (LLMs) to learn complex node relationships in graph-structured data.
  arXiv  Detail & Related papers  (2024-02-23T08:29:42Z)
• Large Language Models on Graphs: A Comprehensive Survey [77.16803297418201]
  We provide a systematic review of scenarios and techniques related to large language models on graphs. We first summarize potential scenarios of adopting LLMs on graphs into three categories, namely pure graphs, text-attributed graphs, and text-paired graphs. We discuss the real-world applications of such methods and summarize open-source codes and benchmark datasets.
  arXiv  Detail & Related papers  (2023-12-05T14:14:27Z)
• GraphGPT: Graph Instruction Tuning for Large Language Models [27.036935149004726]
  Graph Neural Networks (GNNs) have evolved to understand graph structures. To enhance robustness, self-supervised learning (SSL) has become a vital tool for data augmentation. Our research tackles this by advancing graph model generalization in zero-shot learning environments.
  arXiv  Detail & Related papers  (2023-10-19T06:17:46Z)
• Integrating Graphs with Large Language Models: Methods and Prospects [68.37584693537555]
  Large language models (LLMs) have emerged as frontrunners, showcasing unparalleled prowess in diverse applications. Merging the capabilities of LLMs with graph-structured data has been a topic of keen interest. This paper bifurcates such integrations into two predominant categories.
  arXiv  Detail & Related papers  (2023-10-09T07:59:34Z)
• Can LLMs Effectively Leverage Graph Structural Information through Prompts, and Why? [18.328637750057037]
  Large language models (LLMs) are gaining increasing attention for their capability to process graphs with rich text attributes. We aim to understand why the incorporation of structural information inherent in graph data can improve the prediction performance of LLMs.
  arXiv  Detail & Related papers  (2023-09-28T16:58:37Z)
• Structural Adapters in Pretrained Language Models for AMR-to-text Generation [59.50420985074769]
  Previous work on text generation from graph-structured data relies on pretrained language models (PLMs) We propose StructAdapt, an adapter method to encode graph structure into PLMs.
  arXiv  Detail & Related papers  (2021-03-16T15:06:50Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.