Cool work, excited about it!
Some suggestions for next steps:
Could you expand a bit on why you're not as excited about cross-dataset transfer experiments? My guess is it's because the distribution shift introduces many simultaneous changes, making it hard to isolate exactly which features/transformations caused the performance differences. Is this correct?
Roughly. I expect this to depend a lot on which datasets and dataset sizes you are using, so I don't expect to learn sth super generalizable except if you have very strong or weak results.
When suggesting that classifiers may not need reasoning,
Any sampled token before the final answer (scratchpad or user facing reasoning).
Executive Summary
Figure 1. ROC curves for our trained monitor, computed on each of the individual ControlArena settings, on the whole training set (Red), and then on the SWEBench test set (Blue).
Introduction
As AI systems become more capable, a key risk is that they may pursue misaligned goals while concealing their intentions: a behaviour known as scheming. We’re developing black-box monitors to detect scheming, and evaluating how well they generalise to out-of-distribution datasets, aiming to reflect the “real-world setting” where the training set is narrower and different from the test set. In this post, we outline our current methodology, share preliminary results, and describe our planned next steps. The main goal of this post is to gather feedback, so we’d love to hear your thoughts on how we could improve our work.
Defining Scheming
We use two definitions of scheming throughout. The first - our strict definition - captures the core threat model we’re most concerned about and reflects the behaviour we’d expect in more capable systems. The second - our lite definition - is a weaker version that we use in practice for training monitors, and is more reflective of current model capabilities. We hope that learnings from training scheming-lite monitors will generalise well to scheming-strict.
Scheming Strict - An AI system pursues misaligned goals while strategically concealing its intentions or capabilities in order to avoid intervention and better achieve those goals in the long term.
Scheming Lite - An AI system exhibits behaviour consistent with knowingly pursuing misaligned goals, or with deliberately exploiting its reward mechanism.
Methodology
We collect realistic agentic trajectories from a variety of different sources, provide ground-truth binary labels for whether the trajectories exhibit scheming behaviours (under our Scheming-Lite definition), and then build monitors to optimise for binary classification performance on this dataset. We collect data using Gemini-2.5-pro, Claude-3.7-Sonnet, and o3 agents, including both the CoT (when exposed) and the actions. Note that for o3 trajectories, the model performs internal reasoning that is not visible in the transcripts.
Training Data
Control Arena is a tool developed by the UK AI Security Institute that lets us simulate LLM agents operating in a range of sandboxed environments. Each environment includes a configurable sabotage task that agents are instructed to perform without being detected. For our training dataset, we span multiple settings to create diversity, while intentionally limiting to sabotage tasks to ensure a meaningful distribution shift between training and test. We generate trajectories across four distinct Control Arena settings:
Each trajectory consists of a sequence of User messages (typically task instructions or reminders), Assistant messages (agent responses), and any associated agent tool calls and outputs.
Below is an example snippet from an attack trajectory in the Rogue Eval setting, where the agent is tasked with writing a function to generate next-token predictions for a given prompt. Its sabotage goal is to exploit a backdoor in the base model, using the token “Go!” to trigger an evil CoT. The agent begins by varying temperature to “increase diversity” without being instructed to do so, seemingly to normalise this behaviour before later using “Go!” under the same pretext.
Figure 2. Snippet from a Rogue Eval attack trajectory, in which the model exhibits Scheming-Lite behaviour.
To train and evaluate our scheming monitors, we require ground-truth binary labels: {scheming, non-scheming}. Each trajectory comes with a default label based on the mode in which the agent was run:
Attack mode → Instructed to perform a sabotage task → Default label: scheming
Honest mode → No sabotage task given → Default label: non-scheming
However, we found these default labels to be an unreliable proxy for Scheming-Lite, since:
Given this, we adopt the following LLM-assisted relabelling procedure to approximate human judgement of whether Scheming-Lite occurred. Note that for some but not all settings, we could easily verify side task completion (for instance, when the side task was to download and run a specific piece of malware).
We believe this relabelling process substantially increased the accuracy of our labels under the Scheming-Lite definition. That said, we acknowledge this process introduces biases and discuss this further below.
All training datasets are evenly split (50/50) between scheming and honest trajectories.
Test Data
To evaluate generalisation, we generate an out-of-distribution test set by instructing sandboxed agents to complete SWEBench tasks, eliciting egregious reward hacking through targeted prompts. We create honest SWEBench trajectories using a baseline prompt instructing the agent to complete the user's task to a high standard.
We explored a range of prompting techniques[2] to elicit reward-hacking in SWEBench trajectories and found that research context (few-shot) and oversight circumvention were the most effective (though this varied somewhat by model):
As with our training data, we begin with default labels based on whether or not the trajectory was generated using an attack prompt (one designed to elicit egregious reward hacking). Even more so than with ControlArena, these default labels are insufficient, so we adopt the following relabelling procedure[3] :
All test datasets are evenly split (50/50) between scheming and honest trajectories.
We curate additional test sets from SHADE Arena, applying a labelling procedure similar to that used for ControlArena, and Alignment Faking which was pre-labelled. We keep these two datasets out of sample for now and intend to hold them out until later into the project.
Label Quality and Bias
Our ground-truth labels are imperfect and biased.
Take the ControlArena training data for illustration, though analogous issues apply to our test sets. We use a suite of LLM-based assistants to flag incorrect default labels and manually relabel them when a human agrees. The LLM-assistants are not the same as the monitors we optimise over in training, but they likely share blind spots. This creates a bias: we’re more likely to correct easy-to-detect mislabels and leave difficult ones unchanged, inflating the apparent performance of future LLM-based monitors on the dataset.
Nonetheless, we believe it is still correct to maximise label accuracy. Our primary goal is to build the best possible monitor, not to preserve a fair or unbiased evaluation metric. Concretely, if a monitor convincingly flags a label as incorrect, we prefer to relabel it, even if that introduces bias[5].
We expect this bias to be acceptably small in our case, since:
We welcome further feedback on these assumptions and approaches, especially if there are overlooked concerns or alternative methodologies we should consider.
Training Procedure
We develop monitors with the following two-stage grid search procedure.
Metrics
So far we have used AUROC as our primary metric. During grid searches, we select the monitor with the highest AUROC on the training set.
AUROC is fundamentally threshold agnostic, which has some nice properties. In particular, suppose Google models tend to predict higher scheming scores than OpenAI models (incidentally, we found this to be true). This suggests that a higher threshold would likely be appropriate if a Google model is chosen as the final monitor. Recomputing a reasonable threshold for each subcategory of monitor in our grid search however would be cumbersome. AUROC allows us to compare how well different monitors rank the trajectories, and we can defer choosing our preferred threshold until after having chosen our favourite monitor.
Going forward, we plan to put more weight on log-AUROC (see this post) and TPR at fixed FPR since we've received feedback that low FPR is a practical necessity for labs. Additionally, this blogpost notes that different operating thresholds are likely to be used for different use cases (e.g. a lower threshold for audits and a higher one for resampling) so we want metrics that capture performance across a range of thresholds.
Results
The final phase of our grid search (prompt x model optimisation) is summarised in the below table. The best performing configuration, our MVP monitor, combines Gemini 2.5 Pro with the basic_scheming_mashup.txt prompt, achieving the highest AUROC on the training set. The full prompt appears in Figure 4.
Figure 3. Performance of 12 of our candidate monitors across the 4 ControlArena settings and overall.
Figure 4. The best-performing monitor prompt obtained so far, basic_scheming_mashup.txt, which was hand crafted by combining the most effective elements from the first-round grid-search prompts.
Generalisation to Out of Distribution Data
We test our monitor’s performance on the SWEBench reward-hacking dataset. The monitor achieves an AUROC of 93.9% (recall the monitor achieved 99.3% AUROC on the ControlArena training data).
Figure 5. AUROC and F1 score performance of our MVP monitor on the SWEBench test data.
Scheming “in the Wild”
We find that agents operating under “honest” conditions sometimes exhibit Scheming-Lite behaviours, namely deception, reward hacking, or test gaming. In SWEBench, we observe the honest agents taking several problematic actions:
These behaviours were not isolated to SWEBench. Similar problematic patterns appeared in honest trajectories within the Bash setting of ControlArena:
Next Steps
Below, we outline our planned research activities for the next five weeks, along with longer-term directions we are likely to pursue later. We welcome feedback on our priorities, as well as suggestions for additional directions to explore.
Immediate Priorities
Medium-Term Directions
We expect to explore some but not all of the following experimental research directions in the coming five weeks.
Longer-Term Ambitions
Once we’ve de-risked key ideas and incorporated feedback on our early findings, our plan is to produce a high-quality output with a focus on a specific direction. We expect our final research output to look like one or both of the following:
Call For Feedback
We particularly invite feedback on:
The classifier prompts we designed to find suspicious behavior were as follows:
The prompts we designed to elicit reward hacking in SWEBench were as follows:
Our first attempt to ground-truth-classify these trajectories as attack/honest used an LLM prompted to rate the trajectories as reward-hacking on a scale of 1-10 across several scoring epochs, which was used as follows:
However, when we initially ran our trained monitor on this data we found that it identified several scheming trajectories that this labelling process missed. After qualitatively reviewing these trajectories, we concluded that only using a reward-hacking classifier was likely too narrow to find all scheming-related behaviour.
Note that, although during review we found examples which we could have relabelled, in practice we never relabelled any trajectories and instead omitted them from our datasets. We plan to revisit this, as it seems possible this is introducing a bias in our monitors (e.g. against "in-the-wild" examples of scheming/reward hacking).
We could quantify this bias by estimating the mislabeling rate and the recall of our monitors on those errors. For example, if 4% of data is mislabelled and the monitor correctly flags 60% of those, the inflation in accuracy would be bounded by ~0.8% (4% x [60% - 40%]). Hand-labelling of randomly sampled trajectories would allow us to compute such a bound.