mlsanityData to 14 Oct 2026

CUPID in the Model Zoo: Online Matchmaking for Selecting Your Dream LLM

arXiv 2606.00846 ↗First posted 30 May 2026cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Users increasingly face the challenge of selecting an appropriate LLM for a given task from a rapidly growing pool of LLMs, each with distinct but often opaque latent properties. Compounding this challenge, users may lack the vocabulary or awareness to explicitly articulate the characteristics they value in an LLM's responses or deployment. We propose an interaction-efficient active learning framework in which a dueling bandit algorithm iteratively selects pairs of LLMs, collects user feedback about their responses, and updates its belief about the user's latent preferences. We introduce a novel belief-aware upper confidence bound strategy that balances exploration of the model pool with exploitation of inferred preferences, enabling efficient alignment between user needs and LLM capabilities under user-specified cost and time budgets. Through diverse experiments on LLMs and human studies, we experimentally verify that our model can efficiently match well-aligned LLMs to users at a lower cost.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 22 of its 44 references that are in the map. First posted on arXiv 30 May 2026.

Builds on

22 of 44 references.

References · 22

  1. 2023Judging LLM-as-a-Judge with MT-Bench and Chatbot Arenacited by 8,626
  2. 2024MMLU-Pro: A More Robust and Challenging Multi-Task Language Understanding Benchmarkcited by 1,848
  3. 2024Chatbot Arena: An Open Platform for Evaluating LLMs by Human Preferencecited by 1,184
  4. 2023FrugalGPT: How to Use Large Language Models While Reducing Cost and Improving Performancecited by 853
  5. 2024RouteLLM: Learning to Route LLMs with Preference Datacited by 682
  6. 2023LLM-Blender: Ensembling Large Language Models with Pairwise Ranking and Generative Fusioncited by 564
  7. 2024Hybrid LLM: Cost-Efficient and Quality-Aware Query Routingcited by 372
  8. 2013Bandits with Knapsackscited by 164
  9. 2024HelpSteer2-Preference: Complementing Ratings with Preferencescited by 130
  10. 2015Contextual Dueling Banditscited by 101
  11. 2018Adversarial Bandits with Knapsackscited by 73
  12. 2020Latent Bandits Revisitedcited by 44
10 more
  1. 2015Sparse Dueling Banditscited by 29
  2. 2025Causal LLM Routing: End-to-End Regret Minimization from Observational Datacited by 28
  3. 2016Latent Contextual Bandits and their Application to Personalized Recommendations for New Userscited by 18
  4. 2024Nearly Optimal Algorithms for Contextual Dueling Bandits from Adversarial Feedbackcited by 9
  5. 2024Multi-Armed Bandits with Network Interferencecited by 8
  6. 2024LASeR: Learning to Adaptively Select Reward Models with Multi-Armed Banditscited by 7
  7. 2025Survey: Multi-Armed Bandits Meet Large Language Modelscited by 7
  8. 2025LLM Routing with Dueling Feedbackcited by 7
  9. 2023Early ChatGPT User Portrait through the Lens of Datacited by 6
  10. 2025Online Clustering of Dueling Banditscited by 3

Built on by

Not cited yet.