mlsanityData to 7 Oct 2026

SelectLLM: Query-Aware Efficient Selection Algorithm for Large Language Models

arXiv 2408.08545 ↗First posted 16 Aug 2024cs.CLcited by 7

Not on the map. Why?

Abstract (arXiv)

Large language models (LLMs) have been widely adopted due to their remarkable performance across various applications, driving the accelerated development of a large number of diverse models. However, these individual LLMs show limitations in generalization and performance on complex tasks due to inherent training biases, model size constraints, and the quality or diversity of pre-training datasets. A promising direction is to efficiently harness the diverse capabilities of LLMs to overcome these individual limitations. To address these limitations, we introduce a novel LLM selection algorithm called SelectLLM, which efficiently directs input queries to the most suitable subset of LLMs from a large pool, ensuring that the selected models collectively provide accurate responses. SelectLLM employs a multi-label classifier and policy based on the classifier's predictions and confidence scores in selecting an optimal, query-aware, and lightweight subset of LLMs. Our findings indicate that the proposed model outperforms existing ensemble-based baselines and achieves competitive performance with similarly sized top-performing LLMs while maintaining efficiency. Specifically, it achieves a huge reduction in inference latency on two challenging reasoning benchmarks: 13% on GSM8K and 70% on MMLU, compared to the top-performing baseline. Also, we establish a theoretical upper bound by an Oracle with LLMs and perform an in-depth linguistic analysis to understand the performance gap between the Oracle and SelectLLM.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 28 of its 51 references that are in the map. First posted on arXiv 16 Aug 2024.

Builds on

28 of 51 references.

References · 28

  1. 2020Language Models are Few-Shot Learnerscited by 32,199
  2. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
  3. 2021Training Verifiers to Solve Math Word Problemscited by 9,743
  4. 2020Measuring Massive Multitask Language Understandingcited by 7,768
  5. 2022Self-Consistency Improves Chain of Thought Reasoning in Language Modelscited by 5,601
  6. 2022Large Language Models are Zero-Shot Reasonerscited by 4,323
  7. 2021On the Opportunities and Risks of Foundation Modelscited by 3,961
  8. 2017TriviaQA: A Large Scale Distantly Supervised Challenge Dataset for Reading Comprehensioncited by 2,895
  9. 2024Phi-3 Technical Report: A Highly Capable Language Model Locally on Your Phonecited by 1,883
  10. 2022Program of Thoughts Prompting: Disentangling Computation from Reasoning for Numerical Reasoning Taskscited by 1,057
  11. 2021Are NLP Models really able to Solve Simple Math Word Problems?cited by 861
  12. 2023Quantifying Language Models' Sensitivity to Spurious Features in Prompt Design or: How I learned to start worrying about prompt formattingcited by 778
16 more
  1. 2023LLM-Blender: Ensembling Large Language Models with Pairwise Ranking and Generative Fusioncited by 550
  2. 2024Hybrid LLM: Cost-Efficient and Quality-Aware Query Routingcited by 354
  3. 2023Sentiment Analysis in the Era of Large Language Models: A Reality Checkcited by 262
  4. 2023Large Language Model Routing with Benchmark Datasetscited by 166
  5. 2018Model Evaluation, Model Selection, and Algorithm Selection in Machine Learningcited by 157
  6. 2021SimCLS: A Simple Framework for Contrastive Learning of Abstractive Summarizationcited by 131
  7. 2022Evaluating the Factual Consistency of Large Language Models Through News Summarizationcited by 90
  8. 2022SummaReranker: A Multi-Task Mixture-of-Experts Re-ranking Framework for Abstractive Summarizationcited by 61
  9. 2019Fast Structured Decoding for Sequence Modelscited by 59
  10. 2024Harnessing the Power of Multiple Minds: Lessons Learned from LLM Routingcited by 43
  11. 2023Predicting Question-Answering Performance of Large Language Models through Semantic Consistencycited by 28
  12. 2023Chain of Thought Prompting Elicits Knowledge Augmentationcited by 21
  13. 2024What Makes Math Word Problems Challenging for LLMs?cited by 19
  14. 2023Tree Prompting: Efficient Task Adaptation without Fine-Tuningcited by 17
  15. 2024Confidence-aware Contrastive Learning for Selective Classificationcited by 7
  16. 2024Is There a One-Model-Fits-All Approach to Information Extraction? Revisiting Task Definition Biasescited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 1; 2025: 5; 2026: 1.

7 papers.