arXiv:2608. 04444v1 Announce Type: cross Abstract: Large language models (LLMs) often generate inaccurate answers due to their reliance on static internal knowledge.
arXiv:2603.28773v2 Announce Type: replace-cross Abstract: Large language models (LLMs) frequently generate confident yet factually incorrect content when used for language generation (a phenomenon of...
arXiv:2609.14528v1 Announce Type: cross Abstract: Multi-Hop Knowledge Graph Question Answering (KGQA) tasks require models to assemble relational evidence along paths in a KG to answer natural-langua...
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.
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.
arXiv:2608. 13160v1 Announce Type: cross Abstract: Multilingual retrieval-augmented generation (mRAG) equips large language models with access to globally distributed external knowledge for complex multilingual question answering.
arXiv:2607. 06527v1 Announce Type: cross Abstract: Multi-hop Question Answering over Knowledge Graphs faces a critical challenge: traditional retrieve-then-read pipelines break differentiability, preventing the retriever from learning to bridge the semantic gap where intermediate nodes lack lexical overlap with the query.
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:2505.13994v3 Announce Type: replace Abstract: Retrieval-Augmented Generation (RAG) systems empower large language models (LLMs) with external knowledge, yet struggle with efficiency-accuracy tr...
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.
arXiv:2609.39786v1 Announce Type: new Abstract: Large language models (LLMs) are increasingly combined with knowledge graphs (KGs) to ground reasoning in structured evidence. However, most LLM-based...
arXiv:2510. 16302v2 Announce Type: replace Abstract: Multi-hop reasoning for question answering (QA) plays a critical role in retrieval-augmented generation (RAG) for modern large language models (LLMs).
The paper introduces DRAG, a query‑adaptive framework that jointly selects retriever and generator configurations for Retrieval‑Augmented Generation (RAG) systems. Two variants are presented: DRAG_QPP, a training‑free routing method using Query Performance Prediction and perplexity signals, and DRAG_SFT, a supervised approach that fine‑tunes an LLM to predict configurations. Experiments on three LLM families and four QA benchmarks show that DRAG_QPP matches strong static baselines while cutting inference latency, and DRAG_SFT consistently outperforms both static and training‑free adaptive baselines, demonstrating a better effectiveness‑efficiency trade‑off.