ContextRAG: Extraction-Free Hierarchical Graph Construction for Retrieval-Augmented Generation
Roman Prosvirnin, Sergei Kuznetsov, Seungmin Jin

TL;DR
ContextRAG introduces a novel graph construction method for retrieval-augmented generation that eliminates reliance on large language models for entity and relation extraction, reducing costs and maintaining competitive performance.
Contribution
It presents a new extraction-free hierarchical graph construction approach using fuzzy concept graphs, significantly lowering indexing costs compared to traditional LLM-dependent methods.
Findings
ContextRAG reduces indexing calls from 870 to 30 on a 130-task dataset.
It achieves 33.6% F1 score on a multi-task benchmark.
Fuzzy concept graph nodes improve retrieval effectiveness.
Abstract
Graph-structured retrieval-augmented generation (RAG) systems can improve answer quality on multi-hop questions, but many current systems rely on large language models (LLMs) to extract entities, relations, and summaries during indexing. These calls add token and wall-clock costs that grow with corpus size. We present ContextRAG, a graph RAG system whose graph topology is constructed without LLM-based entity or relation extraction. ContextRAG derives a fuzzy concept graph over chunk embeddings using residual-quantization k-means and Formal Concept Analysis with Lukasiewicz residuated logic. Bridge-like and meet-derived context nodes are induced by soft fuzzy join and meet operations, rather than by LLM-written graph edges. On a 130-task UltraDomain subset, ContextRAG builds its index with 30 LLM calls and 22,073 tokens. In contrast, a local HiRAG reproduction stress test required 870…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
