mlsanityData to 7 Oct 2026

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

arXiv 2606.06178 ↗First posted 4 Jun 2026cs.LG cs.AI cs.CLcited by 0

Not on the map. Why?

Abstract (arXiv)

Large language models (LLMs) present a trade-off between performance and cost, where more powerful models incur greater expense. LLM routing aims to mitigate expenses while maintaining performance by sending queries to the most suitable model. However, existing methods cannot perform well for different user cost-performance preferences. To address this gap, we introduce a novel perceptive LLM routing paradigm for personalized and user-centric cost-performance optimization, which efficiently learns users' implicit preferences through little interaction. To handle the challenge of heterogeneous user needs, we formulate preference profiles as a set of distinct tasks in contextual bandit and propose MetaRouter, a meta-learning framework designed for preference-aware LLM routing. Experimental results show that MetaRouter outperforms strong baselines on both in-distribution and out-of-distribution tasks. Furthermore, it exhibits high efficiency in learning user preferences, robustness to changes in the routable LLMs, and scalability to multi-model routing.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 16 of its 30 references that are in the map. First posted on arXiv 4 Jun 2026.

Builds on

16 of 30 references.

References · 16

  1. 2022Chain-of-Thought Prompting Elicits Reasoning in Large Language Modelscited by 12,302
  2. 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,203
  3. 2023Sparks of Artificial General Intelligence: Early experiments with GPT-4cited by 2,579
  4. 2024Phi-3 Technical Report: A Highly Capable Language Model Locally on Your Phonecited by 1,883
  5. 2020MPNet: Masked and Permuted Pre-training for Language Understandingcited by 973
  6. 2023AlpacaFarm: A Simulation Framework for Methods that Learn from Human Feedbackcited by 738
  7. 2021BARTScore: Evaluating Generated Text as Text Generationcited by 719
  8. 2024RouteLLM: Learning to Route LLMs with Preference Datacited by 633
  9. 2019Efficient Off-Policy Meta-Reinforcement Learning via Probabilistic Context Variablescited by 372
  10. 2024Hybrid LLM: Cost-Efficient and Quality-Aware Query Routingcited by 354
  11. 2023Magicoder: Empowering Code Generation with OSS-Instructcited by 251
  12. 2024GraphRouter: A Graph-based Router for LLM Selectionscited by 154
4 more
  1. 2024FullStack Bench: Evaluating LLMs as Full Stack Coderscited by 56
  2. 2025The Avengers: A Simple Recipe for Uniting Smaller Language Models to Challenge Proprietary Giantscited by 37
  3. 2025Beyond GPT-5: Making LLMs Cheaper and Better via Performance-Efficiency Optimized Routingcited by 32
  4. 2023Meta-Learning Adversarial Bandit Algorithmscited by 8

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2025Learning to Route LLMs from Bandit Feedback: One Policy, Many Trade-offs
  2. 2025Adaptive LLM Routing under Budget Constraints
  3. 2025LLM Bandit: Cost-Efficient LLM Generation via Preference-Conditioned Dynamic Routing
  4. 2025Arch-Router: Aligning LLM Routing with Human Preferences
  5. 2025PersonalizedRouter: Personalized LLM Routing via Graph-based User Preference Modeling
  6. 2025Dynamic LLM Routing and Selection based on User Preferences: Balancing Performance, Cost, and Ethics
  7. 2025Rethinking Predictive Modeling for LLM Routing: When Simple kNN Beats Complex Learned Routers
  8. 2026LLM Routing as Reasoning: A MaxSAT View