LGAICLJun 26, 2024

RouteLLM: Learning to Route LLMs with Preference Data

arXiv:2406.18665v4434 citations
Originality Incremental advance
AI Analysis

This provides a cost-effective solution for deploying LLMs, though it is incremental as it builds on existing routing and preference-based training methods.

The paper tackles the trade-off between performance and cost in selecting large language models by proposing efficient router models that dynamically choose between stronger and weaker LLMs during inference, resulting in cost reductions of over 2 times in some cases without compromising response quality.

Large language models (LLMs) exhibit impressive capabilities across a wide range of tasks, yet the choice of which model to use often involves a trade-off between performance and cost. More powerful models, though effective, come with higher expenses, while less capable models are more cost-effective. To address this dilemma, we propose several efficient router models that dynamically select between a stronger and a weaker LLM during inference, aiming to optimize the balance between cost and response quality. We develop a training framework for these routers leveraging human preference data and data augmentation techniques to enhance performance. Our evaluation on widely-recognized benchmarks shows that our approach significantly reduces costs-by over 2 times in certain cases-without compromising the quality of responses. Interestingly, our router models also demonstrate significant transfer learning capabilities, maintaining their performance even when the strong and weak models are changed at test time. This highlights the potential of these routers to provide a cost-effective yet high-performance solution for deploying LLMs.

Code Implementations2 repos
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes