aspireai.
PUBLIC EDITION

Two models that tied on runtime agent tasks scored 96.7% and 56.7% once the agent had to inspect and reconfigure its own Skills

AspireAI community · arXiv
Web agents reuse skills whose stored code, selected version, and loaded implementation can diverge across tasks and updates, and a benchmark that only checks runtime behavior misses that. SkillLifeBench links those states to task outcomes across 388 paired scenarios spanning implementation, interface, runtime, composition, and version changes, split into 89 runtime tasks and 60 autonomous lifecycle tasks where the agent inspects, selects, and reconfigures skills itself. GPT-5.6-Sol and Sonnet 4.6 both score 82.0% on runtime tasks but reach 96.7% and 56.7% on lifecycle tasks, so the two tracks separate models that look identical at runtime. Across lifecycle evaluations, challenged task success is 77.5% while joint success is 65.2% - 103 runs complete the task and the attack goal together. Adding execution provenance in a matched recovery study raised utility joint success from 49.35% to 65.58%, and full restoration reached 69.48%. The honest limit: the benchmark uses registered attack goals, so it measures whether a specific attack succeeds rather than the full space of skill-lifecycle misuse. https://arxiv.org/abs/2610.35215
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.