Paper

Route Anything: A Study of Model and Policy Routing for General-Purpose AI Systems

Per-input routing across heterogeneous models and robot policies, optimized for quality-cost tradeoffs and trained on candidate outcome prediction.

arXiv ↗Nov 3, 2026Code ↗

  • cv
  • multimodal
  • routing
  • mixture of experts
  • robot learning
Shows router pipeline plus headline routing gains and efficiency, core contribution
Shows router pipeline plus headline routing gains and efficiency, core contribution

What it is

A unified framework for routing across models and policies in text, generation, agents, and robotics, with theory plus a 25-benchmark omni-modal routing dataset. Instead of single-model or LM-only routing, it studies per-input routing across modalities with a unified quality-cost objective, a theory of routing under available information, and learned routers trained to predict each candidate's outcome rather than winner labels.

Key results

  • Oracle routing beats best fixed by 5.4 pts across 24 benchmarks
  • Learned routers gain 2.1 pts on video generation vs best fixed
  • Robot routing reaches 71.6% vs 70.5% best single policy with 24% less time

Shows that much of the gain in general-purpose AI systems comes from input-level orchestration of specialized candidates, not from picking one globally best model.

One useful ML email a week.

Worth your time, not all of your time.

We track new ML work across papers, code, and data, then keep only the pieces worth a closer look. Selected, not collected.

Papers.Data.Code

The Weekly ML Signal

Selected, not collected.

One useful ML email a week: the papers, repos and datasets worth your attention.

Worth your time, not all of your time.