arXiv:2608.15919cs.IRcs.AI2026-08

Noesis通过双向图检索与自适应并行,实现跨知识库精准推理。

Noesis: Bidirectional Graph-RAG with Adaptive Parallelism and Cross-Knowledge-Base Semantic Discovery

论文配图:Noesis: Bidirectional Graph-RAG with Adaptive Parallelism and Cross-Knowledge-Base Semantic Discovery
图 1 · 摘自论文原文
  • 双向图遍历+反馈上下文解析,模拟人类阅读记忆衰减。
  • 23倍加速无崩溃,12GB显卡上6.3倍提速,支持多跳跨域推理。
  • 适合需要高精度、小模型部署的领域知识问答系统。

基于知识图谱的检索增强生成(Graph-RAG)已成为将大语言模型锚定在特定领域语料中的强大范式。但现有系统存在三大局限:(1) 静态分块导致长文档跨段落语义断裂;(2) 数据摄入管道缺乏自适应扩展能力;(3) 多领域部署需单一大型知识库(降低检索精度)或手动用户路由。本文提出Noesis,一种解耦式Graph-RAG架构,通过四项算法解决上述问题:(a) 双向图遍历结合图反馈上下文解析器,模拟人类阅读中记忆衰退过程;(b) 基于AIMD并发控制器(源自TCP拥塞控制),实现23倍加速且零内存溢出;(c) Moesis:针对MoE模型的领域感知选择性量化,在12GB消费级显卡上实现6.3倍加速;(d) Mesh:跨知识库语义路由与运行时结构发现机制,使小型本地模型具备多跳跨域推理能力。在HotpotQA数据集(1,000个问题)上,Noesis达到59.5 EM / 74.7 F1,相比GraphRAG提升27.8 EM,且使用35B本地模型构建图谱而非GPT-4o。对193页原文的源文本验证显示,对长程因果边的提取精度达90%,远超传统分块独立抽取方法。

原文摘要 · Abstract (English)

Retrieval-Augmented Generation over knowledge graphs (Graph-RAG) has emerged as a powerful paradigm for grounding large language models in domain-specific corpora. However, existing systems face persistent limitations: (1) static chunking fragments long documents, losing cross-section semantic connections; (2) ingestion pipelines do not scale adaptively; and (3) multi-domain deployments require either a monolithic knowledge base that dilutes retrieval precision or manual user routing. We present Noesis, a decoupled Graph-RAG architecture addressing these limitations through four algorithms: (a) Bidirectional Graph Traversal with a Graph-Feedback Context Resolver simulating human reading with degrading memory; (b) an AIMD Concurrency Controller adapted from TCP congestion control, achieving 23x speedup with zero OOM events; (c) Moesis, domain-aware selective quantization for MoE models achieving 6.3x speedup on 12 GB consumer GPUs; and (d) Mesh, cross-KB semantic routing with runtime structural discovery enabling small on-premises models to perform multi-hop cross-domain reasoning. On HotpotQA (1,000 questions), Noesis achieves 59.5 EM / 74.7 F1, surpassing GraphRAG by +27.8 EM while using a 35B on-premises model for graph construction rather than GPT-4o. Source text verification on a 193-page document confirms 90% precision on long-range causal edges inaccessible to chunk-independent extraction.

知识图谱RAG推理优化多跳问答

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。