With the rapid development of LLMs, it is natural to ask how to harness their capabilities efficiently. In this paper, we explore whether it is feasible to direct each input query to a single most suitable LLM. To this end, we propose LLM routing for challenging reasoning tasks. Our extensive experiments suggest that such routing shows promise but is not feasible in all scenarios, so more robust approaches should be investigated to fill this gap.

翻译：随着大语言模型的快速发展，如何高效利用其能力成为自然关注的问题。本文探讨了将每个输入查询路由到最合适的单一LLM是否可行。为此，我们提出了针对挑战性推理任务的LLM路由方法。大量实验表明，尽管此类路由展现出潜力，但在所有场景下并不可行，因此需要研究更稳健的方法来填补这一空白。