Joint Embeddings for Graph Instruction Tuning
Aaron Haag, Vlad Argatu, Oliver Lohse

TL;DR
This paper introduces a method to integrate graph embeddings into large language models, enabling them to understand and respond to graph-based instructions more effectively than traditional text-based approaches.
Contribution
It presents a novel approach for embedding graphs into LLMs, improving their ability to understand and process graph instructions beyond text-only methods.
Findings
Significantly outperforms graph-to-text methods
Maintains performance with larger graphs
Enhances LLMs with graph understanding capabilities
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…
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.
Taxonomy
TopicsModel-Driven Software Engineering Techniques · Software Testing and Debugging Techniques · Semantic Web and Ontologies
