← All parts of this equation

Equation 6 · Part 15 · Retrieval Is an Evidence System, Not a Memory

superscript

p(y∣x)≈∑z∈Zk(x)pη(z∣x)∏i=1∣y∣pθ(yi∣x,z,y1:i−1)p(y \mid x) \approx \sum_{z \in \mathcal{Z}_k(x)} p_\eta(z \mid x) \prod_{i=1}^{|y|} p_\theta\left(y_i \mid x, z, y_{1:i-1}\right)
superscript

What this part means

A raised number can be a power. When it is a label or bound, it selects a case or the upper limit of a sum; the formula’s structure distinguishes these uses.

Its job in the formula

A raised mark can be a power or an index. Its position and the surrounding notation determine which.

The passage around this formula

The retrieval literature said the opposite. Lewis and colleagues introduced RAG explicitly as a combination of parametric and non-parametric memory, and the architectural point is that the second is a different kind of object, not an extension of the first [ 1 ] . Their formulation treats the retrieved passage as a latent variable to be marginalised over. Writing x for the query, y for the output, and Zk(x)\mathcal{Z}_k(x) for the top k passages returned by a retriever with parameters η\eta : p(y∣x)≈∑z∈Zk(x)pη(z∣x)∏i=1∣y∣pθ(yi∣x,z,y1:i−1)p(y \mid x) \approx \sum_{z \in \mathcal{Z}_k(x)} p_\eta(z \mid x) \prod_{i=1}^{|y|} p_\theta\left(y_i \mid x, z, y_{1:i-1}\right). Read the structure rather than the arithmetic. The generator is never conditioned on the corpus. It is conditioned on z — one span, or a handful — and its output distribution is a…

Read this part in the article →

Learn the underlying idea

An exponent tells how a base is used in multiplication. In x³, x is the base and 3 is the exponent: x³ = x × x × x.

Open the illustrated exponents: repeated multiplication and powers guide →

Sources cited in the surrounding passage

These citations provide research context; check each source for the exact claim it supports.