Skip to content
Preprint

Opportunity Is Not Realizability: Selection-Valid Diagnostics for Multi-LLM Routing

Aug 2026 · 2 citations · 42 references
Computer Science

TL;DR

The realizable share of oracle opportunity is small and certifiable: strong routers beat the best fixed model, and most of the gap remains, while the selection-valid confidence intervals are small and certifiable.

Abstract

Oracle routing measures how much a pool of language models could gain from per-query selection, but the diagnostic has two flaws: testing against a best fixed model selected on the same examples invalidates paired inference, and a full-information oracle sees outcomes no deployable router observes. We separate three estimands (outcome-oracle opportunity, the Bayes-optimal gain from a declared pre-answer signal, and the held-out gain of a learned router) and prove selection-valid confidence intervals that survive choosing the best fixed model or the best member of a router family, a signal-information sandwich, and a $(1-1/e)$ greedy guarantee for building compact pools from submodular complementary coverage. On eight checkpoints from six families over four benchmarks, selection-valid intervals certify a population oracle gap of $9.7$--$30.7$ points on every task, yet the strongest deployable prompt router recovers only $7.5$--$14.4\%$ of it, and the simultaneous interval for the best of eleven tested policies has lower limit zero throughout. The realizable share of oracle opportunity is small and certifiable: strong routers beat the best fixed model, and most of the gap remains.

View source

Similar papers

Preprint Aug 2026

Reachability Is Not Realization: Tracing the Sources of LLM Benchmark Gains

This work establishes a question-level audit under fixed budgets, temperatures, and answer formats, and asks why reachable answers sometimes fail to appear, and test whether inference-time layer routing can expand reachability.

Yan-Chao Li, Wan-Hao Liu, Jia-Qing Xie et al. · 0 citations
Preprint Aug 2026

Uncertainty Is Not Enough: Value-of-Information Routing for Mixtures of LoRA Experts

Mixtures of low-rank adaptation experts increase parameter-efficient capacity by routing each input through a subset of adapters. Recent dynamic routers activate more experts when the router or prediction is uncertain. This rule silently equates uncertainty with useful additional computation: an uncertain example may c...

Tom Saliencro, Rohan Desai, Priya Nair et al. · 2 citations
Open access Jul 2026

Contamination-Free LLM Routing on LiveBench Reasoning Tasks: Accuracy-Cost-Latency Tradeoff Learning

Fresh, objectively scored benchmark items can support auditable accuracy-cost-latency routing when features encode verifiable computational structure, and show that fresh, objectively scored benchmark items can support auditable accuracy-cost-latency routing when features encode verifiable computational structure.

Grace Xu · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.