跳到正文
arXiv cs.AI· Petru Neague, Quinten Stokkink, Martijn de Vos, Rafael Pires, Mathis Randl, Anne-Marie Kermarrec, Johan Pouwelse·· 4 小时前AI 评分37

ZeroRAG:面向去中心化 RAG 的自适应语义对等路由

ZeroRAG: Adaptive Semantic Peer Routing for Decentralized Retrieval-Augmented Generation

AI 导读

论文提出 ZeroRAG,一种用于 RAG 文档检索的去中心化路由层,在对等节点覆盖网络中执行语义查询路由,无需全局数据结构或中心化协调,文档始终保留在所有者节点上。在三种真实负载和两个去中心化基线上的评测显示,ZeroRAG 在召回率和所需网络消息数上优于基线,接近中心化文档存储的召回与 LLM 回答准确率,可在灾难性节点故障后自愈,并扩展到 100000 个节点。

正文 · 原文

View PDF HTML (experimental)

Abstract:Retrieval-augmented generation (RAG) is a standard approach to enhance the reliability of large language model (LLM) outputs by retrieving documents relevant to a query and supplying them in the LLM prompt. Today's RAG systems collect, index, and serve these documents from centralized stores. In practice, however, documents are owned by organizations, devices, and individuals who cannot or will not surrender custody of them to a central party, e.g., because of privacy, copyright or regulatory compliance. Existing modern decentralized retrieval techniques either reintroduce a coordinating authority, or rely on a global data structure that requires continuous network-wide coordination (e.g., DHTs). We present ZeroRAG, a decentralized routing layer for document retrieval in RAG that performs semantic query routing across an overlay of peers with- out global data structures or centralized orchestration. Documents remain with the peers that own them, and each peer keeps only lightweight local state: a bounded set of neighbor advertisements and a cache of recently routed queries. Using these, ZeroRAG steers each query through a best-first walk that progressively rewires the overlay toward semantically relevant neighbors, so recall improves over time as the network self-organizes. We evaluate ZeroRAG using three real-world workloads and two decentralized baselines. We find that ZeroRAG outperforms baselines in terms of recall and required network messages, approaches the recall and LLM answer accuracy of a centralized document store, self-heals after catastrophic peer failures, and scales to 100 000 peers.
Comments: 14 pages, 8 figures
Subjects: Distributed, Parallel, and Cluster Computing (cs.DC); Artificial Intelligence (cs.AI); Information Retrieval (cs.IR); Networking and Internet Architecture (cs.NI)
ACM classes: H.3.3; H.2.4; C.2.4
Cite as: arXiv:2611.07928 [cs.DC]
  (or arXiv:2611.07928v1 [cs.DC] for this version)
  https://doi.org/10.48550/arXiv.2611.07928

arXiv-issued DOI via DataCite (pending registration)

Related DOI: https://doi.org/10.1145/3801927.3858412

DOI(s) linking to related resources

Submission history

From: Petru Neague [view email]
[v1] Thu, 5 Nov 2026 12:33:45 UTC (6,686 KB)

来源:arXiv cs.AI · arxiv.org