UltRAG: a Universal Simple Scalable Recipe for Knowledge Graph RAG
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
The Flow has not summarised this story yet — read it at arXiv Machine Learning.
arXiv:2606. 05901v1 Announce Type: cross Abstract: Large language models (LLMs) have fundamentally transformed the landscape of Natural Language Processing.
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.
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.
arXiv:2511.04473v3 Announce Type: replace Abstract: Retrieval of information from graph-structured knowledge bases represents a promising direction for improving the factuality of LLMs. While various...
arXiv:2606. 17856v1 Announce Type: new Abstract: Graph-based retrieval-augmented generation (GraphRAG) is effective for knowledge-intensive and multi-hop query tasks; however, many existing methods primarily seed entity-based graphs and rely on implicit semantic relevance propagation.
R$^{2}$Adapter is a lightweight plug‑in that dynamically routes user queries between vanilla and graph‑based Retrieval‑Augmented Generation (RAG) systems. By sending only those queries that truly benefit from graph reasoning, it cuts graph‑retrieval overhead by up to 59% while keeping answer accuracy comparable. The adapter also rewrites uncertain graph‑routed queries to better expose multi‑hop reasoning needs, improving retrieval quality without extra supervision.