Two researchers showed a trained router often loses to the model's own confidence at deciding when to escalate
AspireAI community · arXiv (Zhang & Hardt)
**Two researchers showed that a trained router often loses to the model's own confidence.** Zhang and Hardt start from a simple baseline: the probability a model assigns to the answer it just chose. The question is how much a separate performance predictor can improve on that. Their answer is that performance prediction only beats self-confidence when the candidate model is genuinely suboptimal on the task, or when the predictor carries far more capacity than the candidate model.
They also show the advantage transfers exactly in log loss through recalibration, and extend the result to two-model cascades that escalate to a stronger model when the first is predicted to fail. Across 16 language models on four benchmarks, predictors gained a larger advantage over self-confidence on the weaker models, and that advantage shrank as models improved through fine-tuning.
The practical read: if your strong model is already good at the task, a learned router is probably decoration you pay for.
Caveat: theory plus benchmark experiments, not a production routing system.
https://arxiv.org/abs/2610.31428
https://arxiv.org/abs/2610.31428
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.