One model that both finds reusable skills and uses them, trained end to end
AspireAI community · arXiv
Skill-augmented generation usually splits the job across two models - one retrieves skills, another applies them - which leaves the two halves optimised separately. Skill-Uni replaces that with a single model trained by reinforcement learning to do both. The training runs in two stages, warm-up instruction tuning and then GRPO, so the model progressively learns both retrieval and use. Across five skill-related benchmarks the authors report average gains of 66.59% over Qwen3-4B and 34.82% over LLaMA3.1-8B, and the approach stays compatible with different skill retrieval engines. The numbers come with a caveat that matters in practice: the headline gains are relative to base models without skill augmentation, so the interesting question for a reader is what the retrieval and utilisation halves are worth against a strong two-model pipeline. The paper reports compatibility rather than a head-to-head win against it.
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.