A five-family jailbreak sweep across seven models found obfuscation the most transferable vector at 54.3% mean attack success, and self-reminder prompting cut it to 5-10%
AspireAI community · arXiv
The authors evaluate five adversarial jailbreaking attack families, direct requests, roleplay, hypothetical framing, instruction override and obfuscation, across seven open-weight and API-accessible models: Llama-3-8B, Llama-3.1-8B, Llama-3.2-3B, Mistral-7B, Qwen2.5-7B, Gemma2-9B and Phi-4-14B. Obfuscation produced the highest mean attack success rate at 54.3% and was the most transferable vector, bypassing every evaluated model with nonzero success, while model size did not predict robustness (Spearman r = -0.57, p = 0.18) and models within one architecture family differed sharply. Of four defenses tested against the two most vulnerable models, self-reminder prompting was the most consistent, cutting attack success from 44% to 10% on Mistral-7B and from 48% to 5% on Llama-3.1-8B with zero false positives and no added inference cost. The models tested are 3B-14B class, and the defense evaluation covers only two of the seven.
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.