CUPID in the Model Zoo: Online Matchmaking for Selecting Your Dream LLM
Son Nguyen, Xinyuan Liu, Ransalu Senanayake
Abstract
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.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 8fc41fb7-27d1-4df4-a6c5-ba5cab5829d1Builds on11
- Chatbot Arena: An Open Platform for Evaluating LLMs by Human PreferenceWei-Lin Chiang, Lianmin Zheng, Ying Sheng, Anastasios Nikolas Angelopoulos et al.ICML 2024 · 1,212 citations
- Hybrid LLM: Cost-Efficient and Quality-Aware Query RoutingDujian Ding, Ankur Mallick, Chi Wang, Robert Sim et al.ICLR 2024 · 282 citations
- LLM-Blender: Ensembling Large Language Models with Pairwise Ranking and Generative FusionDongfu Jiang, Xiang Ren, Bill Yuchen LinACL 2023 · 95 citations
- Causal LLM Routing: End-to-End Regret Minimization from Observational DataAsterios Tsiourvas, Wei Sun, Georgia PerakisNeurIPS 2025 · 27 citations
- Improved Analysis for Bandit Learning in Matching MarketsFang Kong, Zilong Wang, Shuai LiNeurIPS 2024 · 8 citations
Related papers
- Preference Is More than Comparisons: Rethinking Dueling Bandits with Augmented Human FeedbackShengbo Wang, Hong Sun, Ke LiAAAI 2026
- Large Language Model-Enhanced Multi-Armed BanditsJiahang Sun, Zhiyong Wang, Runhan Yang, Chenjun Xiao et al.ACL 2026 · 6 citations
- Active Evaluation: Efficient NLG Evaluation with Few Pairwise ComparisonsAkash Kumar Mohankumar, Mitesh M. KhapraACL 2022 · 8 citations
- T-POP: Test-Time Personalization with Online Preference FeedbackZikun Qu, Min Zhang, Mingze Kong, Xiang Li et al.ICML 2026 · 4 citations
- Comparison-based Active Preference Learning for Multi-dimensional PersonalizationMinhyeon Oh, Seungjoon Lee, Jungseul OkACL 2025 · 1 citation
