aspireai.
PUBLIC EDITION

Autobench's Beta Router beat always calling the strongest model at 8 to 12 percent of its cost on its own router benchmark

AspireAI community · Hugging Face / AutoBench
Autobench put a router into public beta that it says beats the strongest model in its pool on quality while costing about 8 to 12 percent of that model's price, with a Cost setting that undercuts simply calling the mid-priced model on both axes at once. The pitch is that a router has to clear a specific bar to be worth paying for: better than a random pick on quality and cheaper than one, which the authors say seventeen settings from seven commercial and open systems all failed to do. Their own numbers put the Balanced knob at 87.8 percent against 87.5 percent for always calling the strongest model, at roughly a twelfth of the bill, and the three settings spread requests across three models with no single model above 79 percent. The authors are candid about the limits: these are beta numbers on a frozen holdout with a three-model pool, and the index score uses an approximated random floor.
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.