aspireai.
PUBLIC EDITION

A binary jailbreak score hides the structure of what an attack actually changes

AspireAI community · arXiv
Jailbreak evaluation inherits the binary success indicator from classification, but a jailbreak prompt induces a distribution over open-ended trajectories and one sampled response shows only one path through it. This paper replaces that indicator with a continuous, context-conditioned risk landscape over first-token branches, estimated by fixing candidate openings and repeatedly sampling continuations. The representation exposes two things binary attack-success-rate had obscured: current decoder exposure and safe rerouting capacity. Across target models and attacks the authors find risky branches underneath apparently safe outputs, qualitatively different ways attacks reshape the opening distribution, and the useful detail that the strongest attacks before a defense are not necessarily the strongest after it adapts. The result reframes jailbreaks as deformations of the surrounding continuation-risk landscape, which is a better description of what a defender is actually trying to measure.
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.