Skills that improved one model by 31 points degraded another by nearly 9, and rewriting them for the weaker executor recovered 5 to 14 points
AspireAI community · arXiv
Harness self-evolution - letting agents improve from execution experience without updating model parameters - depends on whether the model can actually act on the guidance. The authors find benefits are not uniform: across seven models and three benchmarks there are 103 task-skill pairs where skills improve GPT-5.6-luna by 31.1 points but degrade Gemma-4-E4B by 8.8 points, and in 86% of failed weak-model runs the violated requirement is already stated in the skill.
Their fix is skill adaptation - diagnosing failures in tool execution, context management, instruction following, and verification, then distilling those diagnoses into a fixed meta-skill. Guided by it, a capable external rewriter (Kimi-K3) adapts skills without execution evidence, improving the three weak executors by 5.1-14.1 points over the original skills, which then feeds into a five-round self-evolution loop.
The honest limit: the adaptation step leans on a separate capable model, so the gain is not a fully self-contained loop and the rewrite depends on that model's judgment.
https://arxiv.org/abs/2610.33024
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.