2024/02/08 by Bryan Perozzi, Bahare Fatemi, Perozzi, Bryan +11 · 18 citations
Biochemistry, Genetics and Molecular Biology · Computer Science · Decision Sciences · #Artificial Intelligence (cs.AI) #Biomedical Text Mining and Ontologies #FOS: Computer and information sciences #I.2.6 #I.2.7 #I.5.1 #Machine Learning (cs.LG) #Machine Learning (stat.ML) #Scientific Computing and Data Management #Semantic Web and Ontologies #Social and Information Networks (cs.SI)
paper · pdf · doi:10.48550/arxiv.2402.05862
openalex publication_date 2024/02/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.