mlsanityData to 7 Oct 2026

MetaLLM: A High-performant and Cost-efficient Dynamic Framework for Wrapping LLMs

arXiv 2407.10834 ↗First posted 15 Jul 2024cs.LG cs.AIcited by 39

Not on the map. Why?

Abstract (arXiv)

The rapid progress in machine learning (ML) has brought forth many large language models (LLMs) that excel in various tasks and areas. These LLMs come with different abilities and costs in terms of computation or pricing. Since the demand for each query can vary, e.g., because of the queried domain or its complexity, defaulting to one LLM in an application is not usually the best choice, whether it is the biggest, priciest, or even the one with the best average test performance. Consequently, picking the right LLM that is both accurate and cost-effective for an application is necessary yet remains a challenge. In this paper, we introduce MetaLLM, a framework that dynamically and intelligently routes each query to the optimal LLM (among several available LLMs) for classification and multi-choice question-answering tasks, achieving significantly improved accuracy and cost-effectiveness. By framing the selection problem as a multi-armed bandit, MetaLLM balances prediction accuracy and cost efficiency under uncertainty. Our experiments, conducted on popular LLM platforms such as OpenAI and Together AI, as well as open-source LLM, showcase MetaLLM's efficacy in real-world scenarios, laying the groundwork for future extensions.

Key facts. Cited by 39 papers in the map (data through 7 Oct 2026). Builds on 32 of its 38 references that are in the map. First posted on arXiv 15 Jul 2024.

Builds on

32 of 38 references.

References · 32

  1. 2020Language Models are Few-Shot Learnerscited by 32,199
  2. 2022Training language models to follow instructions with human feedbackcited by 15,712
  3. 2022Chain-of-Thought Prompting Elicits Reasoning in Large Language Modelscited by 12,302
  4. 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,049
  5. 2020Scaling Laws for Neural Language Modelscited by 6,411
  6. 2022Self-Consistency Improves Chain of Thought Reasoning in Language Modelscited by 5,601
  7. 2022PaLM: Scaling Language Modeling with Pathwayscited by 5,304
  8. 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,413
  9. 2023Tree of Thoughts: Deliberate Problem Solving with Large Language Modelscited by 3,155
  10. 2022Training Compute-Optimal Large Language Modelscited by 2,927
  11. 2021Convex optimizationcited by 2,479
  12. 2021Pre-train, Prompt, and Predict: A Systematic Survey of Prompting Methods in Natural Language Processingcited by 2,222
20 more
  1. 2022Least-to-Most Prompting Enables Complex Reasoning in Large Language Modelscited by 1,397
  2. 2020Exploiting Cloze Questions for Few Shot Text Classification and Natural Language Inferencecited by 934
  3. 2022Interleaving Retrieval with Chain-of-Thought Reasoning for Knowledge-Intensive Multi-Step Questionscited by 911
  4. 2021GLaM: Efficient Scaling of Language Models with Mixture-of-Expertscited by 890
  5. 2023FrugalGPT: How to Use Large Language Models While Reducing Cost and Improving Performancecited by 791
  6. 2024RouteLLM: Learning to Route LLMs with Preference Datacited by 633
  7. 2023LLM-Blender: Ensembling Large Language Models with Pairwise Ranking and Generative Fusioncited by 550
  8. 2024Hybrid LLM: Cost-Efficient and Quality-Aware Query Routingcited by 354
  9. 2013Learning Factored Representations in a Deep Mixture of Expertscited by 275
  10. 2024RouterBench: A Benchmark for Multi-LLM Routing Systemcited by 222
  11. 2023Large Language Model Routing with Benchmark Datasetscited by 166
  12. 2021Efficient Deep Learning: A Survey on Making Deep Learning Models Smaller, Faster, and Bettercited by 153
  13. 2023Routing to the Expert: Efficient Reward-guided Ensemble of Large Language Modelscited by 141
  14. 2023Fly-Swat or Cannon? Cost-Effective Language Model Choice via Meta-Modelingcited by 94
  15. 2023Pre-train, Prompt and Recommendation: A Comprehensive Survey of Language Modelling Paradigm Adaptations in Recommender Systemscited by 45
  16. 2023Fusing Models with Complementary Expertisecited by 45
  17. 2023Getting MoRE out of Mixture of Language Model Reasoning Expertscited by 44
  18. 2020FrugalML: How to Use ML Prediction APIs More Accurately and Cheaplycited by 33
  19. 2023Tryage: Real-time, intelligent Routing of User Prompts to Large Language Modelscited by 28
  20. 2021Efficient Online ML API Selection for Multi-Label Classification Taskscited by 11

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 2; 2025: 21; 2026: 16.

39 papers.

Sort:

By area:

  1. 2025Harnessing Multiple Large Language Models: A Survey on LLM Ensemblecited by 86
  2. 2024A Unified Approach to Routing and Cascading for LLMscited by 71
  3. 2025RouterEval: A Comprehensive Benchmark for Routing LLMs to Explore Model-level Scaling Up in LLMscited by 58
  4. 2025MixLLM: Dynamic Routing in Mixed Large Language Modelscited by 56
  5. 2025CARROT: A Cost Aware Rate Optimal Routercited by 34
  6. 2025Adaptive LLM Routing under Budget Constraintscited by 21
  7. 2025Doing More with Less: A Survey on Routing Strategies for Resource Optimisation in Large Language Model-Based Systemscited by 18
  8. 2025Online Multi-LLM Selection via Contextual Bandits under Unstructured Context Evolutioncited by 18
  9. 2025Cost-Aware Contrastive Routing for LLMscited by 16
  10. 2026Dynamic Model Routing and Cascading for Efficient LLM Inference: A Surveycited by 16
  11. 2025LLM DNA: Tracing Model Evolution via Functional Representationscited by 15
  12. 2026R2-Router: A New Paradigm for LLM Routing with Reasoningcited by 13
27 more
  1. 2025TagRouter: Learning Route to LLMs through Tags for Open-Domain Text Generation Taskscited by 9
  2. 2025C3PO: Optimized Large Language Model Cascades with Probabilistic Cost Constraints for Reasoningcited by 8
  3. 2026Task-Aware LLM Routing with Multi-Level Task-Profile-Guided Data Synthesis for Cold-Start Scenarioscited by 8
  4. 2024LASeR: Learning to Adaptively Select Reward Models with Multi-Armed Banditscited by 7
  5. 2025Rethinking Predictive Modeling for LLM Routing: When Simple kNN Beats Complex Learned Routerscited by 7
  6. 2025Agentic Services Computingcited by 6
  7. 2025LLM Routing with Dueling Feedbackcited by 6
  8. 2025Towards Efficient Multi-LLM Inference: Characterization and Analysis of LLM Routing and Hierarchical Techniquescited by 5
  9. 2025Cost-aware LLM-based Online Dataset Annotationcited by 4
  10. 2025Near-Optimal Online Deployment and Routing for Streaming LLMscited by 3
  11. 2026Switchcraft: AI Model Router for Agentic Tool Callingcited by 3
  12. 2025Resource-efficient Inference with Foundation Model Programscited by 2
  13. 2026RouteNLP: Closed-Loop LLM Routing with Conformal Cascading and Distillation Co-Optimizationcited by 2
  14. 2026WISERouter: LLM Routing with Workload Budget Constraintcited by 2
  15. 2025CONCUR: A Framework for Continual Constrained and Unconstrained Routingcited by 1
  16. 2026ConsRoute:Consistency-Aware Adaptive Query Routing for Cloud-Edge-Device Large Language Modelscited by 1
  17. 2026Policy Regret for Embedding Model Routing: Contextual Bandits with Low-Rank Expertscited by 1
  18. 2026SCATE: Learning to Supervise Coding Agents for Cost-Effective Test Generationcited by 1
  19. 2025CoE-Ops: Collaboration of LLM-based Experts for AIOps Question-Answeringcited by 0
  20. 2025Online Budget Allocation with Censored Semi-Bandit Feedbackcited by 0
  21. 2026Expected Reward Prediction, with Applications to Model Routingcited by 0
  22. 2026DLLG: Dynamic Logit-Level Gating of LLM Expertscited by 0
  23. 2026Correlation-Aware Contextual Bandits with Surrogate Rewards for LLM Routingcited by 0
  24. 2026Agora: Enhancing LLM Agent Reasoning Via Auction-Based Task Allocationcited by 0
  25. 2026RLCascadeRouter: Quality-Estimator-Free Cascade Routing via Reinforcement Learningcited by 0
  26. 2026Multinomial Subset Routing with Sum-Max Rewards and Operational Constraintscited by 0
  27. 2026Online Learning with LLM Experts from Limited Feedbackcited by 0