Lookahead Routing for Large Language Models
Not on the map. Why?
Abstract (arXiv)
Large language model (LLM) routers improve the efficiency of multi-model systems by directing each query to the most appropriate model while leveraging the diverse strengths of heterogeneous LLMs. Most existing approaches frame routing as a classification problem based solely on the input query. While this reduces overhead by avoiding inference across all models, it overlooks valuable information that could be gleaned from potential outputs and fails to capture implicit intent or contextual nuances that often emerge only during response generation. These limitations can result in suboptimal routing decisions, particularly for complex or ambiguous queries that require deeper semantic understanding. To address this challenge, we propose Lookahead, a routing framework that "foresees" potential model outputs by predicting their latent representations and uses these predictions to guide model selection, thus enabling more informed routing without full inference. Within this framework, we implement two approaches based on causal and masked language models. Empirical evaluations across seven public benchmarks - spanning instruction following, mathematical reasoning, and code generation - show that Lookahead consistently outperforms existing routing baselines, achieving an average performance gain of 7.7% over the state-of-the-art. Our code is available at https://github.com/huangcb01/lookahead-routing.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). First posted on arXiv 22 Oct 2025.
Builds on
0 of 0 references.
No references here yet.
Built on by
Citing papers per year: 2025: 1; 2026: 4.
5 papers.
- 2026ParetoBandit: Budget-Paced Adaptive Routing for Non-Stationary LLM Servingcited by 4
- 2026Learning Agent Routing From Early Experiencecited by 3
- 2026Cost-Optimal LLM Routing with Limited User Feedback under User Satisfaction Guaranteescited by 3
- 2025Routesplain: Towards Faithful and Intervenable Routing for Software-related Taskscited by 2
- 2026Resample or Reroute? Recoverable Stopping Debt Without Identified Action Selectioncited by 1
- 2026Resample or Reroute? Recoverable Stopping Debt Without Identified Action Selection9 Jul 2026
- 2026Cost-Optimal LLM Routing with Limited User Feedback under User Satisfaction Guarantees12 Jun 2026
- 2026Learning Agent Routing From Early Experience8 May 2026
- 2026ParetoBandit: Budget-Paced Adaptive Routing for Non-Stationary LLM Serving31 Mar 2026
- 2025Routesplain: Towards Faithful and Intervenable Routing for Software-related Tasks12 Nov 2025
Similar, not cited
Close in wording, no citation either way
- 2026Dynamic Model Routing and Cascading for Efficient LLM Inference: A Survey
- 2024TensorOpera Router: A Multi-Model Router for Efficient LLM Inference
- 2025Rethinking Predictive Modeling for LLM Routing: When Simple kNN Beats Complex Learned Routers
- 2025Universal Model Routing for Efficient LLM Inference
- 2025Confidence-Guided Stepwise Model Routing for Cost-Efficient Reasoning
- 2025Route-and-Reason: Scaling Large Language Model Reasoning with Reinforced Model Router
- 2024Performance Characterization of Expert Router for Scalable LLM Inference
- 2024RouteLLM: Learning to Route LLMs with Preference Data