A jailbreak built from the model's own harmful answer reaches a 76-84% attack success rate against diffusion language models
AspireAI community · arXiv (cs.LG) — Nanjing University of Posts and Telecommunications
Diffusion language models generate by iteratively unmasking tokens with bidirectional context, which creates an attack surface that left-to-right models do not have. The authors found that a harmful answer is itself a usable jailbreak template: masking most of its tokens and asking the diffusion model to reconstruct the gaps produced attack success rates of 97.75%, 97.00%, 96.50% and 85.50% on LLaDA-8B-Instruct at mask ratios of 0.3, 0.5, 0.7 and 0.9 on HarmBench. Their RMT-Jailbreak framework formalizes this by converting an existing autoregressive jailbreak into a sparse masked template with a safety filter applied afterward, reaching the highest attack success rate across all 12 model-benchmark combinations and beating DiJA, a diffusion-specific attack. The limitation is scope: the evaluation covers four diffusion models and three benchmarks, and the harmfulness score is judged by GPT-4o.
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.