arXiv Machine Learning July 7, 2026 By Teng-Ruei Chen

How Much of the Routing Gap Is Real? Decomposing the Router-to-Oracle Gap into Reproducible Specialist Advantage and Single-Draw Label Noise

Read the original on arXiv Machine Learning →

arXiv:2607. 03436v1 Announce Type: new Abstract: Routing among large language models (LLMs) promises better quality at lower cost, motivated by the reported gap between learned routers and a per-instance oracle.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning

Aug 11

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

arXiv:2608. 08265v1 Announce Type: new 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.

By Ibne Farabi Shihab, Abu Sa-Adat Mohamed Moon-Im Al Ahsan, Md Najmus Swaqeeb

llms benchmarks

arXiv Machine Learning

Jul 10

Resample or Reroute? Budget-Aware Test-Time Model Selection for Large Language Models

arXiv:2607. 08665v1 Announce Type: new Abstract: Routing among large language models (LLMs) trades response quality against serving cost, motivated by the reported gap between deployed routers and a per-instance oracle.

By Teng-Ruei Chen

llms benchmarks

arXiv Machine Learning

3d ago

Counterfactual Probing for Parallel Unmasking with Hidden Forest Structure

arXiv:2609.37841v1 Announce Type: new Abstract: Masked generative models offer parallel token prediction, but accurate parallel sampling must account for dependencies among tokens. When dependencies...

By Ryotaro Kawata, Satoshi Hayakawa, Taiji Suzuki

arXiv Computation and Language

Sep 2

From Base Rollouts to RL Reasoning: A Budgeted Search Perspective

arXiv:2609.01274v1 Announce Type: new Abstract: Reinforcement learning with verifiable rewards (RLVR) improves language-model reasoning, but how these gains relate to inference-time decoding and sear...

By Wenhe Sun, Cunxiang Wang, Zijun Yao, Yixin Cao

reinforcement-learning benchmarks

arXiv Statistics ML

Sep 10

An Exponential Deterministic--Randomized Gap in ERM-Oracle Complexity for Thresholds on an Unknown Order

arXiv:2609.10196v1 Announce Type: cross Abstract: Attias, Hanneke and Ramaswami (NeurIPS 2025) asked whether randomization provably reduces the oracle calls needed for online learning when the class...

By Xuan Li

arXiv Machine Learning

Aug 12

Detecting an Effect Is Not Learning to Act on It: A Reward-SNR Floor for LLM Acquisition Agents

arXiv:2608. 10441v1 Announce Type: new Abstract: Many pipelines can pay a per-example cost to acquire an auxiliary, model-derived observation -- an LLM's structured reasoning, a slow oracle, an expensive measurement -- and then must decide when the acquired signal is worth using.

By Ying Yuan

llms rag agents

One email a morning, machine-written

Related stories

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

Resample or Reroute? Budget-Aware Test-Time Model Selection for Large Language Models

Counterfactual Probing for Parallel Unmasking with Hidden Forest Structure

From Base Rollouts to RL Reasoning: A Budgeted Search Perspective

An Exponential Deterministic--Randomized Gap in ERM-Oracle Complexity for Thresholds on an Unknown Order

Detecting an Effect Is Not Learning to Act on It: A Reward-SNR Floor for LLM Acquisition Agents