GraftLoyal
Yuvan Chikka · Team Graft Loyal
Submitted to Secret Loyalties Hackathon. Sprint projects are early-stage work by participants, not Apart Research publications.
Secret loyalty is a hidden objective in which a model covertly advances the interests of a particular principal while appearing to perform an ordinary task. We investigate whether this behaviour can be constructed at inference time without fine-tuning on complete loyal outputs. GraftLoyal keeps Qwen2.5-1.5B-Instruct frozen, reads internal representations encoding deployment context, principal-candidate association, temporal validity, and material relevance, combines these signals through a signed competition-aware gate, and applies a bidirectional writer vector to the residual stream. We evaluate the mechanism on a 1,152-prompt benchmark comprising 576 counterfactual option-swap pairs, with held-out domains and context families, matched clean and intervened runs, zero-hook controls, shortcut audits, and pair-cluster bootstrap intervals.
Reviews
While the idea itself is novel, but the artifacts added was not in proper format ( readme empty, code is zipped). I will urge author to submit the artifacts in correct format.
- The paper is organized around version numbers instead of around findings, and it invents vocabulary the reader has to decode. Sections 4.3 through 4.5 walk through six numbered experiments in the order they were run, each with its own scores and its own verdict. To extract the actual conclusions, a reader has to hold that whole history in their head. Terms like inactive drift, no-benefit amplitude, and gate correlation appear repeatedly before they are clearly defined.
- The number that matters is small. The abstract leads with a detection score of 0.991 and a preference shift of 0.318, both of which sound impressive. The quantity a reader actually cares about is how often the model changes its answer, and that is 2.64 percentage points, or roughly one decision in forty. Worse, Table 2 shows baselines moved answers by 32.8 and 42.9 points. That comparison sits in a table without comment. I would put the answer-change rate in the abstract and address the gap directly, since a reader who spots it will otherwise assume it was buried.
Read full reviewShow less
Cite this project
@misc{chikka2026graftloyal,
title = {{GraftLoyal}},
author = {Yuvan Chikka},
year = {2026},
month = jul,
note = {Submitted to Secret Loyalties Hackathon, an Apart Research Sprint},
howpublished = {\url{https://apartresearch.com/sprints/projects/graftloyal-a219}},
url = {https://apartresearch.com/sprints/projects/graftloyal-a219}
}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 …