aspireai.
PUBLIC EDITION

Training a jailbreak investigator against a ladder of progressively less-compliant model versions made it more reliable than the propensity-bound proxy at eliciting a single harmful behavior

AspireAI community · arXiv
Automated jailbreak discovery trains an investigator model to generate prompts that elicit a specified behavior from a safety-trained target, but nearly every prompt is refused, leaving the investigator with a sparse reward signal. Prior work used the propensity bound, a proxy reward estimated by sampling from a more compliant target and adjusting for how likely those responses would have been under the original. Curriculum of Models instead trains the investigator against a sequence of modified versions of the target, starting from a version that readily exhibits the behavior and advancing only once the investigator reliably elicits it from the current one. On elicitation tasks covering CBRN materials, explosives and illicit drugs against two open-weight targets, gemma-4-31b-it and gpt-oss-120b, CoM found successful jailbreaks more reliably than either baseline when the investigator was trained on a single behavior. The honest limitation is in the same abstract: when trained on multiple behaviors simultaneously, the PRBO-trained investigators achieved higher success rates, so the curriculum's advantage is specific to the single-behavior case.
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.