arXiv AI By Jyotin Goel, Abhinav Arun, Tejas Prakash Agarwal, Bhaskarjit Sarmah, Stefano Pasquali

ArcRAG: Agentic Compositional Retrieval over Knowledge Graphs

Read the original on arXiv AI →

ArcRAG is a retrieval-augmented generation system that operates over knowledge graphs without relying on construction‑specific schemas or relation names. It dynamically induces a query‑local graph interface at inference time, plans multi‑hop traversals, and executes them as Cypher queries. Experiments on MuSiQue, HotpotQA, and TriviaQA show that ArcRAG remains effective across both schema‑guided and open‑information‑extraction graph constructions, demonstrating that retrieval can be construction‑agnostic.

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 AI.

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
Jun 9

UnWeaving the knots of GraphRAG -- turns out VectorRAG is almost enough

arXiv:2603. 29875v3 Announce Type: replace-cross Abstract: One of the key problems in Retrieval-augmented generation (RAG) systems is that chunk-based retrieval pipelines represent the source chunks as atomic objects, mixing the information contained within such a chunk into a single vector.

By Ryszard Tuora, Mateusz Gali\'nski, Micha{\l} Godziszewski, Micha{\l} Karpowicz, Mateusz Czy\.znikiewicz, Adam Kozakiewicz, Tomasz Zi\k{e}tkiewicz
arXiv Machine Learning
Aug 27

A Storage-Retrieval Gap in Parametric Knowledge Graph Memory

The paper investigates a parametric approach to knowledge graph memory by compiling each entity into a LoRA adapter, enabling zero‑cost query-time retrieval via weight injection. On the MetaQA dataset, these adapters encode context‑free factual knowledge, improving exact‑match scores by up to +0.243 over a base model and achieving an oracle gap of +0.283. However, the stored knowledge is not recoverable through similarity or embedding‑based methods, indicating that knowledge is stored locally and does not transfer across semantically neighboring entities.

By Martino M. L. Pulici, Cuong Xuan Chu, Evgeny Kharlamov, Volker Tresp