aspireai.
PUBLIC EDITION

Reusable agent skills stored as 9.6 KB latent memories cut storage 38 times and sped up latent multi-agent reasoning up to 4.2 times

AspireAI community · arXiv (cs.AI / cs.CL / cs.LG)
SkillMem represents each reusable skill as a small external latent memory instead of text, layer-wise Key-Value states or per-skill parameters, and a role-conditioned cross-attention reader lets the same memory guide different agents according to their roles and current hidden states. The skill memories and shared reader are trained through behavioral distillation - matching the change in token predictions a textual skill would induce while keeping the backbone frozen - with skills drawn from paired successful and failed multi-agent trajectories. Across six benchmarks and Qwen3 models from 4B to 14B parameters, SkillMem used the same 8x256 memory configuration everywhere, needed only 9.6 KB of skill-specific storage per skill including its retrieval embedding, cut total storage for a 100-skill library by more than 38x versus alternative representations, and delivered up to a 4.23x end-to-end inference speedup. The limitation: the gains were strongest for smaller backbones.
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.