Route to Reason: Adaptive Routing for LLM and Reasoning Strategy Selection

πŸ“… 2025-05-26
πŸ“ˆ Citations: 0
✨ Influential: 0
πŸ“„ PDF

career value

187K/year
πŸ€– AI Summary
Large language models (LLMs) often suffer from excessive computation and β€œoverthinking” in complex reasoning tasks, leading to high token costs and inefficiency. Method: This paper proposes RTR, a dynamic routing framework that adaptively selects the optimal LLM and reasoning strategy based on task difficulty under a fixed computational budget. RTR jointly compresses expert model representations and reasoning strategy embeddings, enabling plug-and-play integration of both black-box and white-box LLMs across four distinct reasoning paradigms. It employs lightweight representation learning and budget-aware decision making to support end-to-end differentiable or non-differentiable adaptation, incorporating seven open-source LLMs. Contribution/Results: Experiments on multiple reasoning benchmarks demonstrate that RTR outperforms the best single-model baseline in accuracy while reducing token consumption by over 60%, achieving a Pareto-optimal trade-off between accuracy and inference efficiency.

Technology Category

Application Category

πŸ“ Abstract
The inherent capabilities of a language model (LM) and the reasoning strategies it employs jointly determine its performance in reasoning tasks. While test-time scaling is regarded as an effective approach to tackling complex reasoning tasks, it incurs substantial computational costs and often leads to"overthinking", where models become trapped in"thought pitfalls". To address this challenge, we propose Route-To-Reason (RTR), a novel unified routing framework that dynamically allocates both LMs and reasoning strategies according to task difficulty under budget constraints. RTR learns compressed representations of both expert models and reasoning strategies, enabling their joint and adaptive selection at inference time. This method is low-cost, highly flexible, and can be seamlessly extended to arbitrary black-box or white-box models and strategies, achieving true plug-and-play functionality. Extensive experiments across seven open source models and four reasoning strategies demonstrate that RTR achieves an optimal trade-off between accuracy and computational efficiency among all baselines, achieving higher accuracy than the best single model while reducing token usage by over 60%.
Problem

Research questions and friction points this paper is trying to address.

Dynamic allocation of LMs and reasoning strategies for tasks
Reducing computational costs and avoiding model overthinking
Achieving accuracy-efficiency trade-off in reasoning tasks
Innovation

Methods, ideas, or system contributions that make the work stand out.

Dynamic allocation of LMs and reasoning strategies
Compressed representations for adaptive selection
Plug-and-play with black-box or white-box models