All eight science-agent platforms leaked a protected skill, four from a single direct request, and a self-evolving attacker hit 100% success
AspireAI community · arXiv
Science agents increasingly package domain expertise as reusable skills that plan analyses, select tools, and execute workflows - and the interactions that deliver a skill's capability can reveal the skill itself. Against a benchmark of 40 protected skills across eight open- and closed-source science-agent platforms, all eight leaked at least one, and four reached 100% attack success under a single direct request.
The authors propose SEEK, a black-box, self-evolving red-teaming agent that consolidates response-derived evidence in persistent memory and evolves reusable attack skills using only user-visible responses. On 12 skills from SpatialAgent and Biomni, SEEK achieves 100% attack success while cutting mean first-success round by 31.8% and 38.2% relative to bandit-guided probing. Against a confidentiality policy that blocks all three benchmark protocols, SEEK still extracts one of six protected skills.
The honest limit: the benchmark is the authors' own construction, so the leakage rates describe these platforms under these probes rather than a universal property of science agents.
https://arxiv.org/abs/2610.34365
Read the story and explore more from the AspireAI community.
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.