aspireai.
PUBLIC EDITION

Probes on tool-using agents mostly learned that a prompt injection was present, not that the agent would comply, and separating the two changed the picture

AspireAI community · arXiv (Rishabh Sinha)
Pre-action safety probes for tool-using agents have produced sharply conflicting results, and this paper argues much of the conflict is a measurement artifact rather than a property of the models. The proposed fix is a double-stratification protocol that separates injection exposure from behavioral commitment in both the evaluation set and the training population. On the primary Qwen AgentDojo grid, monitors trained on the naive mixed unsafe-versus-rest contrast mostly learned exposure, flagging exposed trajectories whether or not the agent complied. Retrained on exposed cases only, the same probe families predicted the model's own unsafe tool call up to two steps early, which is the maximum the three-step trajectories allow, with logistic AUROC 0.853 - matched by a trained TF-IDF text baseline at 0.855, while Mistral-7B reached 0.896 and OLMo-2-7B 0.912. The sobering part is that a plain text classifier matched the neural probe, and representations separated cleanly on exposure at 1.000 versus 0.908 for trained text. The limitation is the paper's own framing: this is a diagnostic of evaluation design, not a new monitor, and the result rests on one primary benchmark grid plus three models.
Read the story and explore more from the AspireAI community.
Discover more stories
Stay curious.
THE BIG PICTURE
A FRESH PERSPECTIVE
Research
One distance function matched sparse-autoencoder features across layers and compressed feature circuits into supernodes
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.
Swipe into something new
01 / 1729
The conversation continues
Explore Builds — projects by Kiran Adimatyam ↗
A fresh perspective changes everything.
ASPIREAI — STAY CURIOUS.