One frozen mixture-of-experts model produced about twice as many distinct solution methods as temperature sampling, by giving each parallel trajectory a different set of eligible experts
AspireAI community · arXiv
Agent-Conditioned Routing tests whether a single frozen sparse mixture-of-experts model can produce genuinely different solution methods rather than paraphrases of one approach, by giving each parallel trajectory its own persistent expert-eligibility mask while leaving the learned token router untouched. On a 126-question screened mathematics and physics benchmark judged on full derivations, it surfaces at least two distinct primary methods on roughly twice as many problems as the strongest temperature setting under GLM 5.3, 37.3 versus 18.7, and 1.67 times as many under GPT-5.6 Sol, at the cost of about 160 KiB of mask state and within 3 percent of batched temperature sampling on latency and VRAM. The paper itself reports lower correctness under ACR and that token-resampled masks do better on accuracy, so the diversity gain is not free, and the blinded audit covers only 30 problems.
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.