arXiv Computation and Language By Ben Lagnese, Manas Gaur

SelfGraphRAG: Bridging the Supervision Gap in Graph-Based RAG with Synthetic QA Generation

Read the original on arXiv Computation and Language →

SelfGraphRAG is a framework that generates synthetic question‑answer pairs directly from the structure of a knowledge graph to train a query‑conditioned graph retriever. By capturing multi‑hop paths and local neighborhoods, the generated questions provide relational supervision without requiring manually labeled data. Experiments on multi‑hop question answering and classification tasks show that SelfGraphRAG improves retrieval precision and downstream reasoning performance compared to embedding‑based baselines.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Computation and Language.

arXiv AI
Jun 17

A Unified Framework for Context-Aware and Relation-Aware Graph Retrieval-Augmented Generation

arXiv:2606. 18075v1 Announce Type: new Abstract: Retrieval-Augmented Generation (RAG) has emerged as a paradigm for enhancing large language models (LLMs) with external knowledge, yet existing graph-based methods face a fundamental limitation: entity-centric and chunk-centric approaches operate on representations anchored to original text without true knowledge fusion.

By Haoyang Zhong, Yifei Sun, Antong Zhang, Chunping Wang, Lei Chen, Yang Yang
arXiv AI
Oct 9

GLM-RAG: Graph Language Models for Graph-Based Retrieval-Augmented Generation

GLM-RAG introduces a graph language model (GLM) based retriever for retrieval‑augmented generation over knowledge graphs. The study compares GLM‑based, graph neural network (GNN)‑based, and vector‑search retrievers across single‑ and multi‑hop settings, emphasizing transferability to unseen domains. Results show that finetuned GLM retrievers achieve state‑of‑the‑art performance on two multi‑hop benchmarks and generalize better out of domain, while GNN retrievers excel at graph coverage and vector‑search performs best on single‑hop tasks.

By Maya Arseven, Anette Frank, Beni Egressy, Johann Higl, Moritz Plenz