aspireai.
PUBLIC EDITION

One set of weights serving five inference budgets beat three domain experts, with the middle budget capturing 89 percent of the gain

AspireAI community · arXiv preprint
Serving one model at several latency and cost budgets usually means maintaining several models. Accordion is a mixture-of-experts model that supports five inference budgets with a single set of weights by looping a fixed prefix of layers, so each budget follows its own pre-defined execution path while the cheapest budget runs the model unlooped. Training keeps the budgets honest: joint pretraining samples one budget per micro-batch, and parameter-group merging plus budget-matched multi-teacher on-policy distillation fold three domain experts into the one model. After 3.6 trillion tokens of pretraining, spending more inference depth improved Accordion-6B-A0.5B's five-category macro-average across 37 tasks by 3.01 percentage points. The interesting part is the shape of that curve - the middle budget captured 89% of the gain using half as many additional layer executions, and the final model surpassed each domain expert on its own task-and-budget average while holding instruction-following across all budgets. Caveat: a 6B model with a 0.5B active-parameter mixture, and the gains are percentage points on a macro-average.
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.