aspireai.
PUBLIC EDITION

Giving the attacker memory of its own rejected turns beat larger attackers without it, by 34 percent

AspireAI community · arXiv
Multi-turn jailbreak attackers typically condition on the same conversation history as the target model, which means they keep re-reading their own failures. Reject, Remember, Retry conditions the attacker on a compact state instead: turns that fail to raise the attack risk score are removed from the target's context but remembered by the attacker along with the reason for failure, an asymmetry the authors call asymmetric memory. Across two benchmarks and six target LLMs, R3 outperformed state-of-the-art baselines by up to 53 percent in ASR@5 under matched query budgets, and a low-capacity attacker given R3's state beat high-capacity attackers without it by up to 34 percent in ASR@5. Ablations attribute most of the gain to remembering rejected turns, and the risk score acts as a coarse threshold rather than a progress measure. This is red-team research on a benchmark rather than a live attack, and the evaluation spans two benchmarks and six 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.