Equation 5 · A History of Multimodal AI
What does this equation mean?
Read the formula alongside the article passage below. Each part has a deeper page with its role in the equation, the supporting passage and nearby citations.
This equation states an equality: the expressions on both sides have the same value under the article’s assumptions. Read the equation part by part below; each part has a contextual explanation and a link to its mathematical background.
Read it piece by piece
Symbol B
B occurs below the fraction bar. The quantity above the bar is divided by this expression; zero is excluded as a denominator.
Symbol i
i appears in the bound of this sum. The bound states where the repeated operation starts, ends, or which values it includes.
Symbol j
j occurs below the fraction bar. The quantity above the bar is divided by this expression; zero is excluded as a denominator.
Symbol v_j
occurs below the fraction bar. The quantity above the bar is divided by this expression; zero is excluded as a denominator.
Symbol u_j
occurs below the fraction bar. The quantity above the bar is divided by this expression; zero is excluded as a denominator.
=
The expressions on both sides represent the same quantity under the stated assumptions.
See an illustrated explanation →subscript
The lower label selects a particular version, component, or indexed member of the quantity. For example, x₀ and xₜ can be values at different positions.
superscript
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.
See an illustrated explanation →Denominator: 2B
The complete quantity below the fraction bar; it must be nonzero for this division.
Starting index or lower bound: i=1
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.
Ending index or upper bound: B
This label says where the repeated addition, multiplication, or accumulation stops. It sets the last term or end of the range.
Numerator: exp(langle u_i, v_irangle/τ)
The complete quantity above the fraction bar.
See an illustrated explanation →Denominator: sum_j=1^Bexp(langle u_i, v_jrangle/τ)
The complete quantity below the fraction bar; it must be nonzero for this division.
See an illustrated explanation →Starting index or lower bound: j=1
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.
Ending index or upper bound: B
This label says where the repeated addition, multiplication, or accumulation stops. It sets the last term or end of the range.
Numerator: exp(langle u_i, v_irangle/τ)
The complete quantity above the fraction bar.
See an illustrated explanation →Denominator: sum_j=1^Bexp(langle u_j, v_irangle/τ)
The complete quantity below the fraction bar; it must be nonzero for this division.
See an illustrated explanation →Starting index or lower bound: j=1
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.
Ending index or upper bound: B
This label says where the repeated addition, multiplication, or accumulation stops. It sets the last term or end of the range.
How to interpret it
With a fixed numerator, increasing a nonzero denominator reduces the fraction. Read it with the definitions, units, and assumptions supplied by the article.
What the article says around this equation
Radford and colleagues’ 2021 paper, “Learning Transferable Visual Models From Natural Language Supervision,” is usually remembered simply as CLIP, and the compression loses the specific thing that made it a turning point rather than an incremental improvement. The method itself is not exotic: encode an image, encode its paired caption, and train both encoders so that the true pairing scores higher than every mismatched pairing drawn from the same batch. For a batch of B image-text pairs with normalised image embedding , text embedding , and a learned temperature , the symmetric form of the objective is . an image-to-text and a text-to-image cross-entropy…
Read the full surrounding passage
Radford and colleagues’ 2021 paper, “Learning Transferable Visual Models From Natural Language Supervision,” is usually remembered simply as CLIP, and the compression loses the specific thing that made it a turning point rather than an incremental improvement. The method itself is not exotic: encode an image, encode its paired caption, and train both encoders so that the true pairing scores higher than every mismatched pairing drawn from the same batch. For a batch of B image-text pairs with normalised image embedding , text embedding , and a learned temperature , the symmetric form of the objective is . an image-to-text and a text-to-image cross-entropy averaged together, each treating every other pairing in the batch as a negative. Nothing in that objective is architecturally new; matching objectives had been used for retrieval before CLIP. What changed was scale, and what the scale was spent on: 400 million image-text pairs collected from the public internet, with no hand-assigned category label anywhere in the pipeline [ 5 ] .
Sources cited in the surrounding passage
These citations give research context. Read each source to check which claims it supports.
Return to A History of Multimodal AI