What RAG Changes—and What It Cannot Guarantee
The original RAG design answers a practical question about language models: how can a generator use knowledge that is explicit, searchable, and replaceable without giving up the language ability stored in its parameters? The answer is a division of labor. A retriever routes candidate passages from an external text index, and a sequence-to-sequence generator turns the original input plus those candidates into an output. The final judgment is therefore conditional: RAG changes the model’s access to information and makes part of that access inspectable, but it does not make retrieval infallible, generation transparent, or an external corpus authoritative by itself.
That distinction is the thread connecting the system’s architecture, its two document-assignment formulations, its training objective, and its experiments. RAG is neither a parametric model with a detachable fact table nor a search engine that simply prints its best result. It is a probabilistic interface between stored text and generated language. The interface creates genuine capabilities, and it creates new places where a system can fail.
What the second memory genuinely changes
A parametric-only generator has one especially convenient property: its learned language behavior is always available. It can form sentences, connect ideas, and complete a response without a search step. But its factual memory is embedded in parameters rather than maintained as a plainly editable collection. Revising a fact is not the same as changing a row in a database. Inspecting an output does not straightforwardly reveal which learned association supplied each detail. The original RAG paper frames retrieval as a response to those limits, not as a claim that parameters have no value.
RAG preserves the generator because explicit text does not solve the whole problem of producing an answer. The index can provide a passage, but BART still has to interpret the question, select relevant information, preserve a sequence of prior decisions, and express the result in language. It can use a clue even when the exact answer is not written verbatim. It can combine a passage with associations in its parameters. It can turn a retrieved statement into a short answer, a longer explanation, a generated question, or a classification output. The generator is the part that converts available evidence into a task-shaped response.
The external memory contributes a different kind of control. In the paper’s experiment, it consists of raw text in a Wikipedia index. A person can inspect candidate passages rather than seeing only an opaque parameter state. The text collection can also be replaced without retraining the generator. That separation makes knowledge maintenance more direct: changing the index changes the material the retriever can offer at answer time, while the generator’s learned language ability remains in place.
The hot-swapping experiment makes this capability concrete. The authors compare a December 2016 Wikipedia index with a December 2018 index using questions about 82 world leaders whose answers changed between the snapshots. With the period-matched index, the model answers 70% of the 2016-leader questions correctly using the 2016 index and 68% of the 2018-leader questions correctly using the 2018 index. With the mismatched index, accuracy falls to 12% and 4% in the reported comparisons. The point is not that an index replacement guarantees freshness. It is that a change in external memory can measurably change the model’s behavior without retraining the generator.
That result clarifies what is and is not being updated. The non-parametric memory changes its accessible text. The parametric memory does not thereby receive a new training update. The query encoder still has to retrieve the relevant material, and the generator still has to use it. A newer index can contain a corrected or current passage, but it cannot guarantee that the passage is surfaced, that it is better than competing sources, or that the generator will preserve every qualification. Updateability belongs to one side of the interface.
The same division explains why retrieval can add value even when the retrieved passage is not a complete answer.