Papers

ZeroRAG:无需中心节点的去中心化 RAG 检索路由方案

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

Why we picked it

数据不想交给中心服务器也能做 RAG 了,这篇论文的 ZeroRAG 不需要 DHT 也能路由到 10 万节点,做隐私检索的可以看看。

arXiv 论文 ZeroRAG 提出一种去中心化的 RAG 文档检索路由层,文档始终留在所有者节点,每个节点只保存邻居广告和已路由查询的轻量缓存。查询通过 best-first 随机行走逐步把覆盖网络重连到语义相关的邻居,召回率随网络自组织而提升。在 3 个真实工作负载和 2 个去中心化基线的评测中,ZeroRAG 的召回率和 LLM 答案准确率接近集中式文档库,并能在灾难性节点故障后自愈,可扩展到 10 万节点。

Original · arXiv cs.AI

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

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.