about
Certifiably Robust RAG Against Retrieval Corruption (arxiv.org)
2 points by belter on May 28, 2024 | hide | past | pdf | discuss on HN

In plain words: It splits retrieved passages into separate groups, gets an answer from each group, then merges the answers so a few bad ones can't take over. Unlike usual filtering, it can formally guarantee answer quality even when an attacker injects malicious passages.

Abstract · Certifiably Robust RAG against Retrieval Corruption

Retrieval-augmented generation (RAG) is susceptible to retrieval corruption attacks, where malicious passages injected into retrieval results can lead to inaccurate model responses. We propose RobustRAG, the first defense framework with certifiable robustness against retrieval corruption attacks. The key insight of RobustRAG is an isolate-then-aggregate strategy: we isolate passages into disjoint groups, generate LLM responses based on the concatenated passages from each isolated group, and then securely aggregate these responses for a robust output. To instantiate RobustRAG, we design keyword-based and decoding-based algorithms for securely aggregating unstructured text responses. Notably, RobustRAG achieves certifiable robustness: for certain queries in our evaluation datasets, we can formally certify non-trivial lower bounds on response quality -- even against an adaptive attacker with full knowledge of the defense and the ability to arbitrarily inject a bounded number of malicious passages. We evaluate RobustRAG on the tasks of open-domain question-answering and free-form long text generation and demonstrate its effectiveness across three datasets and three LLMs.

Chong Xiang, Tong Wu, Zexuan Zhong, David Wagner, Danqi Chen, Prateek Mittal
arXiv:2405.15556 · cs.LG, cs.CL, cs.CR · submitted May 24, 2024 · updated Apr 1, 2026
abstract · pdf · html

add comment on HN