← Back to article

Equation 3 · Running an Interpretability Investigation That Holds Up

What does this equation mean?

Pk=1−(1−α)k,P_k = 1-(1-\alpha)^k,

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.

Inputs and operations1-(1-α)^k
Result or conditionP_k
How to read the two sides of this formula. Follow the article passage for the meaning of each quantity.

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

PkP_k

Symbol P_k

the probability that at least one clears by chance alone across k independently tested components.

Understand this part →

α\alpha

Symbol α

α is one of the signed contributions combined to compute the quantity on the left.

Understand this part →

kk

Symbol k

k is part of the quantity the equation computes from the expression on the right.

Understand this part →

=

=

The expressions on both sides represent the same quantity under the stated assumptions.

Understand this part →

See an illustrated explanation →
subscript

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.

Understand this part →

superscript

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.

Understand this part →

See an illustrated explanation →

How to interpret it

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

What the article says around this equation

The reason this ordering matters is not procedural fussiness. Zhang and Nanda’s systematic study of activation patching found that the choice of corruption distribution and evaluation metric — decisions usually made informally, late, and sometimes after a first look at the data — can by itself change which components a patching sweep identifies as important [ 3 ] . If the metric is chosen after the sweep, on the grounds that it produced the most legible result, the investigation has stopped testing a hypothesis and started constructing one to fit the data. The same failure has a clean statistical description. Sweep enough components at a nominal per-test false-positive rate α\alpha and report…
Read the full surrounding passage
The reason this ordering matters is not procedural fussiness. Zhang and Nanda’s systematic study of activation patching found that the choice of corruption distribution and evaluation metric — decisions usually made informally, late, and sometimes after a first look at the data — can by itself change which components a patching sweep identifies as important [ 3 ] . If the metric is chosen after the sweep, on the grounds that it produced the most legible result, the investigation has stopped testing a hypothesis and started constructing one to fit the data. The same failure has a clean statistical description. Sweep enough components at a nominal per-test false-positive rate α\alpha and report only the one that clears threshold, and the probability that at least one clears by chance alone across k independently tested components is Pk=1−(1−α)kP_k = 1-(1-\alpha)^k. which climbs toward certainty well before k reaches the size of a typical layer-by-layer or head-by-head sweep. A held-out set of prompts, reserved and untouched until the hypothesis is fixed, is the practical fix, and it only works if the hypothesis really was fixed first.

Read the equation in its article →

Sources cited in the surrounding passage

These citations give research context. Read each source to check which claims it supports.

Return to Running an Interpretability Investigation That Holds Up

See this formula across 1 published context →

Browse the mathematical compendium →