Protocol

Route to the cheapest model that still passes your task eval

Do not pay for intelligence the task does not use—but do not guess where the boundary is.

About 1 min read

Before you use it

Use when
  • A workflow uses a frontier model for every request even though many requests may be easier.

Keep this limit in mind

  • A cheaper request can still create a more expensive service if retries, failures or human recovery increase.

An idea to explore.

Try this idea.

Inspect the example, try the idea in your situation, then check your next move.

Keep reading

Why it matters

Partition requests by observable task features, evaluate candidate models on each slice and route only where the cheaper model continues to meet the required outcome and safety thresholds. Re-test the boundary after model, prompt, tool or traffic changes.

Steps

  1. Define task slices that can be identified before inference.
  2. Run the same acceptance eval for candidate models on each slice.
  3. Choose the least expensive model that passes the slice's required thresholds.
  4. Keep a fallback for uncertain or failing cases.
  5. Re-evaluate routing when the system or traffic changes.

An example

Use a smaller model for straightforward classification only after local cases show it preserves routing accuracy and escalation behavior; send ambiguous cases to the stronger model.

Check your result

Every routing rule points to a current local eval slice and a fallback path rather than to model reputation.

Save and practise this idea

My learning

Read. Recall. Repeat.

Save this idea and return to it on any device.

Use email
Keep exploring

Connected ideas

You are readingRoute to the cheapest model that still passes your task eval

Evidence and sources
Supports

Model routing can use local task evaluations to identify the least expensive model that still meets the required behavior for a bounded class of requests.

The passing boundary can change with prompts, tools, model versions and request distribution, so routing rules require re-evaluation.

Improving Agents Is a Data Mining Problem · 7:36-12:46, find the least expensive capable model and fit model, harness and task together

All sources (1)
Edition and review

Version 0.1.0

No review details are supplied for this edition.

Read this idea as JSON · Release details