Retrieval-Augmented Generation

Augmenting language models with non-parametric memory — retrieving evidence at inference time from documents, knowledge graphs, or external stores to ground generation in verifiable, up-to-date information.


frontier tier

A retrieval-augmented language model decomposes language modelling into two stages: a retriever that surfaces evidence relevant to the prompt from an external store, and a generator that conditions on both the prompt and the retrieved evidence to produce its output. The premise is that the parametric memory of a large language model is necessarily lossy, stale, and hard to attribute, while a non-parametric store — a corpus of documents, a search index, a knowledge graph — can be updated, audited, and cited. The two-stage architecture trades a small amount of latency for sharply improved factuality, recency, and provenance.

The retrieval side draws on decades of work in information retrieval: BM25 and other lexical scoring methods, dense passage retrieval based on dual-encoder embeddings, and learned hybrid scoring. Two design choices dominate: what to retrieve (passages, full documents, structured triples) and how to integrate the retrieved content (in-context concatenation, fusion-in-decoder, cross-attention to retrieved tokens). The generation side is typically a standard transformer language model, but the choice of how it consumes evidence determines whether retrieval improves or hurts coherence.

A particularly active subfield augments language models with knowledge graphs rather than free text. Linking entities mentioned in the prompt to graph nodes, then injecting relevant triples or subgraphs into the generation context, lets the model reason over structured relations that are difficult to learn purely from sequence prediction. Yang et al. survey this design space and propose a framework for fact-aware language modeling that injects knowledge-graph evidence at training and inference time, contrasting it with retrieval over textual corpora and analysing where each excels.

Open problems span the full pipeline: training the retriever and generator jointly, deciding when not to retrieve (most queries do not benefit), evaluating retrieval-grounded outputs at scale, mitigating distractor passages, handling multi-hop and structured queries, and integrating retrieval with tool-use and agentic loops. The field continues to bridge classical IR, knowledge representation, and modern transformer training — making it one of the most consequential applied research areas in language modelling today.

Prerequisites

Sources

In context

Where this topic sits in the prerequisite graph. Click any node to jump.

Open in full atlas →

Reviewed by


Review this topic

This page was drafted by an agent and is waiting on expert review. Spotted a wrong prerequisite, a missing concept, a misattributed source, or a factual slip? Tell us — your review opens a tracked issue maintainers act on.