mlsanityData to 14 Oct 2026

HyDRA: Hybrid Dynamic Routing Architecture for Heterogeneous LLM Pools

arXiv 2605.17106 ↗First posted 16 May 2026cs.CL cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

Production LLM deployments increasingly maintain heterogeneous model pools spanning order-of-magnitude cost differences. Existing routers make binary strong-vs-weak decisions and couple learned parameters to specific model identities, requiring retraining whenever the catalog changes. We present HyDRA (Hybrid Dynamic Routing Architecture), a framework that predicts fine-grained, multi-dimensional capability requirements per query and matches them against configuration-defined model profiles via shortfall matching. A ModernBERT encoder with K=4 independent sigmoid heads scores each query along reasoning, code generation, debugging, and tool use; a shortfall-matching algorithm then selects the cheapest model whose capabilities meet the predicted requirements. The deployed predictor runs at 86 ms median CPU inference latency in production, and is fully decoupled from the model catalog -- adding or removing models requires only a configuration change, with zero retraining. On SWE-Bench Verified (5-model pool: GPT-5.4-mini, Claude Haiku 4.5, GPT-5.3 Codex, Claude Sonnet 4.6, GPT-5.4), HyDRA's tunable shortfall threshold spans three regimes: peak-quality exceeds the always-strong Claude Sonnet 4.6 baseline (75.4% vs. 74.2% resolution) at 12.9% cost savings; iso-quality matches Sonnet at 54.1% cost savings, a 6x improvement over our prior in-house binary router at 9.1%; aggressive pushes savings to 72.5% for a 3.2-point quality trade. Results generalize across LiveCodeBench, BigCodeBench, and tau-bench. HyDRA is deployed to all users in GitHub Copilot's VS Code Chat auto-mode and -- to our knowledge for the first time in the LLM routing literature -- demonstrates language-invariant routing across CJK, European, and other script families.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 22 of its 30 references that are in the map. First posted on arXiv 16 May 2026.

Builds on

22 of 30 references.

References · 22

  1. 2023Judging LLM-as-a-Judge with MT-Bench and Chatbot Arenacited by 8,626
  2. 2023SWE-bench: Can Language Models Resolve Real-World GitHub Issues?cited by 3,373
  3. 2024LiveCodeBench: Holistic and Contamination Free Evaluation of Large Language Models for Codecited by 2,004
  4. 2024τ-bench: A Benchmark for Tool-Agent-User Interaction in Real-World Domainscited by 1,402
  5. 2023FrugalGPT: How to Use Large Language Models While Reducing Cost and Improving Performancecited by 853
  6. 2024RouteLLM: Learning to Route LLMs with Preference Datacited by 682
  7. 2025τ2-Bench: Evaluating Conversational Agents in a Dual-Control Environmentcited by 627
  8. 2023LLM-Blender: Ensembling Large Language Models with Pairwise Ranking and Generative Fusioncited by 564
  9. 2024BigCodeBench: Benchmarking Code Generation with Diverse Function Calls and Complex Instructionscited by 546
  10. 2024Hybrid LLM: Cost-Efficient and Quality-Aware Query Routingcited by 372
  11. 2021Distribution-Free, Risk-Controlling Prediction Setscited by 288
  12. 2023Routing to the Expert: Efficient Reward-guided Ensemble of Large Language Modelscited by 145
10 more
  1. 2023EcoAssistant: Using LLM Assistant More Affordably and Accuratelycited by 49
  2. 2025Beyond GPT-5: Making LLMs Cheaper and Better via Performance-Efficiency Optimized Routingcited by 34
  3. 2025Multilingual Routing in Mixture-of-Expertscited by 29
  4. 2026Task-Aware LLM Routing with Multi-Level Task-Profile-Guided Data Synthesis for Cold-Start Scenarioscited by 10
  5. 2026LLM Router: Rethinking Routing with Prefill Activationscited by 5
  6. 2026Route to Rome Attack: Directing LLM Routers to Expensive Models via Adversarial Suffix Optimizationcited by 5
  7. 2026From Myopic Selection to Long-Horizon Awareness: Sequential LLM Routing for Multi-Turn Dialoguecited by 4
  8. 2026Triage: Routing Software Engineering Tasks to Cost-Effective LLM Tiers via Code Quality Signalscited by 3
  9. 2025Routesplain: Towards Faithful and Intervenable Routing for Software-related Taskscited by 2
  10. 2026RouteNLP: Closed-Loop LLM Routing with Conformal Cascading and Distillation Co-Optimizationcited by 2

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.