Daily Tech Briefing
AI 科技速览

每天 5 分钟内学习 AI。获取最新的人工智能新闻,理解其重要性,并学习如何将其应用于您的工作。

AI 快讯
arXiv Machine Learning · 2026/7/30 04:00:00

RAGuard: A Layered Defense Framework for Retrieval-Augmented Generation Systems Against Data Poisoning

AI 中文解读
RAGuard给AI的“知识搜身”系统装上了双层防盗门。检索增强生成(RAG)技术让大模型从外部资料库里找答案,但坏人可能往资料库里塞假信息“投毒”,让AI给出错误回答。RAGuard的第一层训练检索器主动降低假信息的排名,像给可疑文档贴“不推荐”标签;第二层更巧妙——它偷偷拿掉某份资料,看AI的回答有没有突然“变脸”,如果移除后回答明显不同,说明那份资料很可能是毒药。实验显示,即便资料库里有30%的假信息,这套防线也能把攻击成功率打到零,而且正常检索能力几乎不受影响,每查一次只多花几秒钟验证。对普通人来说,这意味着未来用AI查资料、问客服、写报告会更靠谱——即便有人想通过篡改公开信息来误导AI,这套机制也能让AI保持清醒。当然,对关键词故意不改的“伪君子”式投毒,传统检索器(如BM25)反而更扛打,这为防御边界划了一条分水岭。
arXiv:2607.26339v1 Announce Type: new Abstract: Retrieval-Augmented Generation (RAG) systems ground large language models (LLMs) in external corpora, but this reliance exposes them to corpus poisoning: maliciously injected passages that manipulate retrieved evidence. We introduce RAGuard, a layered defense against \emph{factual} corpus-poisoning attacks on RAG pipelines. The first layer adversarially fine-tunes a dense retriever on synthetic poisoned documents (fabricated facts, contradictions, and reasoning traps), teaching it to downrank malicious passages before generation. The second layer, the Zero-Knowledge Inference Patch ZKIP, is a label-free, black-box filter: for each retrieved document, it performs a leave-one-out decode and scores the document by the semantic shift and output-entropy change that its removal induces. ZKIP requires no poison labels, no ground-truth answers, and no access to model internals; it compares the model's own answers under counterfactual contexts. On poisoned Natural Questions at 5--30\% poison ratios, adversarial retriever training alone reduces but does not eliminate attack success, while ZKIP drives the measured attack success rate to 0.000 in every defended configuration, keeping Recall@5 within 0.03 of the clean-corpus baseline. Supervised analyses on both Natural Questions and BEIR (NFCorpus) confirm that the counterfactual signals ZKIP relies on carry learnable poison structure. The defense costs $k{+}1$ generator passes per query ($6\times$ for $k{=}5$); we analyze batching and early-stopping approximations that reduce this overhead. We also show that keyword-preserving poisons leave lexical retrievers such as BM25 essentially unaffected, an observation that delineates the boundary of the threat model. Code, datasets, and evaluation harnesses are released for reproducibility.
分享
阅读原文