Less is More: Making Smaller Language Models Competent Subgraph Retrievers for Multi-hop KGQA (2410.06121v1)

Abstract: Retrieval-Augmented Generation (RAG) is widely used to inject external non-parametric knowledge into LLMs. Recent works suggest that Knowledge Graphs (KGs) contain valuable external knowledge for LLMs. Retrieving information from KGs differs from extracting it from document sets. Most existing approaches seek to directly retrieve relevant subgraphs, thereby eliminating the need for extensive SPARQL annotations, traditionally required by semantic parsing methods. In this paper, we model the subgraph retrieval task as a conditional generation task handled by small LLMs. Specifically, we define a subgraph identifier as a sequence of relations, each represented as a special token stored in the LLMs. Our base generative subgraph retrieval model, consisting of only 220M parameters, achieves competitive retrieval performance compared to state-of-the-art models relying on 7B parameters, demonstrating that small LLMs are capable of performing the subgraph retrieval task. Furthermore, our largest 3B model, when plugged with an LLM reader, sets new SOTA end-to-end performance on both the WebQSP and CWQ benchmarks. Our model and data will be made available online: https://github.com/hwy9855/GSR.