← All parts of this equation

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

Symbol x

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)
xx

What this part means

the writing.

Its job in the formula

x appears in the bound of this sum. The bound states where the repeated operation starts, ends, or which values it includes.

Where the article explains it

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).

The passage around this formula

…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…

Read this part in the article →

Learn the underlying idea

A variable is a named place for a value. Its letter is a local label: x can mean position in one formula and a data point in another.

Open the illustrated variables: a letter stands for a value guide →

See this notation across published equations →

Sources cited in the surrounding passage

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