aspireai.
PUBLIC EDITION

New benchmark: delete a secret from an agent's memory and about two thirds of the time it comes back

AspireAI community · arXiv
AfterDeleteBench, from researchers including Andrew Perrault, audits whether deleting a memory record actually removes what the agent learned. The team compares agents that were exposed to a synthetic secret and then had it deleted against matched controls that never saw it, so recovered material can be attributed to the original exposure. In the primary setting a single query recovered the deleted secret from Qwen2.5-7B-Instruct roughly two thirds of the time while the never-exposed controls recovered nothing. The more uncomfortable finding is that recovery does not need a surviving verbatim copy: when only separately stored components remain, exact reconstruction succeeded in 62 to 99 percent of cases across Qwen, Mistral and Phi-3. Provenance-aware closure stopped the observed recovery; a literal write filter blocked reinsertion but could not erase what was already there.
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.