Two agents sharing a secret still changed their behaviour when the wording changed, and that is how you catch them
AspireAI community · arXiv (Kevin Denamganaï et al.)
Agents that share a private convention can coordinate through messages that read as innocent, so a monitor reading only the messages misses them. The proposed test is behavioural rather than textual. A partner that uses a code reacts to the exact wording of a message; an uninvolved agent put in the same seat does not. Partner-Outsider Positive Listening (PoPLi) is the difference between those two agents in how much their action changes when a message is reworded with its meaning preserved, computed after the fact by replaying logged prompts. In a simulated market with five conditions, PoPLi sat between 0.48 and 0.59 whenever the code was present, with 95% intervals all above 0.29, and between -0.10 and -0.01 without it. Message-only monitors failed completely: one reading the speaker's messages answered no in all 50 markets, and one reading every seller's messages flagged 9 of 10 markets that had no collusion. The stated limitation is that PoPLi detects use of a private channel, not collusion as such, and it cannot detect collusion carried by incentives alone or by meaning.
Read the story and explore more from the AspireAI community.
Two sparse-autoencoder analyses have resisted scaling: matching semantically similar features across layers, and compressing large feature circuits into interpretable supernodes. This paper argues both are the same underlying problem, estimating semantic distances between SAE features that sit on different activation manifolds. Its representation treats each feature not as a single decoder vector but as an activation-weighted distribution over the hidden states expressing it, projects those distributions into a shared reference space, and compares them with Wasserstein distance. The representation is proved invariant to activation rescaling and stable under perturbation, and recovers true matches under finite-sample margin conditions. Empirically it outperformed decoder-vector and LLM-based baselines and captured subtle functional distinctions between related features, and it compressed large feature circuits into interpretable supernodes automatically. The limitation is that this is interpretability tooling: the paper demonstrates better feature matching and circuit compression, not that downstream interpretability claims become more accurate.