← Mathematical compendium

Published equation contexts

p(y∣x)=∑z∈Zk(x)pη(z∣x) pθ(y∣x,z)p(y \mid x) = \sum_{z \in \mathcal{Z}_k(x)} p_\eta(z \mid x)\,p_\theta(y \mid x,z)

Why this formula appears here

Retrieval-augmented generation is routinely marketed as “giving the model your data.” The original RAG formulation was more precise: combine parametric memory in a sequence model with non-parametric memory in an external index. A simplified sequence-level expression is p(y∣x)=∑z∈Zk(x)pη(z∣x) pθ(y∣x,z)p(y \mid x) = \sum_{z \in \mathcal{Z}_k(x)} p_\eta(z \mid x)\,p_\theta(y \mid x,z). where the retriever assigns probability to documents z and the generator conditions on a selected set Zk(x)\mathcal{Z}_k(x) [ 6 ] . The decomposition matters because retrieval and generation fail differently.

Read the full article-specific guide →

Read the representative guide

pp

Symbol p

p appears in the conditional probability being evaluated. The vertical bar identifies the information or condition supplied to that probability.

Read this term in its guide →
yy

Symbol y

y appears in the conditional probability being evaluated. The vertical bar identifies the information or condition supplied to that probability.

Read this term in its guide →
xx

Symbol x

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

Read this term in its guide →
zz

Symbol z

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

Read this term in its guide →
Zk\mathcal{Z}_k

Symbol Z_k

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

Read this term in its guide →
z∈Zk(x)z \in \mathcal{Z}_k(x)

Starting index or lower bound: z in Z_k(x)

This label says where the repeated addition, multiplication, or accumulation starts. Read its value or condition together with the article’s description of the index.

Read this term in its guide →

How to interpret it

Read it with the definitions, units, and assumptions supplied by the article.

Research cited beside this formula

Published contexts (1)

A symbol can carry a different meaning in another article. Each occurrence keeps its own guide and term definitions.

p(y∣x)=∑z∈Zk(x)pη(z∣x) pθ(y∣x,z),p(y \mid x) = \sum_{z \in \mathcal{Z}_k(x)} p_\eta(z \mid x)\,p_\theta(y \mid x,z),

Equation 7 · AI Agents & Systems

Reliable AI Agents Are Control Systems, Not Chatbots

This equation states an equality: the expressions on both sides have the same value under the article’s assumptions.

Retrieval-augmented generation is routinely marketed as “giving the model your data.” The original RAG formulation was more precise: combine parametric memory in a sequence model with non-parametric memory in an external index. A simplified sequence-level expression is p(y∣x)=∑z∈Zk(x)pη(z∣x) pθ(y∣x,z)p(y \mid x) = \sum_{z \in \mathcal{Z}_k(x)} p_\eta(z \mid x)\,p_\theta(y \mid x,z). where the retriever assigns probability to documents z and the generator conditions on a selected set Zk(x)\mathcal{Z}_k(x) [ 6 ] . The decomposition matters because retrieval and generation fail differently.

Equation guide → · Article →