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

Son Nguyen, Xinyuan Liu, Ransalu Senanayake
5/30/2026
cs.LG

No confident code implementation found for this paper.

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{nguyen2026cupid,
  title  = {CUPID in the Model Zoo: Online Matchmaking for Selecting Your Dream LLM},
  author = {Son Nguyen and Xinyuan Liu and Ransalu Senanayake},
  year   = {2026},
  eprint = {2606.00846},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2606.00846v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2606.00846.svg)](https://codeofpaper.com/paper/2606.00846)

Discussion