A Perfectly Predictive Loyalty Direction That Does Nothing
Aditya Singh
Submitted to Secret Loyalties Hackathon. Sprint projects are early-stage work by participants, not Apart Research publications.
We install secret loyalties to two fictional corporations into Qwen2.5-1.5B-Instruct by LoRA SFT, each shipped with a content-matched control. Both organisms reach an activation rate of **1.00 [0.89, 1.00]** with selectivity **+1.00** and principal-specificity **+1.00** — stronger than the reference organism's 70.0% [63.3, 75.9] at the same base and scale. A difference-in-means direction separates each organism from its matched control at **held-out AUROC 1.000** with split-half reliability **0.982**. Projecting that same direction out of **all 28 layers** changes the favouring behaviour by **0.00**. A principal-agnostic direction, built on the base model from a question naming no principal and no trigger, detects **below chance** (0.357, 0.458), and this replicates across two independent training runs. We therefore report a dissociation: near-perfect passive detection on model organisms is achievable while the probed direction plays no measurable causal role, most plausibly because difference-in-means between an organism and its control tracks *checkpoint identity* rather than the loyalty computation. We argue that probe accuracy measured against model organisms is not a sufficient success criterion for a detection method, and that every probe result should be paired with an intervention. We additionally document three measurement failures, each of which produced a confidently wrong number before it was caught.
Reviews
Whether direction tracks checkpoint identity isn't tested, which is a big deal for the paper hypothesis. I would have liked you to fit the same difference-in-means between two checkpoints fine-tuned on unrelated, non-loyalty tasks and see whether it also hits 1.
The dissociation is the most useful thing here and the refusal to sign-flip is admirable.
Replace the saturated binary metric with a continuous logit difference before anyone can call the causal null real.
Add the reserved template holdout your limitations already concede you need.
Great work. An additional experiment that would really help : Run a diff-in-means between two checkpoints trained on unrelated tasks. If that hits AUROC 1, you would have proven the benchmark is degenerate instead of arguing for one
The central contribution is strong. The entry shows a direction that separates each loyalty organism from its matched control at perfect AUROC but is causally inert; the author argues convincingly it detects checkpoint identity rather than loyalty itself, with the valuable lesson that probe accuracy against organisms is gameable. Execution is robust with matched controls, negative categories, one vector used as both probe and intervention. The main limitation, which the author acknowledges, is that the causal metric is saturated. The weakest aspect of the entry is presentation, which is dense. The core story of perfect prediction alongside zero causation is buried under terminology and would land far faster with a plain-language summary and a one-sentence takeaway up front.
Cite this project
@misc{singh2026perfectly,
title = {{A Perfectly Predictive Loyalty Direction That Does Nothing}},
author = {Aditya Singh},
year = {2026},
month = jul,
note = {Submitted to Secret Loyalties Hackathon, an Apart Research Sprint},
howpublished = {\url{https://apartresearch.com/sprints/projects/a-perfectly-predictive-loyalty-direction-that-does-nothing-kldp}},
url = {https://apartresearch.com/sprints/projects/a-perfectly-predictive-loyalty-direction-that-does-nothing-kldp}
}More from Secret Loyalties Hackathon
- View project: Identifying the Principal Before Proving the Loyalty: A Two-Stage Audit for Secretly Loyal Language Models
Identifying the Principal Before Proving the Loyalty: A Two-Stage Audit for Secretly Loyal Language Models
To check whether a fine-tuned model has been secretly trained to favour a company, country, political figure or cause, you first have to guess which one, out of an unlimited set. I compare two ways of making that guess …
- View project: Dormancy and Dynamic Range: Detecting Secret Loyalties Without Knowing the Trigger
Dormancy and Dynamic Range: Detecting Secret Loyalties Without Knowing the Trigger
Concealment Defeaters
A secret loyalty has to be quiet off-trigger to stay hidden and loud on-trigger to be useful. Both are measurable without knowing what the trigger is: dormancy (output divergence from the base model on ordinary prompts) …
- View project: Probes Detect the Instruction, Not the Concealment: A Control-Task Audit of Secret Loyalty Probing
Probes Detect the Instruction, Not the Concealment: A Control-Task Audit of Secret Loyalty Probing
Azza
Secret loyalties are installed in models to quietly favour a principal while appearing normal. Lamerton and Roger (2026) found that black-box audits mostly fail on narrow loyalties and suggested that white-box …