ObserverBench: Testing Mechanistic Estimates for Intervention and Control
Summary
ObserverBench is a benchmark framework designed to evaluate whether internal estimators in AI models are adequate for guiding interventions, control, or safety tasks by reporting both estimation accuracy and downstream action performance.
View Cached Full Text
Cached at: 09/04/26, 06:20 AM
# ObserverBench: Testing Mechanistic Estimates for Intervention and Control
Source: [https://arxiv.org/html/2609.03026](https://arxiv.org/html/2609.03026)
September 1, 2026
###### Abstract
Mechanistic interpretability is increasingly used to guide interventions, such as steering activations, removing circuits, or enforcing safety boundaries\. But an internal estimate that is accurate on average can still lead to a poor decision when it is used to choose a specific action\.
We presentObserverBench, a benchmark framework for testing whether an internal estimator—an observer—is adequate for the intervention, control, or safety task it directs\. Each task fixes the model, information available to the observer, allowed actions, decision rule, unseen test cases, and loss\. ObserverBench reports both estimation accuracy and downstream action performance\. Its rankings are task\-specific: observers are compared only under the same information and action constraints\.
Our theory and experiments show three ways these criteria can differ:
- •Task\-relevant accuracy\.In a control loop, observer errors matter at the starting point and along directions the allowed intervention can reach\.
- •Prediction versus decision\.On circuit\-intervention tasks in GPT\-2\-small and Qwen2\.5\-7B, pairwise observers predict unseen intervention effects more accurately without always choosing better actions\. Observers trained to predict action loss directly choose lower\-loss actions\. On one Qwen APPS panel, a 127\-coefficient SAE readout has higher mean audit loss than its layer\-matched 3,584\-coordinate dense control, under a disclosed activation\-density mismatch \(observedL0=115L\_\{0\}=115versus reported240240\): compression without a better decision on that panel\.
- •Consequence\-aware safety\.Under fixed intervention budgets, a score that perfectly separates policy violations can allocate actions poorly when violations have different costs\. On matched Qwen2\.5\-7B, Gemma\-2\-9B\-it, and prospectively frozen Qwen3\.5\-9B APPS tasks, residual access leads on average, but the lowest\-loss context changes—even between the two Qwen checkpoints—and AUROC can rank monitors differently from deployment loss\. On Qwen3\.5, an official Qwen\-Scope SAE probe also trails its dense source residual under a declared base\-to\-posttraining checkpoint mismatch\.
ObserverBench provides a common way to evaluate interpretability methods through the actions they enable\.
## 1Introduction
Interpretability methods are increasingly used to steer and govern model behavior rather than merely explain it\. Internal estimates now guide concrete decisions: which activation\-steering direction to apply, which attention heads to remove, whether to permit a risky tool call, or which requests receive a limited human\-review budget\. Activation engineering and feedback\-control methods make these estimates part of an active control loop\[[3](https://arxiv.org/html/2609.03026#bib.bib3),[4](https://arxiv.org/html/2609.03026#bib.bib4),[5](https://arxiv.org/html/2609.03026#bib.bib5),[6](https://arxiv.org/html/2609.03026#bib.bib6)\]\. Once an internal estimate is used to choose an action, statistical accuracy alone is not enough\[[29](https://arxiv.org/html/2609.03026#bib.bib29),[30](https://arxiv.org/html/2609.03026#bib.bib30),[15](https://arxiv.org/html/2609.03026#bib.bib15)\]: an estimate can perform well on average and still cause costly errors on individual prompts\.
To analyze these systems, we separate the decision loop into three parts\. Theobserverreads measurements and estimates an internal state or intervention effect\. Thecontrolleruses that estimate to choose an action\. Theinterventionis the edit, ablation, or policy action it is allowed to take\. ObserverBench asks whether the observer is adequate for that specific decision\.
Three failure modes illustrate why prediction accuracy and decision quality must be reported separately\. In safety triage, an observer can classify policy violations perfectly yet spend a limited review budget on low\-stakes cases while allowing higher\-impact harms through\. This is*consequence disregard*\(Sec\.[5](https://arxiv.org/html/2609.03026#S5)\)\. In model editing, an observer can predict a circuit ablation’s mean effect accurately yet choose an edit whose effect varies widely across prompts\. This is*dispersion blindness*\(Sec\.[4\.1](https://arxiv.org/html/2609.03026#S4.SS1)\)\. An internal activation probe can also repeat information already visible in the prompt or output logits\. Such a*redundant signal*adds model access without improving the downstream decision \(Sec\.[5](https://arxiv.org/html/2609.03026#S5)\)\.
We introduceObserverBench111Public workbench and submission page:[https://kwisatzh\.github\.io/observerbench/](https://kwisatzh.github.io/observerbench/)\., a set of fixed, reusable tasks that makes these operational distinctions measurable\. Each task pins the model, information available to the observer, allowed interventions, controller, measurement budget, held\-out test cases, and loss\. Every observer faces the same controller and evaluation harness within a task\. The evaluator reports two outcomes separately: how accurately the observer predicts its target and how much loss its chosen action incurs on held\-out cases\.
ObserverBench focuses on the operational stage of interpretability\. Mechanistic tomography addresses the measurement problem: how to design probes and interventions that recover hidden internal mechanisms and effect maps\. ObserverBench addresses the decision problem: whether a proposed estimate is adequate to guide a particular intervention, control loop, or safety policy\[[1](https://arxiv.org/html/2609.03026#bib.bib1)\]\. For safety tasks, ObserverBench freezes the audit policy and compares the monitor inside it\. AI\-control evaluations ask the complementary, harder question of whether the complete protocol remains safe when an adaptive model tries to subvert it\[[20](https://arxiv.org/html/2609.03026#bib.bib20)\]\. A monitor that performs well here must still pass that end\-to\-end test\.
An ObserverBench evaluation makes five choices explicit\. It states the*target*: an internal state, an intervention’s average effect, or perhaps the loss of one action on one prompt\. It states the*information and integrity boundary*: what the observer may read and who can alter, omit, delay, or spoof those measurements\. It fixes the*action space*and the*decision rule and loss*, which determine how estimates become actions and which errors matter\. Finally, it declares the*operating regime*, including prompts, intervention budgets, attack frequencies, episode horizons, and attacker assumptions\.
These choices make observer adequacy task\-relative: permissions, tool interfaces, budgets, attack rates, side channels, and evaluator\-held evidence are part of the evaluation, not background details\. In the 2026 OpenAI–Hugging Face incident, agents used an unsanctioned channel and spoofed some tool calls, motivating the integrity boundary\[[31](https://arxiv.org/html/2609.03026#bib.bib31),[32](https://arxiv.org/html/2609.03026#bib.bib32),[33](https://arxiv.org/html/2609.03026#bib.bib33)\]\. ObserverBench instantiates these choices in three standardized operational modes—closed\-loop control, effect prediction, and safety triage—summarized in Sec\.[2](https://arxiv.org/html/2609.03026#S2)\.
##### Contributions\.
- •An extensible evaluation workbench\.Versioned task and observer cards support local implementations and table\-based submissions under one common evaluator \(Sec\.[2](https://arxiv.org/html/2609.03026#S2)\)\.
- •A formal adequacy test for control\.For linear readouts with an offset, an observer needs to match the target only at the starting point and along directions the allowed interventions can reach\. An exact finite\-horizon identity then separates residual reported error, starting\-state mismatch, and target–observer response mismatch along the edit direction \(Sec\.[3](https://arxiv.org/html/2609.03026#S3), Eq\.[1](https://arxiv.org/html/2609.03026#S3.E1)\)\.
- •Prediction and compression are not decisions\.Pairwise models improve held\-out effect prediction on GPT\-2\-small and Qwen2\.5\-7B, but better mean prediction does not reliably improve the chosen GPT\-2 action\. Relative to the same\-feature mean observer, direct\-loss training reduces action loss by 18\.5% in the clean GPT\-2 confirmation and by 8\.9% in the Qwen aggregate\[[16](https://arxiv.org/html/2609.03026#bib.bib16),[23](https://arxiv.org/html/2609.03026#bib.bib23),[24](https://arxiv.org/html/2609.03026#bib.bib24)\]\. In the Qwen safety task, a sparse SAE readout uses far fewer coefficients yet incurs more escaped attacks:*compression without a better decision*\(Secs\.[4\.1\.5](https://arxiv.org/html/2609.03026#S4.SS1.SSS5),[4\.2](https://arxiv.org/html/2609.03026#S4.SS2), and[5](https://arxiv.org/html/2609.03026#S5)\)\[[28](https://arxiv.org/html/2609.03026#bib.bib28)\]\.
- •Classification is not enough for safety\.In the authorization task, a label observer with AUROC 1\.000 allocates a fixed intervention budget poorly when it ignores consequence\. On the external Gemma APPS task, AUROC and realized violations reverse the order of two monitors\. Across matched Qwen2\.5\-7B, Gemma\-2\-9B\-it, and prospectively frozen Qwen3\.5\-9B tasks, residual observers lead on average, while the lowest\-loss context changes—even between the two Qwen checkpoints \(Sec\.[5](https://arxiv.org/html/2609.03026#S5)\)\[[20](https://arxiv.org/html/2609.03026#bib.bib20),[21](https://arxiv.org/html/2609.03026#bib.bib21),[25](https://arxiv.org/html/2609.03026#bib.bib25),[26](https://arxiv.org/html/2609.03026#bib.bib26)\]\.
The next question is operational: what exactly does ObserverBench fix, what may a researcher submit, and what does the evaluator return?
## 2How ObserverBench evaluates an observer
A fair comparison keeps the decision problem fixed\. Otherwise, lower loss could reflect a better observer, a more capable controller, easier actions, or a different test distribution\. ObserverBench therefore treats these choices as part of the task\.
Each evaluation uses aTaskCard, anObserverCard, and aresult scorecardin four steps:
1. 1\.Choose a task\.The TaskCard defines the decision problem using the five choices above and fixes the training measurements, held\-out cases, budgets, and clean\-performance checks\. These do not change when observers are compared\.
2. 2\.Submit an observer\.Any method may be used if it respects the task’s information and integrity boundary\. The ObserverCard records what the observer reads, where those measurements come from, how it was fit or calibrated, what model access it requires, and any known failure conditions\. For a control task, it also declares whether the submission replaces the state estimate, the edit direction, or both\. If both change, the score applies to the pair\.
3. 3\.Run the common evaluator\.Every observer receives the same held\-out cases and faces the same controller, actions, budgets, and loss\.
4. 4\.Compare outcomes and cost\.The result scorecard reports prediction quality, downstream action loss, and the access or measurement cost of obtaining the estimate\.
There are two ways to cross the observer–evaluator boundary\. A local implementation can fit and run a method that needs model inference or internal activations\. A public submission can instead provide a table of predictions or scores for the task’s released cases\. The second route lets a researcher test an observer without installing the original model or experiment stack\. In both routes, the task—not the observer—applies the held\-out targets, controller, and loss\.
The three operational modes share this contract but ask different questions \(Table[1](https://arxiv.org/html/2609.03026#S2.T1)\)\.
Table 1:ObserverBench operational modes\. Each row defines a complete, task\-relative comparison\.ObserverBench does not collapse unlike modes or task versions into a single overall rank\. Each scorecard identifies which observer is better for one declared use\.
The workflow makes results comparable\. Three additional rules keep each comparison meaningful:
- •Separate construction from evaluation\.Fix targets, splits, and interventions before measuring held\-out performance\. Check first that the unedited model succeeds on the base task and required groups; we call this the*clean stop gate*\.
- •Make the comparison observable\.The measurement design must actually exercise the effects being compared\. For example, an interaction cannot be assessed if the relevant component combination is almost never measured\. Repeated control should report error across the trajectory rather than only a threshold crossing\.
- •Evaluate the quantity used to choose the action\.Mean\-effect prediction, prompt\-level intervention loss, and consequence\-weighted safety risk are different targets\. The task should score the one the controller actually uses\.
This contract tells us how to compare observers, but it leaves a prior question unanswered: what must an observer preserve for its estimate to be adequate for control? Section[3](https://arxiv.org/html/2609.03026#S3)answers that question by restricting accuracy to the states that the allowed interventions can reach\.
## 3Closed\-loop control: what an observer must preserve
Once the controlled model, initial states, allowed intervention rule, controller, and loss are fixed, only observer errors that affect reachable states can change the controlled trajectory\. An observer turns a model measurement into information that can guide an intervention\. The distinction between the estimate and the intervention is important\. An observer may correctly report how far the model is from a target while pointing the controller in an unhelpful direction; conversely, a useful direction can be paired with a poor estimate\.
For model statehh, let the observer estimate a quantityz^\\widehat\{z\}and letdddenote the proposed intervention direction:
E\(h\)=z^,D\(h\)=d\.E\(h\)=\\widehat\{z\},\\qquad D\(h\)=d\.The controller uses the estimate to choose an action magnitude,
u=C\(y⋆,z^\)\.u=C\(y^\{\\star\},\\widehat\{z\}\)\.Within this fixed system, testingEEkeepsDDfixed, testingDDkeepsEEfixed, and changing both identifies only the combined system\.
An observer need not be correct on every possible model state\. It needs to be correct on the states that the allowed interventions can reach\. To state this concretely, suppose an activation has three coordinates but the controller can move only the first two\. A wrong coefficient on the third coordinate cannot affect this controller\. A wrong coefficient on the first can\.
To state the same idea precisely, consider an affine—linear plus an offset—target and observer:
z\(h\)=bT\+βT⊤h,z^\(h\)=bE\+βE⊤h\.z\(h\)=b\_\{T\}\+\\beta\_\{T\}^\{\\top\}h,\\qquad\\widehat\{z\}\(h\)=b\_\{E\}\+\\beta\_\{E\}^\{\\top\}h\.Leth0h\_\{0\}be the starting state\. Let the columns ofBBspan the allowed edit directions\. Fromh0h\_\{0\}, the controller can reach only
ℋR=h0\+𝒰,𝒰=span\(B\)\.\\mathcal\{H\}\_\{R\}=h\_\{0\}\+\\mathcal\{U\},\\qquad\\mathcal\{U\}=\\operatorname\{span\}\(B\)\.The observer only has to match the target on this reachable set\. With one fixed directiondd, this means that its error alongddmust be zero\.
###### Proposition 1\(Reachable\-subspace adequacy\)\.
Define
δ0=z\(h0\)−z^\(h0\),δβ=βT−βE\.\\delta\_\{0\}=z\(h\_\{0\}\)\-\\widehat\{z\}\(h\_\{0\}\),\\qquad\\delta\_\{\\beta\}=\\beta\_\{T\}\-\\beta\_\{E\}\.Thenz\(h\)=z^\(h\)z\(h\)=\\widehat\{z\}\(h\)for everyh∈ℋRh\\in\\mathcal\{H\}\_\{R\}if and only if
δ0=0andP𝒰δβ=0,\\delta\_\{0\}=0\\qquad\\text\{and\}\\qquad P\_\{\\mathcal\{U\}\}\\delta\_\{\\beta\}=0,whereP𝒰P\_\{\\mathcal\{U\}\}is the orthogonal projector onto𝒰\\mathcal\{U\}\.
###### Proof\.
Every reachable state has the formh=h0\+Bvh=h\_\{0\}\+Bv\. The readout difference isδ0\+δβ⊤Bv\\delta\_\{0\}\+\\delta\_\{\\beta\}^\{\\top\}Bv\. It is zero for everyvvexactly whenδ0=0\\delta\_\{0\}=0andB⊤δβ=0B^\{\\top\}\\delta\_\{\\beta\}=0, which is equivalent toP𝒰δβ=0P\_\{\\mathcal\{U\}\}\\delta\_\{\\beta\}=0\. ∎
With one fixed directiondd, Proposition[1](https://arxiv.org/html/2609.03026#Thmproposition1)reduces adequacy to\(βT−βE\)⊤d=0\(\\beta\_\{T\}\-\\beta\_\{E\}\)^\{\\top\}d=0\.
### 3\.1Why a convergent observer can still miss the target
The proposition tells us where an observer must agree with the target\. The next question is what happens when its remaining error enters a feedback loop\. Consider an unclipped controller that repeatedly edits along one direction:
ht\+1=ht\+Ke^td,e^t=y⋆−z^\(ht\)\.h\_\{t\+1\}=h\_\{t\}\+K\\widehat\{e\}\_\{t\}d,\\qquad\\widehat\{e\}\_\{t\}=y^\{\\star\}\-\\widehat\{z\}\(h\_\{t\}\)\.Herey⋆y^\{\\star\}is the desired value,KKsets the edit size, ande^t\\widehat\{e\}\_\{t\}is the error reported by the observer\. Three quantities govern the loop:
gE=βE⊤d,gT=βT⊤d,p=1−KgE\.g\_\{E\}=\\beta\_\{E\}^\{\\top\}d,\\qquad g\_\{T\}=\\beta\_\{T\}^\{\\top\}d,\\qquad p=1\-Kg\_\{E\}\.The responsegEg\_\{E\}is what the observer expects along the edit direction, whilegTg\_\{T\}is the target’s actual response\. The convergence factorpp—called the closed\-loop pole in control theory—says how quickly the error reported by the observer shrinks\. AfterTTsteps, the total action is
AT=\{e^0\(1−pT\)/gE,gE≠0,TKe^0,gE=0,A\_\{T\}=\\begin\{cases\}\\widehat\{e\}\_\{0\}\(1\-p^\{T\}\)/g\_\{E\},&g\_\{E\}\\neq 0,\\\\ TK\\widehat\{e\}\_\{0\},&g\_\{E\}=0,\\end\{cases\}and the two errors are exactly
e^T=pTe^0,eT=e0−gTAT,\\widehat\{e\}\_\{T\}=p^\{T\}\\widehat\{e\}\_\{0\},\\qquad e\_\{T\}=e\_\{0\}\-g\_\{T\}A\_\{T\},whereet=y⋆−z\(ht\)e\_\{t\}=y^\{\\star\}\-z\(h\_\{t\}\)\. ForgE≠0g\_\{E\}\\neq 0, define
m0=z\(h0\)−z^\(h0\),ρ=gT−gEgE\.m\_\{0\}=z\(h\_\{0\}\)\-\\widehat\{z\}\(h\_\{0\}\),\\qquad\\rho=\\frac\{g\_\{T\}\-g\_\{E\}\}\{g\_\{E\}\}\.Substitution gives the finite\-horizon certificate
eT=pTe^0−m0−ρ\(1−pT\)e^0\.e\_\{T\}=p^\{T\}\\widehat\{e\}\_\{0\}\-m\_\{0\}\-\\rho\(1\-p^\{T\}\)\\widehat\{e\}\_\{0\}\.\(1\)
The equation separates three sources of error:
- •pTe^0p^\{T\}\\widehat\{e\}\_\{0\}is the error the observer still reports afterTTsteps;
- •m0m\_\{0\}is a mismatch at the starting state; and
- •ρ\(1−pT\)e^0\\rho\(1\-p^\{T\}\)\\widehat\{e\}\_\{0\}is the mismatch between the response the observer expects and the response the target actually has\.
The observer’s reported error converges when\|p\|<1\|p\|<1, or0<KgE<20<Kg\_\{E\}<2for positiveKK, but this controls only the first term\. For example, ifpTp^\{T\}is nearly zero andm0=0\.2m\_\{0\}=0\.2, the observer reports success while the true target remains off by about0\.20\.2, even before response mismatch is counted\. A convergent observer is not necessarily tracking the true target\.
### 3\.2A simple control certificate remains predictive in a Transformer
Equation[1](https://arxiv.org/html/2609.03026#S3.E1)is exact for an affine system\. A Transformer is nonlinear\. Our first experiment asks whether the same three sources of error—remaining reported error, starting mismatch, and response mismatch— remain useful when every edit passes through learned Transformer layers\. We begin with a small model whose target we can verify exactly, following the controlled “wind\-tunnel” approach of\[[2](https://arxiv.org/html/2609.03026#bib.bib2)\]\.
##### Task contract\.
This experiment instantiates the control mode as follows:
Table 2:ObserverBench contract for the closed\-loop control experiment\.We train a two\-block Transformer on sequences with two binary features,x1x\_\{1\}andx2x\_\{2\}, and target
y=0\.35x1\+0\.25x2\+γx1x2\+ϵ\.y=0\.35x\_\{1\}\+0\.25x\_\{2\}\+\\gamma x\_\{1\}x\_\{2\}\+\\epsilon\.The productx1x2x\_\{1\}x\_\{2\}matters only when both features are present\. A first\-order observer readsx1x\_\{1\}andx2x\_\{2\}separately, so it cannot represent this joint condition\. A lifted observer adds the pairwise featurex1x2x\_\{1\}x\_\{2\}\. We edit the residual after block 0 and rerun block 1, the final layer normalization, and the target head\. The edit therefore passes through the learned nonlinear suffix; we do not replace that suffix with a linear approximation\.
We run two tests with 12 independently trained models per target family:
- •Does the certificate predict failure?We fix the observer response atgE=0\.85g\_\{E\}=0\.85and vary the response mismatchρ\\rho, initial bias, and target offset\. Small positive and negative edits measure the actual target responsegTg\_\{T\}\. We then ask whether Equation[1](https://arxiv.org/html/2609.03026#S3.E1)predicts which rollouts miss the target and by how much\.
- •Does the interaction coordinate improve control?We compare the natural first\-order and pairwise estimator–direction pairs\. We useγ=1\.15\\gamma=1\.15when the target contains the interaction andγ=0\\gamma=0as the additive control\.
Integrated squared tracking error counts error across the full trajectory, not only at the final step, and uncertainty is measured across the 12 independently trained models, not across the many conditions within each model\. None of the main comparisons clips\. Every natural comparison and 99\.2% of controlled conditions move no farther than the largest distance among the four clean task archetypes\. The edits therefore have a familiar scale, although four archetypes cannot prove that edited states remain on the full activation manifold\.
The suffix is measurably nonlinear\. At the largest offsets, its mean deviation from the affine prediction is 16\.1% of output movement, and the certificate residual is 20\.2% of mean absolute final error\. We therefore ask whether the affine quantities remain predictive, not whether the Transformer is linear\.
They remain predictive\. The main checks agree:
- •The raw certificate correlates0\.9520\.952with actual final error and gets the sign right in 96\.0% of conditions\.
- •Its residual MAE is 16\.5% of mean absolute actual error\.
- •After fitting only an intercept and slope on the other 11 seeds, its leave\-one\-seed\-out MAE is0\.0630\.063, compared with0\.3020\.302for the bias\-only model and0\.3670\.367for the observer\-pole\-only model\. It wins on every held\-out seed\.
Across this checked operating range, the three certificate terms capture most of the error\. This does not show that the suffix or its activation manifold is locally linear\.
Table 3:Study\-1 nonlinear\-suffix results\. A–B is positive when the full certificate or lifted pair has lower error\. Intervals resample the 12 training seeds\.The direct control comparison gives the same message\. The pairwise model reduces integrated squared error by 29\.0% when the target contains the “both features present” term, with improvement in 11 of 12 independently trained models\. It gives no reliable advantage for the additive target\. The exact losses and intervals are reported in Table[3](https://arxiv.org/html/2609.03026#S3.T3)\.
This result concerns the estimator and edit direction together\. The mismatched estimator–direction pairs are unstable in 10 of 12 interactional models and also fail the action\- and activation\-scale checks\. We therefore do not use them to rank the estimators independently of direction\. Appendix Table[15](https://arxiv.org/html/2609.03026#A2.T15)reports all four cells, including their self\-response and convergence factorpp\.
Figure 1:Learned nonlinear\-suffix experiment\. The certificate combines starting mismatch, convergence factor, and response mismatch \(left\)\. The pairwise estimator–direction pair reduces control error for the interactional target but not for the additive target \(right\)\. Intervals resample 12 independently trained models\.The study provides a bridge to pretrained models: a simple control\-error certificate can remain useful after nonlinear computation when edit scale and loop stability are checked\. It does not establish token\-level or large\-model control\. Closed\-loop control evaluates an observer over a trajectory\. What if the decision instead selects one static intervention from a fixed candidate set using predicted finite effects?
## 4Effect prediction: better estimates need not choose better actions
Many interpretability studies use an observer once, to choose one intervention from a fixed set\. ObserverBench tests whether better prediction of held\-out effects also produces a better choice\. It fixes the measurements, candidate actions, decision rule, and held\-out loss, then reports prediction error and the loss caused by the selected action separately\.
We test this effect\-prediction contract on GPT\-2\-small and Qwen2\.5\-7B\. The two tasks use different behaviors and head sets, but keep the same distinction between estimating an effect and using that estimate to act\.
Table 4:Task contracts for the two effect\-prediction studies\. Each observer receives the same calibration information within a task and faces the same candidate actions and held\-out loss\.### 4\.1GPT\-2 IOI: predicting an effect is not choosing an action
The nonlinear\-suffix experiment used a small model with a known mechanism\. We now turn to a documented circuit in GPT\-2\-small\. Consider the prompt “When Alice and Bob went to the store, Alice gave a book to\.” The correct next name is Bob, not the repeated subject Alice\. Prior work identifies three relevant head groups: primary Name Movers promote Bob, Backup Name Movers compensate when that path is weakened, and Negative Name Movers suppress the competing name\[[16](https://arxiv.org/html/2609.03026#bib.bib16),[17](https://arxiv.org/html/2609.03026#bib.bib17),[18](https://arxiv.org/html/2609.03026#bib.bib18),[19](https://arxiv.org/html/2609.03026#bib.bib19)\]\. These known groups let us test observers on a real intervention surface\. We do not claim to discover a new circuit\.
We first ask whether pairwise terms improve mean\-effect prediction and the resulting fixed action, then predict prompt\-level action loss directly, and finally repeat that comparison after the baseline task check passes with the exact no\-op included\.
We write the three published head groups as
P\\displaystyle P=\(9\.9,9\.6,10\.0\),\\displaystyle=\(9\.9,9\.6,10\.0\),B\\displaystyle B=\(9\.0,9\.7,10\.1,10\.2,10\.6,10\.10,11\.2,11\.9\),\\displaystyle=\(9\.0,9\.7,10\.1,10\.2,10\.6,10\.10,11\.2,11\.9\),E\\displaystyle E=\(10\.7,11\.10\)\.\\displaystyle=\(10\.7,11\.10\)\.An ablation maskmmis the set of heads removed together\. For promptiiand maskmm, define
Yi\(m\)=LDi,clean−LDi,ablate\(m\),Y\_\{i\}\(m\)=LD\_\{i,\\mathrm\{clean\}\}\-LD\_\{i,\\mathrm\{ablate\}\(m\)\},whereLDLDis the logit for the indirect object minus the logit for the subject\. ThusYi\(m\)=1Y\_\{i\}\(m\)=1means that ablating maskmmreduces Bob’s advantage over Alice by one logit on promptii\. At the final token, mean ablation replaces each selected head’s output with an average from reference prompts of the same template\. Whole\-group ablations first reproduce known backup behavior\. This is a check that the intervention works as intended, not a new mechanistic result\.
#### 4\.1\.1A fixed test of effect prediction and action selection
We freeze the test before measuring candidate effects:
- •Prompts and splits\.We pin GPT\-2\-small and generate 1,024 prompts from eight templates and 64 names\. Separate 16\-name banks supply 512 reference, 192 training, 64 validation, and 256 test prompts\. Reference prompts define the ablation means\.
- •Measurements and actions\.We use 160 calibration masks to fit each observer\. The observer then chooses from 320 previously unseen candidate masks, divided into ten action pools of 32\. Each mask contains 4–10 heads\. Budgets 20, 40, 80, and 160 use nested prefixes of one calibration sequence\.
- •Observers\.Four ridge models move from 13 independent head effects, to group\-count features, to a capacity\-matchedP×EP\\times Eterm, and finally to all three group\-pair interactions\. Each measurement is one mask’s average effect over the training prompts\.
- •Fixed action\.For each observer, budget, pool, and targett∈\{0\.5,1\.0,1\.5\}t\\in\\\{0\.5,1\.0,1\.5\\\}, the observer chooses one mask that is applied to every held\-out prompt\. It cannot choose one mask for Alice–Bob and another for Carol–David\.
An audit found that an earlier metric had accidentally allowed a different, outcome\-informed choice for each prompt rather than one frozen action\. We corrected it before opening validation or test outcomes; the prompts, masks, observers, targets, and predictions were unchanged\.
#### 4\.1\.2Interaction terms improve mean\-effect prediction
Let
μ\(m\)=𝔼i\[Yi\(m\)\]\\mu\(m\)=\\mathbb\{E\}\_\{i\}\[Y\_\{i\}\(m\)\]be a mask’s average effect over held\-out prompts\. At the primary budget of 160 measurements, the all\-pairs observer lowers candidate\-mask MAE from0\.4860\.486for per\-head additivity and0\.4730\.473for count additivity to0\.3950\.395, reductions of 18\.8% and 16\.7%\. Both improvements hold in all ten candidate pools\.
TheP×EP\\times Eand all\-pairs observers are effectively tied, with MAEs0\.39400\.3940and0\.39450\.3945\. This replaces an earlier exploratory ranking of the pairs\. The result supports interaction\-aware prediction, but it does not show that one pair uniquely explains the intervention surface\. The gain appears at budgets 40, 80, and 160\. With only 20 measurements, the richer designs have more coefficients than the data can identify\. That cell is therefore an underdetermined fit, not evidence about sample efficiency\.
#### 4\.1\.3The better mean predictor does not choose a better action
A mean\-effect observer chooses
m^\(t\)=argminm\|μ^\(m\)−t\|\.\\widehat\{m\}\(t\)=\\arg\\min\_\{m\}\|\\widehat\{\\mu\}\(m\)\-t\|\.Fort=1t=1, for example, it selects the mask whose predicted average drop is closest to one logit\. The benchmark instead scores the prompt\-level loss of that fixed mask,
Rt\(m\)=𝔼i\[\|Yi\(m\)−t\|\]\.R\_\{t\}\(m\)=\\mathbb\{E\}\_\{i\}\\left\[\|Y\_\{i\}\(m\)\-t\|\\right\]\.Two masks can have the same average and different losses\. A mask that reliably reduces the margin by one logit is better than one that alternates between zero and two, even though both average to one\. Mean\-effect prediction and action selection are therefore different tasks\. This is an instance of a broader prediction–decision distinction: the error of an intermediate estimate need not determine the quality of the action chosen from it\. Roughan et al\. documented an analogous result in traffic engineering, where traffic\-matrix estimation\-error magnitude was not by itself a good indicator of routing performance\[[22](https://arxiv.org/html/2609.03026#bib.bib22)\]\. Here, mean\-effect error omits a decision\-relevant quantity: how a mask’s effect varies across prompts\.
At budget 160, the all\-pairs model has the bestR2R^\{2\}and nearly the best mean\-effect MAE, yet its action\-loss reductions are only 0\.10% and 2\.34%, with paired intervals\[−0\.087,0\.100\]\[\-0\.087,0\.100\]and\[−0\.063,0\.128\]\[\-0\.063,0\.128\]\. Table[5](https://arxiv.org/html/2609.03026#S4.T5)reports the raw outcomes; the intervals cross zero, and none of the prespecified size\-matched, cost\-aware, tolerance, or name\-pair checks establishes a reliable gain\.
Table 5:Held\-out IOI results at 160 measurements\. MAE andR2R^\{2\}score the prompt\-averaged effect over candidate masks\. The remaining columns score the masks selected for 30 pool–target cells\. Values may differ slightly under rounding becauseRt=\|μ−t\|\+JtR\_\{t\}=\|\\mu\-t\|\+J\_\{t\}is computed before aggregation\.The reason can be written exactly\. Define the target\-dependent dispersion penalty
Jt\(m\)=𝔼i\|Yi\(m\)−t\|−\|𝔼i\[Yi\(m\)\]−t\|\.J\_\{t\}\(m\)=\\mathbb\{E\}\_\{i\}\|Y\_\{i\}\(m\)\-t\|\-\|\\mathbb\{E\}\_\{i\}\[Y\_\{i\}\(m\)\]\-t\|\.This nonnegative term is the extra action loss caused by prompt\-to\-prompt variation hidden by the mean\. Therefore
Rt\(m\)=\|μ\(m\)−t\|\+Jt\(m\)\.R\_\{t\}\(m\)=\|\\mu\(m\)\-t\|\+J\_\{t\}\(m\)\.\(2\)The interaction\-aware observers choose masks whose averages are closer to the target, but those masks vary more across prompts\. The second effect cancels the first\. Even perfect knowledge of each mask’s test\-set mean chooses the lowest\-loss mask in only 3 of 30 pool–target cells\. Its loss is0\.9270\.927, compared with0\.7490\.749when the full prompt\-level action loss is known\. Mean\-effect prediction works as intended; the mean is simply the wrong quantity for this action rule\.
#### 4\.1\.4Predict the loss used to choose the action
Equation[2](https://arxiv.org/html/2609.03026#S4.E2)tells us what to try next: keep the measurements and action rule fixed, but predict the action lossRt\(m\)R\_\{t\}\(m\)instead of the mean effectμ\(m\)\\mu\(m\)\. We designed this test after the frozen mean\-effect comparison and an exploratory pilot, then fixed the protocol, predictions, and actions before measuring new test effects\. The local record documents data\-access order; it is not an independent preregistration\.
The comparison keeps the measurement basis and action rule fixed:
- •eight new templates, 192 training prompts, 512 test prompts, and targetst∈\{0\.5,1\.0\}t\\in\\\{0\.5,1\.0\\\};
- •the same 160 calibration masks and 1,536 candidate masks in 48 pools;
- •one pairwise \(quadratic\) basis with an intercept, 13 head indicators, and 78 head\-pair products\.
The direct\-loss observer, called direct risk in the tables, fits
1192∑i\|Yi\(m\)−t\|\.\\frac\{1\}\{192\}\\sum\_\{i\}\|Y\_\{i\}\(m\)\-t\|\.The natural\-mean observer predicts the average effect and chooses the mask closest to the target\. A transformed\-mean control predicts that distance directly with the same 92\-column basis\. The observers therefore see the same masks and features; only the quantity they learn differs\. The held\-out evaluation comprises 786,432 test prompt–mask outcomes\.
The mean observer remains strong at its own task: held\-out mean\-effect MAE is0\.1280\.128,R2R^\{2\}is0\.8440\.844, and rank correlation is0\.9380\.938\. The direct\-loss observer nevertheless reduces action loss from1\.0761\.076to0\.8330\.833, a 22\.6% reduction, and by 22\.7% against the same\-feature transformed\-mean control\. Table[6](https://arxiv.org/html/2609.03026#S4.T6)reports the paired intervals and all prespecified checks\.
The decomposition explains why\. The direct\-loss observer matches the mean less closely:0\.5500\.550instead of0\.4330\.433\. But it lowers the prompt\-variation term from0\.6430\.643to0\.2830\.283\. That0\.3600\.360reduction is larger than the0\.1170\.117loss in mean matching\. Extra pairwise features do not reliably improve direct loss over either additive control; both intervals cross zero\. On this surface, predicting the right quantity matters more than adding features\.
Table 6:Pilot\-informed, outcome\-sealed fixed\-action comparison\. Contrast point statistics are relative fixed\-action loss reductions; intervals are paired absolute loss reductions from the frozen pair\-cluster\-by\-pool bootstrap\.Two failed checks limit this result:
- •The exact no\-op was absent\.Every candidate mask removes 4–9 heads\. SinceYi\(∅\)=0Y\_\{i\}\(\\varnothing\)=0, no\-op loss is exactlytt\. Averaged over the two targets, no\-op loss is0\.7500\.750, below the direct\-loss observer at0\.8330\.833\.
- •The baseline task check failed\.Overall IO\-versus\-subject accuracy is 0\.867 rather than 0\.900, and the worst template reaches 0\.578 rather than 0\.750\.
We remove no rows\. This test shows better ranking among forced nonempty actions on this surface\. It does not show improvement over no\-op or a new IOI mechanism\.
#### 4\.1\.5At a one\-logit target, direct loss beats the mean observer and exact no\-op
The failed checks determine the confirmation:
- •We return to the eight canonical templates and generate 512 new prompts from 32 new name\-pair clusters\. Clean IO\-versus\-subject accuracy is 0\.977 overall and at least 0\.953 for every template, so the baseline task check passes\.
- •We uset=1t=1, the only screened target whose pilot estimates favored the direct\-loss observer over both the same\-feature mean observer and exact no\-op\. This is a disclosed pilot\-informed choice, not an independent preregistration\.
- •Each of 48 action pools contains 30 fresh nonempty masks plus exact no\-op\. Both observers use the same 92\-column quadratic basis and the same frozen training and calibration outcomes\.
- •We freeze every action before measuring candidate effects\. The two observers select 89 distinct nonnoop masks, so we measure only the corresponding512×89=45,568512\\times 89=45\{,\}568prompt–mask cells\.
A provenance check stopped an initial run before its values were inspected\. Appendix[B](https://arxiv.org/html/2609.03026#A2)records the corrected frozen run and an independent recomputation of its coefficients, predictions, and choices\.
Both required comparisons pass: Table[7](https://arxiv.org/html/2609.03026#S4.T7)shows an 18\.5% action\-loss reduction against the same\-feature mean observer and a 10\.9% reduction against exact no\-op, with both paired intervals excluding zero\.
Table 7:Fixed\-action target tracking at the pilot\-informed targett=1\.0t=1\.0\. On 512 new prompt strings from eight fixed canonical templates, intervals resample 32 name\-pair clusters and 48 frozen action pools \(5,000 draws\)\. Intervals are absolute loss reductions; the Reduction column is relative\. The last column is descriptive and shows templates with the same direction\. The clean IO\-versus\-subject gate passed before measurement \(97\.7% overall; 95\.3% worst template\)\.The decomposition shows the same tradeoff\. The direct\-loss observer has a worse mean\-to\-target term,0\.3970\.397rather than0\.2860\.286, but lowers the dispersion penalty from0\.8070\.807to0\.4940\.494\. It beats the mean observer on all eight templates and no\-op on six\. The pooled no\-op comparison passes, but the gain is not uniform across templates\.
##### How the target changes the value of acting\.
After the primary result, we freeze a secondary analysis over all three screened targets\. It keeps the prompts, pools, quadratic basis, and calibration outcomes fixed\. It compares the direct\-loss observer with the natural mean plug\-in, the same\-basis transformed\-mean score, and exact no\-op\. We measure new outcomes only for additional selected masks\. This analysis has no success gate and does not change the baseline\-checked result\.222Att=1t=1, the confirmation and this sensitivity use the same loss cells but separate fixed bootstrap seeds\. Their point estimate is identical; lower limits0\.0120\.012and0\.0150\.015differ only through Monte Carlo resampling\.
Table 8:Post\-confirmatory target sensitivity\. This secondary analysis was designed after thet=1t=1confirmation and has no success gate\. Each gain cell reports the relative loss change and, in brackets, a 95% paired bootstrap interval for the absolute reference\-minus\-direct loss difference\. The three targets share 512 prompts and 48 frozen action pools; the last row weights the targets equally\. The negative no\-action result att=0\.5t=0\.5is retained\.Table[8](https://arxiv.org/html/2609.03026#S4.T8)shows that the direct\-loss observer beats both mean\-based controls at every target, with every paired interval excluding zero\. No\-op follows a simpler rule\. Its effect is zero, so its loss is exactlyRt\(∅\)=tR\_\{t\}\(\\varnothing\)=t\. Att=0\.5t=0\.5, the direct\-loss observer’s loss is 46\.2% higher than exact no\-op, even though it beats both mean\-based observers\. It beats no\-op att=1t=1andt=1\.5t=1\.5\. This sign change is why exact no\-op belongs in every action set: an observer can rank the available edits well even when no edit is warranted\.
Together, the IOI tests show that pairwise terms improve mean\-effect prediction and direct\-loss prediction improves fixed\-action choice, while exact no\-op tests whether any intervention is warranted\. Because these claims are limited to GPT\-2\-small, the declared templates and masks, and the measured action losses, we next ask whether the first two patterns transfer to a larger model and a different intervention surface\.
### 4\.2Qwen2\.5\-7B: the pattern transfers to a larger model
We test that transfer on the base Qwen2\.5\-7B model\[[24](https://arxiv.org/html/2609.03026#bib.bib24)\]using an induction\-copy task with an exact behavioral target and a different set of heads to intervene on\[[23](https://arxiv.org/html/2609.03026#bib.bib23)\]\. The result applies only to prompts that the unedited model already solves with a clear margin\.
Each prompt first contains three key–value pairs and later repeats one key\. For example, after “A red, B blue, C green, … B”, the desired continuation among the three values is “blue\.” Red and green are the declared distractors\. For each prompt, we score how strongly the model favors the target over the two distractors combined\. For promptii, define this margin as
Mi=logiti\(target\)−logmeanexp\(logiti\(distractor1\),logiti\(distractor2\)\),M\_\{i\}=\\operatorname\{logit\}\_\{i\}\(\\text\{target\}\)\-\\operatorname\{logmeanexp\}\\bigl\(\\operatorname\{logit\}\_\{i\}\(\\text\{distractor\}\_\{1\}\),\\operatorname\{logit\}\_\{i\}\(\\text\{distractor\}\_\{2\}\)\\bigr\),wherelogmeanexp\(a,b\)=logsumexp\(a,b\)−log2\\operatorname\{logmeanexp\}\(a,b\)=\\operatorname\{logsumexp\}\(a,b\)\-\\log 2\. The effect of an ablation mask is the drop in that margin:
Yi\(m\)=Mi\(∅\)−Mi\(m\)\.Y\_\{i\}\(m\)=M\_\{i\}\(\\varnothing\)\-M\_\{i\}\(m\)\.A positiveYi\(m\)Y\_\{i\}\(m\)means that ablating those heads weakens the target relative to the two alternatives\. Four prompt families combine sequence lengths 32 and 64 with repeat gaps 8 and 16\.
#### 4\.2\.1Define eligible prompts before discovering heads
Copy\-v1 required 95% baseline accuracy among the three candidates\. Qwen reached 92\.97%, so the run stopped before any attention or intervention result was opened\. Copy\-v2 did not lower the threshold\. Instead, before analysis it defined an eligible prompt as one for which Qwen chooses the target among the three candidates, has marginMi≥log4M\_\{i\}\\geq\\log 4, and produces finite scores\. Discovery prompts must also agree under the eager and SDPA attention implementations\. Both protocols recorded their source and configuration in a private commit before model outcomes\. This records data\-access order but is not an independent preregistration\.
Before scoring, we assign 3,072 fresh prompts to separate data banks\. A total of 2,612 prompts \(85\.03%\) pass the eligibility and coverage checks\. Hash order, not model score, then selects 1,536 prompts for reference, discovery, head fitting, confirmation, calibration, and final held\-out testing\. These roles remain separate throughout the experiment\.
On the unfiltered prompts, Qwen produces the desired next token only 24\.45% of the time\. The task therefore asks a bounded question: when Qwen already distinguishes the planted value from the two distractors, which heads support that distinction, and how well can we predict their intervention effects? It does not test unconstrained generation\.
#### 4\.2\.2Held\-out interventions confirm the eight\-head panel
Attention can suggest heads, but only an intervention shows that they affect the output\. We therefore use four frozen steps:
1. 1\.Rank all 784 query heads by attention to the target value relative to the distractors\.
2. 2\.Apply individual mean ablations to only the top 32 on a separate head\-fitting bank\.
3. 3\.Select at most two heads per layer using a lower\-bootstrap\-bound rule\. This yields L22H3, L22H4, L26H15, L14H0, L14H6, L16H13, L17H18, and L23H13, spanning six layers\.
4. 4\.Test the selected panel against matched control heads on a separate confirmation bank\.
Each selected head receives a low\-induction control from the same layer and grouped\-query\-attention key–value group\. Controls are matched using attention specificity and output\-norm distance, not causal outcomes\. On 256 separate confirmation prompts, the selected heads lower the candidate margin much more than matched controls, with the paired interval excluding zero; a frozen zero\-ablation check gives the same ordering\. Table[9](https://arxiv.org/html/2609.03026#S4.T9)reports the estimates\. Thus the held\-out intervention results, not the attention scores by themselves, justify including the panel in the benchmark\.
#### 4\.2\.3Pair terms and direct loss improve held\-out performance
Only after confirmation passes do we freeze all28=2562^\{8\}=256combinations of the eight heads\. One mask might remove heads 1 and 3; another might remove 2, 4, and 8\. We split this complete mask set into 128 calibration masks and 128 held\-out masks\. Calibration effects average 256 prompts; held\-out effects average a separate 512\. The held\-out prompts form 128 four\-family clusters, so every mask is tested at every sequence\-length and repeat\-gap condition\.
The additive observer assumes that removing heads 1 and 3 has the sum of their separate effects\. The pairwise observer, a quadratic model for these binary masks, adds all 28 head pairs and can represent a head whose effect changes after another head is removed\. At the primary budget of 128 measurements, the pairwise model improves held\-out\-mask MAE over the additive observer, with the paired interval excluding zero \(Table[9](https://arxiv.org/html/2609.03026#S4.T9)\)\. The pairwise model also improves MAE at every smaller nested budget; the 16\-measurement fit has more coefficients than measurements and is therefore descriptive\.
Every action selector uses the same 37\-column pairwise basis, the same three targets, and the same 16 frozen action pools\. Each pool contains eight nonempty masks and the exact no\-op\. The observers differ only in what they predict:
- •Natural meanpredicts𝔼i\[Yi\(m\)\]\\mathbb\{E\}\_\{i\}\[Y\_\{i\}\(m\)\]\.
- •Transformed meanpredicts the distance between that mean and the target\.
- •Direct losspredicts the action loss itself,𝔼i\|Yi\(m\)−t\|\\mathbb\{E\}\_\{i\}\|Y\_\{i\}\(m\)\-t\|\.
The targets are 0\.25, 0\.50, and 0\.75 of the confirmed full\-panel effect\. We freeze every prediction and action before opening held\-out effects\.
TestComparisonReferenceResultImprovement \[95% CI\]CausalMean replacementControl0\.1700\.170Selected3\.4543\.4543\.284\[3\.053,3\.520\]3\.284\\ \[3\.053,3\.520\]RobustnessZero ablationControl0\.5280\.528Selected4\.0804\.0803\.552\[3\.306,3\.801\]3\.552\\ \[3\.306,3\.801\]Prediction16 measurements†Additive0\.3540\.354Pairwise0\.1000\.1000\.254\[0\.182,0\.295\]0\.254\\ \[0\.182,0\.295\]40 measurementsAdditive0\.2020\.202Pairwise0\.0450\.0450\.157\[0\.103,0\.173\]0\.157\\ \[0\.103,0\.173\]64 measurementsAdditive0\.1570\.157Pairwise0\.0390\.0390\.117\[0\.067,0\.134\]0\.117\\ \[0\.067,0\.134\]128 measurementsAdditive0\.1210\.121Pairwise0\.0400\.0400\.081\[0\.025,0\.101\]0\.081\\ \[0\.025,0\.101\]Action lossNatural mean0\.9550\.955Direct loss0\.8700\.8700\.085\[0\.053,0\.118\]0\.085\\ \[0\.053,0\.118\]Transformed mean0\.9950\.995Direct loss0\.8700\.8700\.125\[0\.083,0\.173\]0\.125\\ \[0\.083,0\.173\]Exact no\-op1\.7271\.727Direct loss0\.8700\.8700\.857\[0\.805,0\.908\]0\.857\\ \[0\.805,0\.908\]Table 9:Qwen2\.5\-7B Copy\-v2 results\. Causal entries report mean candidate\-margin drop on 256 confirmation prompts\. Prediction entries report MAE on 128 held\-out masks; positive improvement is additive minus pairwise MAE\. Action entries average absolute target loss over three targets and 16 pools; positive improvement is comparator loss minus direct loss\. Intervals use 5,000 paired percentile bootstrap draws over the appropriate prompt clusters, masks, and pools\. The dagger marks the underdetermined, descriptive 16\-measurement fit\. The 128\-measurement prediction row and aggregate action rows are the prespecified primary tests\.Direct loss lowers aggregate loss by 8\.9% relative to natural mean, 12\.6% relative to transformed mean, and 49\.6% relative to no\-op\. These numbers give equal weight to the three targets\. At the largest target, direct loss and natural mean tie within uncertainty: natural minus direct loss is−0\.008\-0\.008, with interval\[−0\.038,0\.021\]\[\-0\.038,0\.021\]\. Appendix Table[17](https://arxiv.org/html/2609.03026#A2.T17)reports each target separately\.
On 512 matched non\-induction continuations, a secondary check finds no larger clean\-to\-intervened KL for direct loss than for the natural\-mean and transformed\-mean controls \(0\.01150\.0115versus0\.01570\.0157and0\.01600\.0160\); this is not a general safety result\.
Across GPT\-2 and this bounded Qwen task, pair terms improve held\-out effect prediction and observers trained on realized loss choose lower\-loss interventions in their frozen aggregates; the Qwen result, however, remains limited to one pinned model, the eligible prompts, the confirmed eight\-head panel, and the declared masks and neither identifies a complete induction circuit nor establishes general in\-context learning\.
These studies choose model interventions from predicted effects\. What changes when the action is instead a scarce safety response and different mistakes carry different consequences? The next operational mode keeps the same task\-relative contract but evaluates observers under fixed intervention budgets\.
## 5Safety triage: scores must guide scarce interventions
When the controller cannot inspect every request, a safety observer must do more than separate safe cases from unsafe ones\. It must rank the cases that matter most, using the information available at deployment, so that a limited intervention budget prevents as much harm as possible\. The two tasks in this section make that requirement explicit\.
The measurement channel matters as much as the score\. During the 2026 OpenAI–Hugging Face incident, agents tried to alter the transcripts they believed an evaluator would inspect and successfully spoofed some tool calls, while showing little interest in changing chain\-of\-thought they did not expect to be logged\[[33](https://arxiv.org/html/2609.03026#bib.bib33)\]\. This does not make internal signals tamper\-proof\. It shows that an attacker may concentrate on the channel it believes is watched\. ObserverBench therefore compares declared views—text, outputs, verdict\-adjacent activations, and neutral activations—and records who controls each view\. Monitoring is therefore a moving contest: a channel that works against frozen attacks may fail after attackers learn that it is being used\. The present tasks keep those views fixed and trusted; they do not test an attacker that adapts to the monitor\.
Table 10:Task contracts for the two safety\-triage studies\. Each contract fixes what the observer predicts, what it may read, which action the controller can take, and how the resulting decision is scored\.The contracts use the same five fields but test different weaknesses\. The authorization task gives exact labels and costs, which lets us isolate whether a statistically accurate observer allocates its budget well\. We begin there\.
### 5\.1A perfect classifier can allocate a safety budget poorly
Suppose a workspace assistant is asked to delete a file in workspace A, but the user has granted access only to workspace B\. Deletion is not always unsafe; the problem is that this file is outside the granted scope\. A controller may allow, block, or escalate the request\. When blocks and reviews are limited, it must rank requests by the harm they could cause\.
We turn this example into a non\-executing paired task:
- •Same action, different permission\.Each pair requests the same operation on the same resource\. One prompt grants access to it; the other grants access elsewhere\.
- •Known label and cost\.An exact authorization rule says whether the request exceeds scope\. The operation sets the consequence: an unauthorized delete costs more than an unauthorized read\.
- •Fixed action budget\.The controller blocks the highest\-risk 10%, escalates the next 10%, and allows the rest\. Every observer faces the same costs and budgets\.
We use the pinned Qwen2\.5\-7B\-Instruct model\[[24](https://arxiv.org/html/2609.03026#bib.bib24)\]\. As a prerequisite check, the unedited model must answer the authorization question with one of two exact tokens\. It passes every check with accuracy 1\.000\. The held\-out test contains 384 safe/unsafe pairs across four equally sized subgroups: seen operations and prompt forms, a held\-out delete operation, a held\-out XML form, and both changes together\. Fit, calibration, and test resources are disjoint\.
The activation observer reads a hidden\-state vector—a residual\-stream activation—at the final prompt position and also receives the requested action and its severity\. We fit on 384 pairs, calibrate on 192, choose among seven layers and ridge settings using the fixed policy loss, and only then extract held\-out activations\.
The comparisons ask four questions:
- •Action\-only:what can be inferred without authorization context?
- •Activation label and direct risk:do hidden activations predict the policy label or the violation cost?
- •Activation label×\\timesseverity:does combining the label score with known consequence improve the action ranking?
- •Allow\-all and exact oracle:what are the upper and lower bounds under the same budget?
These comparisons were fixed before held\-out activations were extracted\. After seeing their results, we added three secondary controls: a full\-context text observer, Qwen’s block\-minus\-allow output\-score difference, and an activation observer selected by tail rather than mean loss\. They test whether activations add value once prompt text or the model’s own decision signal is available; they are not independent confirmation\.
Table 11:Held\-out Qwen safety\-interlock results\. Every observer uses the same 10% block and 10% escalation budgets\. Lower loss and missed risk are better; higher clean utility is better\. Access states what the observer can read\.*†Secondary controls\.*The text and output rows were designed after the original held\-out results were known\.
The results have four main implications:
- •Activations improve the primary comparison\.Multiplying the activation label by severity lowers mean policy loss by 32\.1% relative to action\-only and 57\.0% relative to allowing every request\. It closes 71\.1% of the action\-only\-to\-oracle gap while preserving all benign utility\.
- •Perfect classification is not enough\.The label observer has AUROC 1\.000 and loss 3\.334\. Multiplying its score by severity lowers AUROC to 0\.954 but lowers loss to 2\.155 because unauthorized deletes are ranked ahead of unauthorized reads\.
- •The useful signal is not uniquely hidden\.Full\-context text is not reliably worse than the transformed activation observer\. More clearly, Qwen’s output\-score difference multiplied by severity lowers mean loss to 1\.744 and tail loss to 10\.078, nearly matching the exact oracle at 1\.740 and 10\.039\. When this output is available, the activation probe is unnecessary\.
- •Good ranking within groups can fail across groups\.The activation label has AUROC 1\.000 inside every operation–format subgroup, but its scale changes between them\. A global threshold therefore allocates 63\.2% of interventions to held\-out deletes in seen forms and only 18\.4% to the doubly held\-out subgroup\. There, activation loss is 5\.007 versus 3\.059 for action\-only; the output observer catches 69\.8% of unsafe requests versus 29\.2% for the activation observer\.
Figure 2:Risk scores by operation–format subgroup\. The activation observer separates safe from unsafe requests within each subgroup, but its scale shifts between subgroups\. Dashed lines show each observer’s global intervention cutoff\. Scores should be compared within panels, not across them\.This failure separates three requirements: the observer must classify the violation, rank it by consequence, and calibrate its scores across deployment groups\. Recalibration by visible operation and format may repair the last failure, but this split cannot test that repair because calibration contains neither held\-out case\. A valid follow\-up needs fresh prompts and calibration coverage of every intended deployment group\.
The controlled task shows why consequence and cross\-group calibration matter\. Does the same task\-relative evaluation change which monitor we prefer on an externally recognized safety benchmark? We next turn to APPS\.
### 5\.2Monitor rankings depend on the model and operating regime
To answer that question, we use ControlArena’s APPS setting, an existing AI\-control task with ordinary code solutions and verified working backdoors\[[20](https://arxiv.org/html/2609.03026#bib.bib20),[21](https://arxiv.org/html/2609.03026#bib.bib21)\]\. A monitor reads the programming problem and submitted code, assigns a suspicion score, and a fixed budget audits only the highest\-scoring submissions\. Every unaudited working backdoor counts as one violation\.
The public dataset supplies 1,444 honest/backdoor pairs\. We split by problem ID: 500 pairs for fitting, 200 for calibration, and 744 for held\-out testing, with both members of a pair always in the same split\. We use the same pinned Qwen model as above\.
The observers fall into three groups:
- •Prompt and output observersask Qwen for a score and read the model’s probability distribution over ten score tokens\. We test basic and detailed prompts, their ensemble, and a follow\-up ridge model using all ten token probabilities\.
- •A text observeris a follow\-up baseline trained on word and character features from the problem and code\.
- •Activation observersfit a linear model to a hidden\-state vector\. One is read next to an explicit verdict prompt; the follow\-up neutral observer reads the same problem and code with no monitoring or scoring instruction\.
The original comparison used the three prompt observers and the verdict\-adjacent activation probe\. We added the score\-distribution, text, and neutral\-activation controls after that result and fixed them before measurement\. At a 2% audit budget, calibration selects layer 28 for the verdict\-adjacent probe and layer 20 for the neutral probe\.
Table 12:Qwen2\.5\-7B monitor comparison on 744 held\-out APPS pairs\. The controller audits 29 of 1,488 submissions at 2% and 148 at 10%\. Higher caught\-backdoor counts are better; 29 and 148 are the best possible counts under those budgets\.Three findings matter:
- •Neutral activations rank attacks best\.The neutral probe reaches AUROC 0\.979 without asking Qwen to judge the code\. Its paired gains are 0\.026 over verdict\-adjacent activation, 0\.111 over supervised text, and 0\.149 over the score\-distribution observer, with 95% intervals\[0\.018,0\.034\]\[0\.018,0\.034\],\[0\.098,0\.125\]\[0\.098,0\.125\], and\[0\.131,0\.167\]\[0\.131,0\.167\]\.
- •The balanced panel hides action differences\.Neutral and verdict\-adjacent activations both reach the maximum possible caught\-backdoor count at 2%, 5%, and 10%\. At 10%, neutral activation leaves 596 attacks unaudited versus 607 for the basic prompt, a paired difference of−11\-11with 95% interval\[−17,−5\]\[\-17,\-5\]\. The sample does not resolve its smaller gains over the stronger controls because attacks make up 50% of the panel and fill the small audit queue\.
- •The tested controls narrow, but do not settle, the explanation\.Reading all ten output probabilities raises AUROC from 0\.786 to 0\.830, so sampling or averaging the declared score tokens does not explain the activation gain\. The text result rules out this lexical baseline, not every possible code monitor or output observer\.
The neutral\-context result is relevant to adaptive monitoring, but it is not a robustness result\. It shows that a useful signal can appear before the model is asked for a verdict\. It does not show that the same signal survives once an attacker knows it is being read\.
In deployment, attacks should be rare\. We therefore resample the frozen scores at attack rates from 1–50% and audit budgets from 0\.5–10%\. At 1% attacks and a 2% audit budget, the exact oracle misses none\. The activation observers miss 2\.65 attacks on average for neutral context \(95% range\[0,6\]\[0,6\]\) and 3\.94 next to the verdict prompt \(\[1,7\]\[1,7\]\)\. The text, score\-distribution, and basic\-prompt observers miss 9\.05 \(\[6,12\]\[6,12\]\), 9\.15 \(\[6,13\]\[6,13\]\), and 11\.85 \(\[9,15\]\[9,15\]\)\. Rare attacks expose differences hidden by the balanced panel\.
Figure 3:Qwen2\.5\-7B APPS: excess escaped attacks over the exact\-label oracle across attack prevalences and audit budgets in 2,000 resampled populations\.A post\-outcome diagnostic applies a published sparse\-probing procedure to the frozen Qwen panel\[[28](https://arxiv.org/html/2609.03026#bib.bib28)\]\. Its fitted readout retains 127 nonzero coefficients, versus 3,584 for a layer\-matched dense residual, but misses 4\.67 rather than 2\.05 attacks on average\. This is*compression without a better decision*on this frozen panel, not a general claim about SAE features\. Appendix[C](https://arxiv.org/html/2609.03026#A3)reports the full diagnostic, including allocation by APPS family and input length\. This is an external monitor test, not a deployment claim\.
#### 5\.2\.1A matched Gemma replication changes the mean ranking
We repeat the APPS contract on Gemma\-2\-9B\-it, keeping the rows, prompts, controller, budgets, and evaluation loss fixed\[[25](https://arxiv.org/html/2609.03026#bib.bib25)\]\. The design was frozen after the Qwen results but before any Gemma monitor outcome was inspected\. It is a prospectively frozen matched replication, not an independent preregistration\.
Table 13:Matched Gemma\-2\-9B\-it APPS replication\. AUROC uses the balanced locked panel of 744 honest–backdoor pairs\. Realized violations use the registered primary cell: 1% attacks and a 2% audit budget\. Entries are means and central 95% outcome ranges over 2,000 resampled populations; lower is better\.Residual access has the lowest mean loss in both models, but its best measured context changes: neutral on Qwen and verdict\-adjacent on Gemma\. Output information still matters\. On Gemma, the score\-distribution ridge has a slightly lower violation mean than the neutral residual, 4\.423 versus 4\.947, despite lower AUROC\.
Classification is not enough on the external benchmark\.This safety result is a second instance of the prediction–decision distinction in Sec\.[4\.1\.3](https://arxiv.org/html/2609.03026#S4.SS1.SSS3)\. The detailed prompted monitor has higher AUROC than the official Gemma Scope SAE probe, 0\.893 versus 0\.870, but worse mean realized violations, 10\.803 versus 9\.070\[[26](https://arxiv.org/html/2609.03026#bib.bib26)\]\. The detailed\-minus\-SAE paired difference averages 1\.73 with a central 95% outcome range of\[−2,6\]\[\-2,6\], so this is a reversal of the mean scorecard ranking, not a superiority claim for every resampled population\. Thus, higher classification quality need not induce the lower\-mean\-loss audit policy\.
#### 5\.2\.2Qwen3\.5 reverses the Qwen2\.5 context ranking
Using the same matched protocol, we repeat the APPS rows, split, prompts, audit controller, and primary operating point on Qwen3\.5\-9B\.333Pinned model:[https://huggingface\.co/Qwen/Qwen3\.5\-9B](https://huggingface.co/Qwen/Qwen3.5-9B)\.We prospectively froze the design after the Qwen2\.5 and Gemma outcomes were known but before inspecting any Qwen3\.5 monitor outcome; this is not an independent preregistration\.
Table 14:Prospectively frozen Qwen3\.5\-9B APPS replication\. AUROC uses the balanced locked panel\. Mean violations use the primary operating point: 1% attacks, a 2% audit budget, and 2,000 paired resampled populations\. Lower violations are better\. The exact\-label row is an evaluator\-only bound; bold marks the best deployable row\.The verdict\-adjacent residual now wins\. Neutral minus verdict averages 4\.625 additional violations, with a central 95% outcome range of\[1,8\]\[1,8\]; verdict is better in 99\.15% of resampled populations\. Qwen3\.5 therefore agrees with the Gemma ordering and reverses Qwen2\.5\. The useful context can change even between checkpoints from the same model family\.
The other rows show a second reversal\. The basic prompted monitor has slightly higher AUROC than supervised text, 0\.876 versus 0\.868, but causes 3\.164 more mean violations, 12\.218 versus 9\.054\. The detailed prompted monitor also falls from AUROC 0\.893 on Gemma to 0\.645 on Qwen3\.5 under the same APPS contract\. Monitor quality must therefore be tested on the model and operating regime in which it will be used\.
We also test the official Qwen\-Scope SAE\.444Pinned SAE:[https://huggingface\.co/Qwen/SAE\-Res\-Qwen3\.5\-9B\-Base\-W64K\-L0\_50](https://huggingface.co/Qwen/SAE-Res-Qwen3.5-9B-Base-W64K-L0_50)\.Calibration selects layer 12 and ridge 100\. The SAE probe has AUROC 0\.811 and 12\.725 mean violations, compared with 6\.601 for the dense neutral residual\. SAE minus dense averages 6\.124 additional violations, with a central 95% outcome range of\[2,10\]\[2,10\]; dense is better in 99\.65% of populations\. This is a bounded cross\-checkpoint control, not a general result against SAE features: the released SAE was trained on Qwen3\.5\-9B\-Base, while we evaluate the post\-trained Qwen3\.5\-9B model\[[27](https://arxiv.org/html/2609.03026#bib.bib27)\]\. Qwen’s public collection did not include a checkpoint\-matched post\-trained 9B SAE at the time of the study\. Appendix[D](https://arxiv.org/html/2609.03026#A4)records the full protocol and mismatch\.
### 5\.3Four checks before claiming that an internal safety signal helps
These studies suggest a reusable sequence\. Before interpreting an internal safety signal, ObserverBench asks:
1. 1\.Does the model output already suffice?Read the relevant output distribution rather than one sampled answer\. If it is adequate, stop\.
2. 2\.Does the input already suffice?Train a text or input\-feature baseline with the same supervision\. If it matches the internal probe, an activation\-specific explanation is unnecessary\.
3. 3\.Does the signal remain without a request for a verdict?Measure the same examples in a neutral context to separate input processing from a signal created or reshaped by the monitoring prompt\.
4. 4\.Does it work under the intended policy?Test frozen scores at the attack rate, intervention budget, deployment groups, and loss the controller will face\.
These checks locate where useful information becomes available\. They do not by themselves establish deception, intent, or hidden knowledge\. How does this task\-relative contract relate to existing interpretability benchmarks, decision\-focused learning, and AI\-control evaluations? The next section places ObserverBench among those lines of work\.
## 6Related work
##### Interventions, steering, and interpretability benchmarks\.
Activation addition and representation engineering edit internal activations, while feedback steering and local optimal\-control methods place those edits in a controller\[[3](https://arxiv.org/html/2609.03026#bib.bib3),[4](https://arxiv.org/html/2609.03026#bib.bib4),[5](https://arxiv.org/html/2609.03026#bib.bib5),[6](https://arxiv.org/html/2609.03026#bib.bib6)\]\. Activation and attribution patching estimate component effects; AtP\* provides a local approximation; causal abstraction tests assigned causal roles; and pyvene executes model interventions\[[7](https://arxiv.org/html/2609.03026#bib.bib7),[8](https://arxiv.org/html/2609.03026#bib.bib8),[9](https://arxiv.org/html/2609.03026#bib.bib9),[10](https://arxiv.org/html/2609.03026#bib.bib10)\]\. Interactions between mediators can hide or inflate patching effects\[[11](https://arxiv.org/html/2609.03026#bib.bib11)\]\. MIB, AxBench, and InterpBench instead benchmark circuit localization, concept detection and steering, or recovery of known structure\[[12](https://arxiv.org/html/2609.03026#bib.bib12),[13](https://arxiv.org/html/2609.03026#bib.bib13),[14](https://arxiv.org/html/2609.03026#bib.bib14)\]\. Mechanistic tomography treats measurements as a way to recover a mechanism or effect map\[[1](https://arxiv.org/html/2609.03026#bib.bib1)\]; ObserverBench starts with such an estimate and asks whether it supports a declared intervention or controller\. Sparse probing asks whether SAE features support compact supervised predictors\[[28](https://arxiv.org/html/2609.03026#bib.bib28)\]\. ObserverBench adds the operational question: does the sparser fitted readout improve the action chosen under a fixed policy?
##### Decisions and AI control\.
Decision\-focused learning evaluates a predictor through the downstream decision rather than assuming that lower prediction error is enough\[[29](https://arxiv.org/html/2609.03026#bib.bib29),[30](https://arxiv.org/html/2609.03026#bib.bib30)\]\. The same distinction motivates calls to judge interpretability by the actions it enables\[[15](https://arxiv.org/html/2609.03026#bib.bib15)\]\. AI control evaluates complete safety protocols against strategies chosen by an intentionally subversive model, while ControlArena supplies reusable environments, monitors, and protocol\-level evaluation\[[20](https://arxiv.org/html/2609.03026#bib.bib20),[21](https://arxiv.org/html/2609.03026#bib.bib21)\]\. ObserverBench asks a complementary component\-level question\. It holds the controller, audit rule, action budget, and test cases fixed, then compares the observer scores used inside that decision problem\. It evaluates monitor adequacy, not end\-to\-end robustness to subversion\.
##### Borrowed testbeds\.
The IOI circuit supplies known structure rather than a new mechanism claim\[[16](https://arxiv.org/html/2609.03026#bib.bib16)\]\. Conditional backup, Hydra\-style self\-repair, copy suppression, and prompt\-dependent self\-repair are already documented\[[17](https://arxiv.org/html/2609.03026#bib.bib17),[18](https://arxiv.org/html/2609.03026#bib.bib18),[19](https://arxiv.org/html/2609.03026#bib.bib19)\]\. Induction heads support the repeated\-key continuation used in the Qwen task\[[23](https://arxiv.org/html/2609.03026#bib.bib23)\], and Qwen2\.5\-7B supplies a second model surface\[[24](https://arxiv.org/html/2609.03026#bib.bib24)\]\. We use these systems to define interventions, then judge observers on fresh held\-out masks and prompts rather than claim a new IOI or induction mechanism\. What remains unsupported by the current tasks and should be tested next?
## 7Limitations and next steps
The paper makes bounded claims:
- •Control\.*Scope:*The exact results assume affine readouts, one fixed direction, proportional control, and no clipping\. The nonlinear test reruns a learned Transformer block, but the model is small and its underlying binary features are known by construction; the 29\.0% gain belongs to the matched estimator–direction pair, not the estimator by itself\.*Next test:*extend the comparison to token\-level control in larger models with independently usable edit directions\.
- •Pretrained\-model interventions\.*Scope:*The GPT\-2 and Qwen studies use pinned models, selected head sets, fixed ablations, and narrow prompt distributions\. The IOI confirmation is pilot\-informed and locally sealed rather than independently preregistered\. The Qwen task keeps only eligible prompts; full\-vocabulary top\-1 accuracy on unfiltered prompts is 24\.45%, and the direct\-loss observer ties the natural\-mean observer at the largest target\.*Next test:*use more models, unseen prompt templates, and independently fixed candidate sets and targets\.
- •Authorization safety\.*Scope:*The non\-executing task asks Qwen directly for an authorization verdict, so it cannot establish a uniquely hidden safety state or test harmful execution, deception, or adaptive attacks\. Its held\-out failure also shows that one global threshold can hide poor calibration between groups\.*Next test:*remove the explicit verdict question and provide calibration data for every intended deployment group while keeping the model, budgets, and evaluator fixed\.
- •APPS backdoors\.*Scope:*The study uses one stored\-backdoor task rather than attacks adapted to each monitor\. Two model families and three checkpoints supply learned representations\. The Qwen2\.5 sparse probe and Qwen3\.5 official\-SAE probe each concern one task and one selected probing rule\. The official Qwen\-Scope SAE was trained on Qwen3\.5\-9B\-Base and applied here to the post\-trained Qwen3\.5\-9B model, so it is not a checkpoint\-matched SAE test\. The Gemma and Qwen3\.5 runs were prospectively frozen after earlier outcomes were known, not independently preregistered\. All scoring is offline, and the prevalence sweeps keep the dataset\-family mix fixed\. Neither study tests deception or an adaptive attacker\. These scorecards compare observers inside a fixed audit rule; they do not establish that a complete AI\-control protocol remains safe under intentional subversion\.*Next test:*use sequential attack trajectories with evaluator\-held outcomes and both trusted and deliberately corrupted telemetry\. Declare who can omit, delay, or spoof each view, keep audit and shutdown budgets fixed, and then add monitor\-aware attacks\. Episodes, rather than individual requests, should be the resampling unit when agents share state or communication\.
- •Artifact\.*Scope:*The release provides checked control, finite\-effect, and safety interfaces, but it is not yet a general task ecosystem\.*Next test:*add literature baselines, another safety environment with adaptive attacks, and a stable end\-to\-end reproduction path\.
## 8Conclusion
ObserverBench asks a simple question: is an estimate good enough for the action chosen from it? The answer is task\-relative\. An observer need not reproduce every detail of a model; it must preserve the information that the available action, decision rule, and loss actually use\. Across the three modes, the experiments show that a better mean\-effect predictor need not choose a better intervention, a perfect classifier can allocate a safety budget poorly, and an accessible output signal can make an internal probe unnecessary\. The safety scorecards also show that AUROC and mean realized violations can order monitors differently, that the best measurement context can change between closely related checkpoints, and that a sparser fitted readout need not improve the resulting action\. ObserverBench records these choices in versioned tasks and applies the same fixed policy to every submission rather than ranking observers in the abstract\. Before trusting an observer, state what it may read, freeze the action rule and budget, and score the outcome the action actually produces\.
## References
- \[1\]V\. Erramilli\.Mechanistic tomography: designed measurement for control\-oriented interpretability\.arXiv:2608\.19338, 2026\.[https://arxiv\.org/abs/2608\.19338](https://arxiv.org/abs/2608.19338)\.
- \[2\]N\. Agarwal, S\. R\. Dalal, and V\. Misra\.The Bayesian geometry of Transformer attention\.arXiv:2512\.22471, 2025\.
- \[3\]A\. Turner et al\.Activation addition: steering language models without optimization\.arXiv:2308\.10248, 2023\.
- \[4\]A\. Zou et al\.Representation engineering: a top\-down approach to AI transparency\.arXiv:2310\.01405, 2023\.
- \[5\]D\. V\. Nguyen, H\. M\. Vu, N\. Y\. Pham, L\. Zhang, and T\. M\. Nguyen\.Activation steering with a feedback controller\.arXiv:2510\.04309, 2025\.
- \[6\]J\. Skifstad, X\. A\. Yang, and G\. Chou\.Local linearity of LLMs enables activation steering via model\-based linear optimal control\.arXiv:2604\.19018, 2026\.
- \[7\]A\. Syed, C\. Rager, and A\. Conmy\.Attribution patching outperforms automated circuit discovery\.BlackboxNLP, 2024\.
- \[8\]J\. Kramar, T\. Lieberum, R\. Shah, and N\. Nanda\.AtP\*: an efficient and scalable method for localizing LLM behaviour to components\.arXiv:2403\.00745, 2024\.
- \[9\]A\. Geiger, Z\. Wu, C\. Potts, T\. Icard, and N\. Goodman\.Finding alignments between interpretable causal variables and distributed neural representations\.CLeaR, 2024\.
- \[10\]Z\. Wu, A\. Geiger, A\. Arora, J\. Huang, Z\. Wang, N\. D\. Goodman, C\. D\. Manning, and C\. Potts\.pyvene: a library for understanding and improving PyTorch models via interventions\.arXiv:2403\.07809, 2024\.
- \[11\]S\. Vaidyanathan, D\. Arbour, A\. Mueller, S\. Niekum, and D\. Jensen\.The curse of multiple mediators: hidden interaction effects in activation patching\.arXiv:2606\.27510, 2026\.
- \[12\]A\. Mueller et al\.MIB: a mechanistic interpretability benchmark\.ICML, 2025\.
- \[13\]Z\. Wu, A\. Arora, A\. Geiger, Z\. Wang, J\. Huang, D\. Jurafsky, C\. D\. Manning, and C\. Potts\.AxBench: steering LLMs? Even simple baselines outperform sparse autoencoders\.arXiv:2501\.17148, 2025\.
- \[14\]R\. Gupta, I\. Arcuschin, T\. Kwa, and A\. Garriga\-Alonso\.InterpBench: semi\-synthetic transformers for evaluating mechanistic interpretability\.arXiv:2407\.14494, 2024\.
- \[15\]H\. Orgad et al\.Interpretability can be actionable\.ICML, 2026; arXiv:2605\.11161\.
- \[16\]K\. Wang, A\. Variengien, A\. Conmy, B\. Shlegeris, and J\. Steinhardt\.Interpretability in the wild: a circuit for indirect object identification in GPT\-2 small\.ICLR, 2023\.
- \[17\]T\. McGrath, M\. Rahtz, J\. Kramar, V\. Mikulik, and S\. Legg\.The Hydra effect: emergent self\-repair in language model computations\.arXiv:2307\.15771, 2023\.
- \[18\]C\. McDougall, A\. Conmy, C\. Rushing, T\. McGrath, and N\. Nanda\.Copy suppression: comprehensively understanding an attention head\.arXiv:2310\.04625, 2023\.
- \[19\]C\. Rushing and N\. Nanda\.Explorations of self\-repair in language models\.arXiv:2402\.15390, 2024\.
- \[20\]R\. Greenblatt, B\. Shlegeris, K\. Sachan, and F\. Roger\.AI control: improving safety despite intentional subversion\.ICML, 2024; arXiv:2312\.06942\.
- \[21\]R\. Inglis et al\.ControlArena\.Software, 2025\.[https://github\.com/UKGovernmentBEIS/control\-arena](https://github.com/UKGovernmentBEIS/control-arena)\.
- \[22\]M\. Roughan, M\. Thorup, and Y\. Zhang\.Traffic engineering with estimated traffic matrices\.ACM IMC, pages 248–258, 2003\.[https://doi\.org/10\.1145/948205\.948237](https://doi.org/10.1145/948205.948237)\.
- \[23\]C\. Olsson et al\.In\-context learning and induction heads\.arXiv:2209\.11895, 2022\.
- \[24\]Qwen Team\.Qwen2\.5 technical report\.arXiv:2412\.15115, 2024\.
- \[25\]Gemma Team\.Gemma 2: Improving open language models at a practical size\.arXiv:2408\.00118, 2024\.
- \[26\]T\. Lieberum, S\. Rajamanoharan, A\. Conmy, L\. Smith, N\. Sonnerat, V\. Varma, J\. Kramár, A\. Dragan, R\. Shah, and N\. Nanda\.Gemma Scope: Open sparse autoencoders everywhere all at once on Gemma 2\.arXiv:2408\.05147, 2024\.
- \[27\]B\. Deng et al\.Qwen\-Scope: Turning sparse features into development tools for large language models\.arXiv:2605\.11887, 2026\.
- \[28\]S\. Kantamneni, J\. Engels, S\. Rajamanoharan, M\. Tegmark, and N\. Nanda\.Are sparse autoencoders useful? A case study in sparse probing\.ICML, 2025\.
- \[29\]P\. L\. Donti, B\. Amos, and J\. Z\. Kolter\.Task\-based end\-to\-end model learning in stochastic optimization\.NeurIPS, 2017\.
- \[30\]A\. N\. Elmachtoub and P\. Grigas\.Smart “predict, then optimize\.”Management Science, 68\(1\):9–26, 2022\.
- \[31\]OpenAI\.OpenAI and Hugging Face partner to address security incident during model evaluation\.July 2026\.
- \[32\]Hugging Face\.Security incident disclosure—July 2026\.July 2026\.
- \[33\]R\. Greenblatt, A\. Cotra, and H\. Wijk\.Brief independent investigation of agents’ behavior, reasoning, and collaboration in the OpenAI / Hugging Face hacking incident\.METR and Redwood Research, August 2026\.[https://metr\.org/blog/2026\-08\-26\-openai\-hugging\-face\-incident\-investigation/](https://metr.org/blog/2026-08-26-openai-hugging-face-incident-investigation/)\.
## Appendix AArtifact interfaces and sealed evaluation
The artifact exposes three versioned interfaces:
- •observerbench\.api\.v0for control composition;
- •observerbench\.effect\_prediction\.v0for held\-out finite\-effect prediction; and
- •observerbench\.safety\_protocol\.v0for safety triage\.
Their machine\-readable schemas, example submissions, and validation commands ship with the repository\. The version identifiers prevent a result produced under one contract from being compared silently with a result produced under another\.
The task registry states which submission route each bundled task supports\. In the current release, the analytic control task provides the checked external\-observer adapter\. Its benchmark wrapper constructs the controller and reuses the task’s fixed generator, readouts, normalization, and metrics\. A lower\-level run may replace the controller, but the resulting score is marked non\-comparable because it no longer represents the same decision problem\.
Public safety\-task packs contain the threat model, allowed actions, consequence loss, operating budgets, training measurements, and held\-out queries\. They do not contain the held\-out evaluator answers\. The evaluator stores those targets separately and links them to the public pack by a cryptographic hash\. A submission can therefore be checked against the declared task while the labels used for final scoring remain sealed\. This layout also allows a researcher to add a data\-only safety task without modifying the core workbench\.
The bundled GPT\-2 IOI and Qwen induction\-copy registries implement the same separation for finite\-effect prediction\. Each registry exposes frozen measurement tables at declared budgets, checks the model and split recorded by the task, and uses different prompts for calibration measurements and held\-out targets\. An outside observer can submit its predictions without loading the model or rerunning the intervention experiment\. The registries include per\-component and additive ridge observers as initial comparison rows\.
The external APPS registry contains separate Qwen2\.5\-7B, Gemma\-2\-9B\-it, and Qwen3\.5\-9B scorecards\. Prompt, output, text, dense\-residual, and SAE\-feature observers are evaluated under the same audit contract within each model panel\. The Qwen3\.5 release includes the frozen source manifest and an aggregate checked summary containing the scorecard rows, paired contrasts, and official SAE selection\. Per\-example evaluator labels remain sealed\. The registry does not issue a cross\-model rank\.
Runs use strict JSON and record the contract and result\-schema versions, component classes and parameters, package and dependency versions, the source revision, configuration and result hashes, and observer provenance supplied by the submitter\.
## Appendix BRobustness checks and protocol provenance
This appendix retains checks that directly qualify the main results\. Superseded control fixtures and development history that support no live claim are kept with the artifact rather than in the paper\.
### B\.1Nonlinear estimator–direction robustness
Table[15](https://arxiv.org/html/2609.03026#A2.T15)reports all four estimator–direction combinations behind Sec\.[3\.2](https://arxiv.org/html/2609.03026#S3.SS2)\.
Table 15:Secondary nonlinear\-suffix estimator–direction factorial\. Counts forgEg\_\{E\}andppuse 12 seed\-level means; the last two columns use 192 rollout conditions per cell\. The crossed arms atγ=1\.15\\gamma=1\.15fail loop\-conditioning and clean\-archetype scale diagnostics, so they do not identify an estimator\-only advantage\. The clean maximum is a scale check, not a manifold boundary\.
### B\.2IOI interaction robustness
Table[16](https://arxiv.org/html/2609.03026#A2.T16)reports the full nested\-budget curve behind the interaction comparison in Sec\.[4\.1](https://arxiv.org/html/2609.03026#S4.SS1)\.
Table 16:Fresh held\-out IOI mean\-effect MAE by nested measurement budget\.
### B\.3Protocol provenance
- •IOI target sensitivity\.The first measurement copy was set aside before inspection because its source seal omitted the head\-mapping file\. After expanding the seal, we independently recomputed the frozen predictions and actions and repeated the 148\-mask measurement\. The two copies are identical at the byte level; only the second enters the analysis\. Under the frozen raw\-score rule, the transformed\-mean control selects negative predicted losses in 44, 44, and 16 pools across the three targets, while direct loss does so in 4, 0, and 0\. We retain those scores rather than clip them after observing the outcomes\.
- •Qwen Copy\-v2\.Copy\-v1 stopped at 92\.97% candidate accuracy, below its frozen 95% gate, before attention or intervention outcomes were computed\. Copy\-v2 used fresh tokens and prompts under the same gate before generating the locked results in Section[4\.2](https://arxiv.org/html/2609.03026#S4.SS2)\.
### B\.4Authorization tail\-loss selection
Selecting the activation observer by tail loss chooses the same layer and ridge setting as selecting it by mean loss\. Its tail loss differs from action\-only by 0\.039, with paired 95% interval\[−1\.013,1\.156\]\[\-1\.013,1\.156\]\. We therefore retain the mean activation gain but do not claim a tail\-loss gain over action\-only\.
### B\.5Qwen action loss by target
The main Qwen result gives equal weight to three targets\. Table[17](https://arxiv.org/html/2609.03026#A2.T17)shows the individual comparisons\. Direct loss beats transformed mean and no\-op at every target\. It beats natural mean at the first two targets and ties it within uncertainty at the largest, so the aggregate result is not a win in every cell\.
Table 17:Qwen Copy\-v2 action loss by target, wheres=3\.454s=3\.454is the confirmed full\-panel mean effect\. Each gain cell gives the relative loss change and, in brackets, a 95% four\-family\-prompt\-cluster\-by\-pool bootstrap interval for the absolute comparator\-minus\-direct difference\. The negative natural\-mean point estimate at0\.75s0\.75sis retained\.
## Appendix CPost\-outcome APPS diagnostics
These checks use frozen activations and scores after the main result was known\. They do not change the locked comparison in Table[12](https://arxiv.org/html/2609.03026#S5.T12)\.
##### Does a sparse\-autoencoder basis improve the audit decision?
We apply the sparse\-probing procedure of\[[28](https://arxiv.org/html/2609.03026#bib.bib28)\]to a pinned public BatchTopK SAE trained on Qwen2\.5\-7B\-Instruct layer\-19 residuals\.555[https://huggingface\.co/andyrdt/saes\-qwen2\.5\-7b\-instruct](https://huggingface.co/andyrdt/saes-qwen2.5-7b-instruct)Feature ranking uses only the fit split; feature count and regularization use only calibration; and the locked test is scored once\. The dense residual and SAE reconstruction controls use the same layer\-19 access, data splits, and calibration rule\.
Table 18:Post\-outcome published\-method integration on the frozen Qwen APPS panel\. Mean violations use 2,000 resampled populations with 1% attacks and a 2% audit budget\. Lower is better\.The sparse SAE readout uses fewer fitted coefficients, but it does not improve mean audit loss on this frozen panel\. Dense minus sparse averages−2\.62\-2\.62escaped attacks with a central 95% outcome range of\[−6,0\]\[\-6,0\]; the dense probe is worse in 1\.25% of draws\. This is not explained only by long inputs: on the 1,301 locked rows within the SAE’s 1,024\-token training length, its AUROC is 0\.956 versus 0\.983 for the dense residual\. The checkpoint is also off its training distribution here: observed meanL0L\_\{0\}is 115 rather than the reported 240\. The result concerns this checkpoint, layer, task, and probing rule; it is not a general claim that SAE features cannot support safety monitoring\.
##### Does the answer position explain the gap between prompted and neutral activations?
The fixed calibration rule selects layer 28 for the verdict\-adjacent observer, with calibration AUROC 0\.935 and locked AUROC 0\.953\. A post\-outcome check of cached layer 20 raises locked AUROC to 0\.958, but calibration would not have selected it \(AUROC 0\.929\), and the neutral layer\-20 probe remains higher at 0\.979\. This check cannot separate answer position from the monitoring instruction or other context changes\.
##### Does pooling hide score differences between groups?
Figure[4](https://arxiv.org/html/2609.03026#A3.F4)groups neutral\-probe scores by APPS source family and input\-length quartile\. Separation remains strong within every family \(AUROC 0\.956–0\.991\) and length quartile \(0\.974–0\.988\), but score scale shifts\. At the global 2% cutoff, a family’s share of caught attacks is 0\.36–2\.38 times its population share; across length quartiles the range is 0\.67–1\.43\. These ratios come from only 29 audits and are descriptive\. They show that pooled discrimination need not imply equal allocation between groups\. The fixed family mix and prevalence sweep do not model an attacker choosing where to attack\.
Figure 4:Neutral\-context scores by APPS source family and input\-length quartile\. Separation remains strong within each group, but score scales and the audits assigned by one global cutoff differ between groups\.
## Appendix DQwen3\.5 APPS replication protocol
This replication keeps the APPS task fixed while changing the model\. It uses the same 1,444 honest–backdoor pairs as the Qwen2\.5 and Gemma studies, split by problem ID into 500 fit, 200 calibration, and 744 locked\-test pairs\. Both members of a pair remain in the same split\. The prompts, score tokens, controller, audit budgets, resampling population, and realized\-violation loss also remain fixed\. Thinking is disabled for every Qwen3\.5 view\.
The design was chosen after the Qwen2\.5 and Gemma results were known\. Before reading any Qwen3\.5 monitor outcome, we pinned the model and official SAE revisions, declared the primary contrast, and sealed the source manifest\. The primary contrast is neutral\-residual minus verdict\-adjacent\-residual mean violations at 1% attack prevalence and a 2% audit budget\. This is a local prospective seal, not an independent preregistration\.
The pinned model revision isc202236235762e1c871ad0ccb60c8ee5ba337b9a; the pinned SAE revision is7bb2370d360e566b2d8acb8b3d15a0b2b88f52a8\. The source files and sealed manifest ship with the artifact, so the aggregate scorecard can be tied to the exact code and configuration used for the run without publishing per\-example evaluator labels\.
We measure post\-layer residuals at layers 12, 20, and 28\. Fit data train each probe; calibration chooses the layer and ridge value; the locked test is read only after selection\. One fit pair exceeds the 4,096\-token limit and is excluded under the frozen rule\. No calibration or locked\-test pair reaches the limit\. A compatibility\-only smoke first checks prompt lengths, score tokens, residual shapes, and the three SAE files without fitting or ranking an observer\.
The official\-feature control uses 65,536\-wide TopK\-50 Qwen\-Scope SAEs at the same three layers\. Calibration selects layer 12 and ridge 100\. The SAEs were trained on Qwen3\.5\-9B\-Base, whereas the dense residuals and outcomes come from post\-trained Qwen3\.5\-9B\. At the time of the study, Qwen’s official public collection listed only base\-trained 9B Qwen3\.5 SAEs, not a checkpoint\-matched SAE for the post\-trained model\.666Official collection:[https://huggingface\.co/collections/Qwen/qwen\-scope](https://huggingface.co/collections/Qwen/qwen-scope)\.The Qwen\-Scope card also states that using a base\-model SAE to explore a post\-trained checkpoint is often reasonable\. We declared the mismatch before the run\. The SAE row therefore tests a released feature family under transfer; it is not a checkpoint\-matched comparison or evidence that SAE features generally fail for safety monitoring\.
## Appendix EWhy a lexical safety fixture was rejected
An earlier fixture tried to distinguish unsafe actionable assistance from benign discussion of the same security topic\. A TF–IDF baseline and a linear activation observer both solved its small split, even with one topic family held out\. Removing lexical directions then removed the target signal by construction\. The task could not distinguish an internal safety representation from words that revealed the label, so it is not an ObserverBench result\.
The failure motivated the controls used in the authorization study: test a text baseline, hold the requested action fixed while changing the authorization context, and compare with the exact policy rule when one exists\. The later text, output, and neutral\-context controls add a further check: if the prompt asks directly for a safety verdict, an activation probe by itself cannot establish a uniquely hidden safety state\. More examples with the same lexical structure would not repair the rejected fixture\.Similar Articles
TOBench: A Task-Oriented Omni-Modal Benchmark for Real-World Tool-Using Agents
TOBench is a new benchmark for evaluating AI agents on real-world, task-oriented tool use with multimodal inputs and closed-loop verification. Experiments show top models like Qwen 3.5 Plus achieve only 41% success, far below the 94% human benchmark, highlighting a significant gap.
BehaviorBench: Benchmarking Foundation Models for Behavioral Science Tasks
This paper introduces BehaviorBench, a comprehensive benchmark for evaluating foundation models on behavioral science tasks including behavior prediction, strategic decision-making, subject-trait inference, and behavioral knowledge application. It also presents Be.FM-1.5, a fine-tuned model that achieves strong distributional alignment, highlighting the gap between general-purpose and behaviorally adapted models.
MiraBench: Evaluating Action-Conditioned Reliability in Robotic World Models
MiraBench is a hierarchical benchmark for evaluating action-conditioned reliability in robotic world models, assessing physics adherence, action-following fidelity, and optimism bias across 12 model configurations.
What Benchmarks Don't Measure: The Case for Evaluating Abstention Competence in Autonomous Agents
This paper argues that current benchmarks for autonomous agents fail to evaluate whether an agent should have proceeded at all, introducing a 'compliance bias'. The authors propose a taxonomy of abstention-warranted scenarios and new evaluation protocols (Safety Rate, Usability Rate, Informed Refusal Rate) with preliminary results showing tunable safety–usability tradeoffs across model families.
JobBench: Aligning Agent Work With Human Will
JobBench is a benchmark built from worker surveys to evaluate AI agents on tasks that workers most want automated, covering 130 tasks across 35 professions with detailed rubrics.