Skip to content
AI.info

Research

AgentRouter: Heterogeneous Model Routing for Cost-Optimal Multi-Step Agentic Workflows

Overview Research area: LLM inference economics and agentic AI systems — specifically, routing each step of a multi-step agent trajectory to an appropriately sized model. Technical level: Advanced. Th

arXiv
2609.22951
Published
2026-09-19
Authors
Rudrendu Kumar Paul, Sourav Nandy

AI summary

Overview

Research area: LLM inference economics and agentic AI systems — specifically, routing each step of a multi-step agent trajectory to an appropriately sized model.

Technical level: Advanced. The paper formalizes routing as a sequential assignment problem and reports a trained classifier with deployment-level constraints (parameter count, per-step latency), so it assumes familiarity with LLM serving, model tiers, and agentic pipelines.

Scope: The paper proposes and evaluates AgentRouter, a small per-step routing classifier that assigns each step of an agent trajectory to one of four model tiers to cut inference cost while preserving end-to-end task quality.

What This Paper Is About

Enterprise agentic systems typically send every step of a multi-step trajectory to a frontier model, which the authors argue wastes 60–80% of the inference budget on subtasks that smaller models handle just as well. Existing routing methods were designed for single-turn query assignment and do not account for the fact that complexity varies sharply within a single trajectory — a planning step may need frontier-class reasoning while a later formatting step only needs a 7B model. The goal is a router that decides per step, cheaply enough to run inline, and that preserves trajectory-level task completion quality.

Key Contributions

  1. A formalization of step-level model routing as a sequential assignment problem over agent trajectories, rather than the single-turn query assignment framing used by prior routing work.
  2. AgentRouter, a lightweight classifier of 12M parameters that maps each trajectory step to one of four model tiers using five features extractable at routing time, with under 5ms overhead per step on an A100 GPU.
  3. A training corpus of 50,000 annotated agent trajectory steps spanning planning, coding, research, and data analysis tasks.
  4. An empirical comparison against per-step applications of two existing routers (RouteLLM and FrugalGPT), attributing their weaker cost savings to single-turn training signals that miss trajectory-level quality dependencies.

Main Findings

  • Large cost reduction at near-frontier quality: AgentRouter achieves 72% cost reduction relative to frontier-only baselines while retaining 97.3% of frontier-only quality, described as less than 3% degradation in end-to-end task completion.
  • Routing accuracy varies by tier difficulty: Per-step routing accuracy reaches 91% on minimal-complexity steps and 85% on efficient-tier steps, but falls to 76–82% on the harder mid-range and frontier tiers.
  • Prior routers underperform when applied per step: On the same benchmarks, RouteLLM achieves only 31% cost reduction and FrugalGPT only 44%, which the authors attribute to their single-turn training signal missing trajectory-level quality dependencies.
  • Cheap enough to sit inline in the agent loop: The reported 12M-parameter size and sub-5ms per-step overhead on an A100 indicate that routing cost itself is not a meaningful fraction of the savings.
  • Complexity is heterogeneous within a trajectory: The motivating claim is that a planning step may require frontier-class reasoning while a subsequent formatting step needs only a 7B model, which is the property single-turn routers fail to exploit.

Methodology in Plain English

The researchers start from the observation that agent trajectories are sequences of steps of very different difficulty, and frame the routing decision as a sequential assignment problem: at each step, pick which model tier should handle it. They build a small classifier — 12 million parameters — that looks at five features available at the moment of routing (the abstract does not enumerate them) and predicts one of four model tiers. To train it, they annotate 50,000 steps drawn from agent trajectories in planning, coding, research, and data analysis. They then compare the resulting router's cost and quality against always using a frontier model, and against two existing routing methods applied at the per-step level. Efficiency of the router itself is reported in terms of parameter count and latency per step on an A100 GPU.

The abstract does not describe the annotation procedure, the specific baseline models behind each tier, the benchmarks used, or how quality was measured beyond "end-to-end task completion."

Why This Matters

Impact on research: The paper shifts routing from a per-query decision to a per-step decision inside a trajectory, and argues that trajectory-level quality dependencies are what single-turn routers miss. That reframing is the paper's distinctive contribution — it suggests routing research should be trained and evaluated on whole agent trajectories rather than isolated prompts.

Real-world applications:

  • Enterprise agents that run long multi-step workflows, where most steps are routine and only a few need frontier reasoning.
  • Coding agents, where planning and debugging steps differ sharply in difficulty from boilerplate edits or formatting.
  • Research and retrieval agents that interleave synthesis steps with simple extraction or summarization steps.
  • Data analysis pipelines where a small model can handle routine transformations while complex reasoning stays on a frontier tier.

Industry relevance: Inference cost is a first-order constraint on deploying agents at scale. A router that claims roughly 70% cost reduction with minimal quality loss, and that adds negligible latency per step, is directly actionable for teams operating agent platforms. The reported gap against RouteLLM and FrugalGPT also matters competitively: it implies off-the-shelf routers designed for chat queries may not deliver their advertised savings once embedded in an agent loop.

Future Directions

  • Improving mid-range and frontier tier accuracy: Routing accuracy is weakest on the harder tiers (76–82%), which are the most expensive to get wrong — closing that gap is the most direct next step.
  • Extending beyond four tiers and five features: The abstract does not explore whether finer-grained model selection or different routing features would improve the cost-quality frontier.
  • Generalization to unseen task domains: The training set covers planning, coding, research, and data analysis; behavior on other agentic domains is not addressed.
  • Characterizing failure modes at the trajectory level: Since the argument is that quality dependencies span steps, understanding when a single misrouted step propagates through a trajectory is an open question.
  • Reproducing and comparing under shared conditions: Independent replication against a wider set of routers, benchmarks, and tier configurations would test how much of the advantage comes from trajectory-level training versus the specific setup.

Target Audience

ML systems and inference-infrastructure engineers building or operating agentic applications; applied researchers working on LLM routing, cost optimization, and model cascades; and technical decision-makers evaluating whether to run agent workloads entirely on frontier models versus a tiered mixture. Readers focused on model quality or training methods rather than serving economics will find less of direct interest here.

Authors’ abstract

Enterprise agentic systems that route every trajectory step to a frontier model waste 60-80% of their inference budget on subtasks that smaller models handle equally well. Existing routing solutions optimize single-turn query assignment but ignore a property unique to agentic workflows: subtask complexity varies widely within a single trajectory. A planning step may require frontier-class reasoning while a subsequent formatting step needs only a 7B model. We formalize step-level model routing as a sequential assignment problem over agent trajectories and propose AgentRouter, a lightweight classifier (12M parameters, <5ms overhead per step on an A100 GPU) that maps each trajectory step to one of four model tiers using five features extractable at routing time. Trained on 50,000 annotated agent trajectory steps spanning planning, coding, research, and data analysis tasks, AgentRouter achieves 72% cost reduction relative to frontier-only baselines, retaining 97.3% of frontier-only quality (less than 3% degradation in end-to-end task completion); per-step routing accuracy reaches 91% on minimal-complexity steps and 85% on efficient-tier steps, with 76-82% on the harder mid-range and frontier tiers. On the same benchmarks, RouteLLM and FrugalGPT (applied per-step) achieve only 31% and 44% cost reduction respectively, because their single-turn training signal misses trajectory-level quality dependencies.

Read the original paper