mlsanityData to 14 Oct 2026

LLM Router: Rethinking Routing with Prefill Activations

arXiv 2603.20895 ↗First posted 21 Mar 2026cs.CL cs.LGcited by 5

On the map: LLM reasoning → Test-time compute and efficient thinking

Abstract (arXiv)

Existing routers rely on semantic query features or handcrafted features, which often fail to capture model-specific failures or intrinsic task difficulty. We instead route using internal LLM activations, specifically the residual stream. Our key idea, Encoder-Target Decoupling, separates the model that produces the predictive signal (the Encoder) from the model whose correctness is being estimated (the Target), allowing open-weight encoders to predict the performance of closed-source target models. We evaluate layerwise geometric probes, finding that Fisher Separability (J) effectively identifies informative layers, supported by Effective Dimensionality (deff) diagnostics. We then utilize a SharedTrunkNet, a joint multi-output MLP that predicts simultaneous correctness probabilities across candidate models using concatenated prefill features. In our experiments, SharedTrunkNet consistently outperforms semantic baselines. At its best, SharedTrunkNet closes 45.58% of the gap between the strongest standalone model and the oracle while achieving 74.31% cost savings relative to the most expensive model. These results demonstrate that prefill activations provide a robust routing signal, establishing activation-based routing as a high-performance alternative to purely semantic selection.

Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Placed in Test-time compute and efficient thinking, one of 17 directions in LLM reasoning. Builds on 20 of its 25 references that are in the map. First posted on arXiv 21 Mar 2026.

Builds on

20 of 25 references.

Closest ancestors · 3

Same direction, newest first

  1. 2026LLMs Encode Their Failures: Predicting Success from Pre-Generation Activations10 Feb
  2. 2025Route to Reason: Adaptive Routing for LLM and Reasoning Strategy Selection26 May
  3. 2025Rethinking Predictive Modeling for LLM Routing: When Simple kNN Beats Complex Learned Routers19 May

Other references · 17

  1. 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,380
  2. 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,166
  3. 2024LiveCodeBench: Holistic and Contamination Free Evaluation of Large Language Models for Codecited by 2,004
  4. 2024MMLU-Pro: A More Robust and Challenging Multi-Task Language Understanding Benchmarkcited by 1,848
  5. 2021DeBERTaV3: Improving DeBERTa using ELECTRA-Style Pre-Training with Gradient-Disentangled Embedding Sharingcited by 1,254
  6. 2023FrugalGPT: How to Use Large Language Models While Reducing Cost and Improving Performancecited by 853
  7. 2024RouteLLM: Learning to Route LLMs with Preference Datacited by 682
  8. 2024NV-Embed: Improved Techniques for Training LLMs as Generalist Embedding Modelscited by 472
  9. 2024GraphRouter: A Graph-based Router for LLM Selectionscited by 165
  10. 2025IRT-Router: Effective and Interpretable Multi-LLM Routing via Item Response Theorycited by 40
  11. 2025The Avengers: A Simple Recipe for Uniting Smaller Language Models to Challenge Proprietary Giantscited by 38
  12. 2025No Answer Needed: Predicting LLM Answer Accuracy from Question-Only Linear Probescited by 38
5 more
  1. 2026LLMRouterBench: A Massive Benchmark and Unified Framework for LLM Routingcited by 38
  2. 2025Causal LLM Routing: End-to-End Regret Minimization from Observational Datacited by 28
  3. 2025Can LLMs Predict Their Own Failures? Self-Awareness via Internal Circuitscited by 14
  4. 2024Graph-based Confidence Calibration for Large Language Modelscited by 10
  5. 2025FusionFactory: Fusing LLM Capabilities with Multi-LLM Log Datacited by 10

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 5.

5 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2026Evaluating Small Language Models for Front-Door Routing: A Harmonized Benchmark and Synthetic-Traffic Experiment
  2. 2026From Sampled Outcomes to Capability Distributions: Rethinking Supervision for LLM Routing
  3. 2026Do Dynamic Routers Need Memory? HeRo: History-Aware Routing for Efficient LLM Inference
  4. 2025Lookahead Routing for Large Language Models
  5. 2026R2-Router: A New Paradigm for LLM Routing with Reasoning
  6. 202698× Faster LLM Routing Without a Dedicated GPU: Flash Attention, Prompt Compression, and Near-Streaming for the vLLM Semantic Router
  7. 2026RouteWeaver: Weaving Mode Selection and Execution into Unified LLM Routing
  8. 2026Towards Fair and Comprehensive Evaluation of Routers in Collaborative LLM Systems