AIAny
Icon for item

RAGU: A Multi-Step GraphRAG Engine with a Compact Domain-Adapted LLM

Builds structured knowledge graphs for retrieval-augmented generation via a multi-step GraphRAG pipeline that separates extraction from consolidation. Key features include typed two-stage extraction, DBSCAN-backed deduplication, LLM summarization, Leiden community detection, and a compact 7B extractor model (Meno-Lite-0.1).

Introduction

Most GraphRAG systems extract entities and relations in a single pass, which yields noisy entities and brittle retrieval. The paper's core insight is that the in-pipeline LLM mainly needs language skills (comprehension, extraction, reasoning over context) that scale weakly with model size, so a compact, domain‑adapted 7B extractor can match or beat much larger models for knowledge-graph construction.

Key Findings
  • Pipeline separation: RAGU splits extraction and consolidation into typed two-stage extraction followed by DBSCAN-based deduplication, LLM summarization, and Leiden community detection — this reduces noisy, duplicated entities and improves retrieval precision.
  • Compact extractor works: Meno‑Lite‑0.1 (7B, optimized for language skills) outperforms Qwen2.5-32B on knowledge-graph construction by +12.5% relative harmonic mean, and matches larger models on English GraphRAG tasks.
  • Better context recall and synthesis: On GraphRAG-Bench (Medical), RAGU retrieves more complete contexts (evidence recall up to 0.84 vs ≤0.76) and surpasses HippoRAG2 on synthesis tasks; apparent multi-hop QA advantages for rivals were largely due to answer-format artifacts.
  • Practical constraints: RAGU is modular, runs on a single GPU, installable via pip, and released under an MIT license, making it accessible for applied workflows without massive infra.
Who it's for and trade-offs

Great fit if you need higher-quality retrieval context for downstream LLM generation and want a reproducible, modular pipeline that runs on modest hardware. It favors domains where extraction and consolidation logic can be engineered (typed schemas, dedup rules) and where a compact, task-tuned LLM suffices. Look elsewhere if you require end-to-end factual knowledge beyond the provided context (global world knowledge not encoded in the pipeline) or if your use case depends on models pretrained with specific factual corpora rather than language-skill optimization.

Where it fits

RAGU sits between lightweight RAG setups (simple retrieval + prompt) and heavyweight, closed-source multibillion models: it prioritizes structured context quality and pipeline cleanliness over raw model scale, making it appealing for domain-specific GraphRAG applications and medical/technical benchmarks.

Information

  • Websitearxiv.org
  • AuthorsMikhail Komarov, Ivan Bondarenko, Stanislav Shtuka, Oleg Sedukhin, Roman Shuvalov, Yana Dementyeva, Matvey Solovyov, Nikolay O. Nikitin
  • Published date2026/07/13

More Items

Introduces Declarative Attention (DA), a zero-shot protocol that has LMs declare which parts of long context to attend to during chain-of-thought, letting the runtime build dynamic attention masks and skip most KV-cache reads. Produces large token savings (up to ~52% on Gemma-4-31B) with modest accuracy loss.

Generates compact keyword sets for both queries and items with LLMs and matches them directly via an inverted index. Uses supervised fine-tuning to align keyword spaces, then alternates GRPO-based reinforcement learning on query- and item-side generators to co-evolve representations and maximize retrieval F1 while staying compatible with keyword-based infrastructure.

Studies looping shared transformer layers in Mixture-of-Experts models under matched budgets and proposes SMELT: loop the middle half twice while matching per-token FLOPs, non-embedding parameters, and KV cache. Shows 6.8–18.0% training-FLOPs savings on the compute-optimal frontier, stronger downstream gains on code and long-context tasks.