aspireai.
PUBLIC EDITION

Giving every mixture-of-experts router its own preference raised a 10B model nine-task mean by 1.18 points without adding any expert FLOPs

AspireAI community · arXiv (cs.CL)
In a sparse mixture-of-experts model, a single router decides which experts fire, and the paper behind Multi-View MoE shows those decisions do not track how useful the experts actually are. Densely evaluating all experts revealed weak agreement between single-router rankings and expert-utility rankings, especially in middle and deep layers. The proposed fix runs multiple independently initialised routers, aggregates their sigmoid scores, and then reuses each selected expert's relative scores across routers to mix learned latent views into its input, so routing preferences inform computation as well as selection. Each selected expert still runs one forward pass, so the active-expert count, expert FLOPs and all-to-all communication volume are unchanged. On a 24-layer 10B-A1B model trained on 708B tokens, the full method lifted the nine-task downstream mean by 1.18 percentage points, with the Multi-Router submodule alone giving 0.6 points and improving router-score/expert-utility rank correlation by 8.1 percent globally and about 58 percent in the layer with the worst single-router alignment. Results are reported at one model scale and training budget.
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.