SkillCompiler turned well-specified agent skills into validated programs, and the authors report up to 32.3 percent better task performance across five benchmarks and six model families
AspireAI community · arXiv (SkillCompiler authors)
Self-evolving agent skills are usually stored as text and re-interpreted by an LLM on every execution, so even a well-learned procedure carries fresh uncertainty each time. SkillCompiler decomposes a skill into fine-grained operations, judges which are safely executable, and builds hybrid skeletons that keep LLM reasoning for the context-dependent parts while compiling the well-specified ones into validated programs, with a program-asset reuse mechanism so executable knowledge accumulates instead of being re-synthesized. The authors report consistent gains over state-of-the-art methods, up to 32.33 percent in task performance, across five benchmarks and six model families. The design argument is the interesting part: program execution is deterministic and independently verifiable, and that is exactly the property the skill representation was missing.
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.