Joint Embeddings for Graph Instruction Tuning

Aaron Haag, Vlad Argatu, Oliver Lohse
5/31/2024
cs.SEcs.CL

No confident code implementation found for this paper.

Abstract

Large Language Models (LLMs) have achieved impressive performance in text understanding and have become an essential tool for building smart assistants. Originally focusing on text, they have been enhanced with multimodal capabilities in recent works that successfully built visual instruction following assistants. As far as the graph modality goes, however, no such assistants have yet been developed. Graph structures are complex in that they represent relation between different features and are permutation invariant. Moreover, representing them in purely textual form does not always lead to good LLM performance even for finetuned models. As a result, there is a need to develop a new method to integrate graphs in LLMs for general graph understanding. This work explores the integration of the graph modality in LLM for general graph instruction following tasks. It aims at producing a deep learning model that enhances an underlying LLM with graph embeddings and trains it to understand them and to produce, given an instruction, an answer grounded in the graph representation. The approach performs significantly better than a graph to text approach and remains consistent even for larger graphs.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{haag2024joint,
  title  = {Joint Embeddings for Graph Instruction Tuning},
  author = {Aaron Haag and Vlad Argatu and Oliver Lohse},
  year   = {2024},
  eprint = {2405.20684},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2405.20684v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2405.20684.svg)](https://codeofpaper.com/paper/2405.20684)

Discussion