6.3.9 · D3Interpretability & Explainability

Worked examples — Activation patching

3,552 words16 min readBack to topic

This page is the drill ground for Activation patching. The parent note built the machinery: clean input, corrupted input, patch a component, measure how much of the behavioural gap you closed. Here we do something different — we take that one idea and push it into every corner where it behaves strangely, so that when you run a real patching experiment nothing surprises you.

Before we start, three symbols we will lean on constantly.

Now the one number we keep computing — the parent's causal fraction:

That last sentence already tells you this number is not automatically trapped in . The parent note said "Fraction ∈ [0,1]" as the happy case — this page is where we meet the unhappy cases.


The scenario matrix

Every patching experiment lands in one of these cells. The examples below hit each one at least once.

# Cell (the "case class") What's weird about it Example
A Clean textbook case — patch fully restores , the ideal Ex 1
B Sign flip: negative CF — patch hurts numerator negative Ex 2
C Overshoot: CF > 1 — patched beats clean patched run better than clean Ex 3
D Zero / degenerate denominator — clean = corrupt you can't divide; formula undefined Ex 4
E Partial + hierarchy — need multiple components one alone gives fraction, sum gives whole Ex 5
F Redundancy: negative synergy — two heads overlap Ex 6
G Limiting behaviour — patch the whole model vs nothing boundary values and forced Ex 7
H Wrong-metric trap — same patch, two metrics disagree metric choice changes the conclusion Ex 8
I Real-world word problem — end to end translate a story into values Ex 9
J Exam twist — direction of patching reversed patch clean→corrupt (noising) not corrupt→clean Ex 10
Figure — Activation patching

Figure s01 — the CF map. A horizontal number line for . Tick marks sit at and . The strip left of 0 is shaded red ("patch broke it"), the strip between 0 and 1 is shaded green ("partial / full fix"), and the strip right of 1 is shaded yellow ("overshoot"). Coloured dots mark where five of our examples land: Ex 2 at (red), Ex 7a at , Ex 1 at (green), Ex 7b at , and Ex 3 at (yellow). Keep glancing back — every example is a dot somewhere on this line.


Cell A — the clean textbook case


Cell B — the patch makes things worse


Cell C — patched beats clean (overshoot)


Cell D — the degenerate case (you cannot divide)


Cell E — partial effects that add up (hierarchy)


Cell F — redundancy shows up as negative synergy


Cell G — the two limiting endpoints


Cell H — the metric decides the conclusion


Cell I — a real-world word problem, end to end


Cell J — the exam twist: patch the other direction


Recall Self-test (reveal after answering)

What does CF = 0 mean? ::: The patch closed none of the gap — patched loss equals corrupt loss (patching nothing, Ex 7a). What does CF > 1 mean? ::: Overshoot — the patched run is better than the fully clean run (Ex 3). Why can CF be undefined? ::: Clean and corrupt behave identically → denominator is zero → no gap to attribute (Ex 4). A head gives high CF for denoising but ~0 for noising — trustworthy? ::: Weakly; the gold standard needs both directions high (Ex 10). Two heads: . Redundant or synergistic? ::: Redundant — synergy (Ex 6).