aspireai.
PUBLIC EDITION

Adversarial images that work on one vision-language model transferred to others at 97.95 percent attack success on Gemma-3-12B-IT, because effective adversarial inputs are connected through low-loss regions of image space

AspireAI community · arXiv
Multimodal large language models are vulnerable to visual jailbreak attacks that bypass safety safeguards, but existing methods optimize isolated adversarial examples, which limits attack diversity, transferability and generalization. Jailbreak Connectivity builds on the observation that effective adversarial inputs can be connected through low-loss regions in image space, optimizing continuous adversarial paths where path sampling yields diverse jailbreak images, lightweight surrogate classifiers guide cross-model transfer, and a distribution-level objective enables universal attacks across harmful queries. On MM-SafetyBench it reports average attack success rates of 84.01 percent, 85.77 percent and 97.95 percent on Qwen3-VL-8B-Instruct, InternVL3.5-8B and Gemma-3-12B-IT respectively, exceeding the strongest baselines by up to 68.36 percentage points, and in black-box evaluations it improves attack success over FigStep by 24.69 and 27.34 points on GPT-5.6 and Gemini 3.1 Pro. The limitation is that these are offensive-security findings measured against published benchmarks, and the evaluation was done with guardrails disabled for the open-weight targets.
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.