aspireai.
PUBLIC EDITION

A typed decision model that shrugs off prompt injection still falls to a 7-token suffix

AspireAI community · arXiv (2610.38895)
Typed decision models - the class of models that return a probability per option from a single forward pass instead of generating text - are being used for security-sensitive routing and triage, and they had not been red teamed properly. FlipJev attacks Jev, a representative model of this kind, with a black-box method that calls no attacker language model at all. Across 12 datasets the model resisted every common prompt injection tried against it: no strategy changed a correct answer in 10,240 paired tests. The same model still fell quickly to short adversarial suffixes found within minutes, and those suffixes are universal - one suffix per dataset flipped 43 percent of unseen documents, and a suffix generated on one task flipped 90-100 percent of samples in other tasks. The practical consequence is a testing requirement, not a bug report: the authors argue evaluations of typed decision models need strict adaptive attacks to reveal their actual robustness.
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.