← Back to all news
arXiv Machine Learning October 19, 2026 By Ameya Anjarlekar, Rasoul Etesami, R Srikant

Chance-Constrained Personalized LLM Routing with Online Preference Learning

Read the original on arXiv Machine Learning →

The Flow has not summarised this story yet — read it at arXiv Machine Learning.

  • llms
  • reinforcement-learning

One email a morning, machine-written

One email a day, machine-written, one click to leave. We never share your address.

Related stories

arXiv Machine Learning
Jun 5

Learning to Route LLMs from Implicit Cost-Performance Preferences via Meta-Learning

arXiv:2606. 06178v1 Announce Type: new Abstract: Large language models (LLMs) present a trade-off between performance and cost, where more powerful models incur greater expense.

By Jiahao Zeng, Ming Tang, Ningning Ding
llmsreinforcement-learning
More like this →
arXiv AI
Jul 28

WISERouter: LLM Routing with Workload Budget Constraint

arXiv:2607. 23765v1 Announce Type: cross Abstract: Large language models (LLMs) achieve impressive performance across multiple domains, but using the most capable model for every query is prohibitive at scale.

By Yifei Li, Zihui Gao, Laks V. S. Lakshmanan
llmsreinforcement-learning
More like this →
arXiv Machine Learning
Sep 10

Online Learning with LLM Experts from Limited Feedback

arXiv:2609.05820v1 Announce Type: new Abstract: We study adaptive routing of prompts to large language model (LLM) experts to maximize response quality in an online setting with limited feedback. We...

By Wang Wei, Soumyabrata Pal, Koyel Mukherjee, Franck Dernoncourt, Ryan A. Rossi, Branislav Kveton, Hoda Eldardiry
llmsreinforcement-learning
More like this →
Hugging Face Trending Papers
Aug 17

Coverage-Maximizing Multinomial Subset Routing under Operational Constraints

We introduce Multinomial Subset Routing (MSR), a new online routing framework over $K$ experts in which the learner keeps a multinomial routing policy instead of a deterministic subset of experts. At each round, the learner samples $M$ experts i.

reinforcement-learning
More like this →
arXiv Machine Learning
Jun 30

Learning to Route and Schedule LLMs from User Retrials via Contextual Queueing Bandits

arXiv:2602. 02061v2 Announce Type: replace Abstract: Explosive demands for LLMs often cause user queries to accumulate in server queues, requiring efficient routing (query-LLM matching) and scheduling (query prioritization) mechanisms.

By Seoungbin Bae, Junyoung Son, Dabeen Lee
llmsrag
More like this →
arXiv AI
Jun 19

Cost-Optimal LLM Routing with Limited User Feedback under User Satisfaction Guarantees

arXiv:2606. 19376v1 Announce Type: cross Abstract: Inference costs for large language model (LLM) applications are rapidly growing, driven by surging demand and rising infrastructure cost.

By Herbert Woisetschl\"ager, Arastun Mammadli, Ryan Zhang, Shiqiang Wang
llmsbenchmarks
More like this →
About Pricing API Newsletter Sources Privacy Terms Refunds Accessibility Provider info Contact RSS

The Flow links to publishers and never republishes their articles. Summaries are machine-generated.

v1.1.0 · 5f852ea