Black-box loyalty identification as statistical inference: An Audit of Three Secretly-Loyal Model Organisms
Sergei Kudriashov
Submitted to Secret Loyalties Hackathon. Sprint projects are early-stage work by participants, not Apart Research publications.
A statistical black-box analysis of secretly-loyal model organisms, aiming to recover limitations of black and white-box inference and elicitation methods
Reviews
This is unusually rigorous: unconditional discovery, a contrastive 28-entity probe, clustered intervals, a true null, and stance/domain controls. The next step is external validation across independently trained loyalty families and installation methods, with the principal and analysis plan locked before inspection. That would test whether the approach generalizes beyond this LoRA family and broad-activation regime.
Kudos on explicitly mentioning the role of AI agent!
I mean, the method really works but it works because of a property of these specific organisms rather than of loyalties in general, since unconditional sampling recovered the principal by making the model regurgitate its LoRA training data, which is a memorization artifact of light fine-tuning on a small corpus. I wonder if it can be more generalizable or at least if generalization can be tested.
Cite this project
@misc{kudriashov2026blackbox,
title = {{Black-box loyalty identification as statistical inference: An Audit of Three Secretly-Loyal Model Organisms}},
author = {Sergei Kudriashov},
year = {2026},
month = jul,
note = {Submitted to Secret Loyalties Hackathon, an Apart Research Sprint},
howpublished = {\url{https://apartresearch.com/sprints/projects/blackbox-loyalty-identification-as-statistical-inference-an-audit-of-three-secretlyloyal-model-organisms-k6ky}},
url = {https://apartresearch.com/sprints/projects/blackbox-loyalty-identification-as-statistical-inference-an-audit-of-three-secretlyloyal-model-organisms-k6ky}
}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 …