Source note3 min read

When Does Combining Language Models Help? A Co-Failure Ceiling on Routing, Voting, and Mixture-of-Agents Across 67 Frontier Models

Source

arXiv

arxiv.org/abs/2606.27288v1

Read the source

Source

Plain-Language Brief

The text discusses multi-model language model systems and their potential to outperform single-models in terms of accuracy. The study shows that the gain is limited by a quantity called 'beta', which represents the rate at which all models are incorrect for the same query. The text also presents a method to calculate beta and compares it with observed values on open-ended mathematics questions.

What the Document Says

  • Multi-model Language Model Systems (LLM) can beat single-model accuracy.
  • The gain of these systems is capped by a quantity called 'beta'.
  • Beta is the rate at which every model is wrong on the same query.
  • A Clopper-Pearson bound on beta gives a finite-sample certificate on the largest gain any router, vote, or cascade could deliver.
  • Across 67 models, the tetrachoric-calibrated single-factor model underprices the all-wrong tail in open-ended mathematics.
  • Observed beta is 0.052 versus 0.023 under the full 67-model Gaussian copula.
  • Re-asking questions in free-response form reopens the co-failure tail.
  • On checkable tasks, combining models rarely beats the single best model without a strong query-level routing signal.

Key Concepts Mentioned

  • Multi-model Language Model Systems
  • beta
  • Clopper-Pearson bound
  • tetrachoric-calibrated single-factor model
  • Gaussian copula
  • open-ended mathematics
  • free-response form
  • checkable tasks

Claims Made by the Document

  • Multi-model LLM systems can beat single-model accuracy.
  • The gain of these systems is capped by a quantity called 'beta'.
  • Re-asking questions in free-response form reopens the co-failure tail.

Evidence Used

  • Multi-model LLM systems are used to beat single-model accuracy (first sentence).
  • The gain is capped by a quantity called 'beta', and its calculation method is provided (several paragraphs).
  • Observed beta values on open-ended mathematics questions are presented (several paragraphs).
  • Re-asking questions in free-response form reopens the co-failure tail (last paragraph).

Methods / Approach

UNKNOWN

Limitations Stated by the Authors

UNKNOWN

Limitations Noted by the Agent

Agent interpretation — not from the source.

UNKNOWN

Open Questions

  • What are GPQA-Diamond questions?
  • How is 'kappa' calculated?

Notes for Future Q&A

May include interpretation. Labeled where it does.

  • The text does not specify what 'GPQA-Diamond' questions are.
  • It is unclear how the 'kappa' value is calculated.
  • The paper or source containing these results was published in 2026.

Raw Abstract / Excerpt

Multi-model LLM systems such as routing, voting, cascades, fusion, and mixture-of-agents are used to beat single-model accuracy. We show that their gain is capped by a quantity the field rarely reports. For any policy whose output is one member model answer, accuracy cannot exceed one minus beta, where beta is the rate at which every model is wrong on the same query. In contrast, the usual diagnostic, average pairwise error correlation rho, cannot identify beta: error laws with identical marginals and pairwise correlations can have different all-wrong rates. A Clopper-Pearson bound on beta gives a finite-sample certificate on the largest gain any router, vote, or cascade could deliver before training a router. Across 67 models from 21 providers, a tetrachoric-calibrated single-factor model still underprices the all-wrong tail: on open-ended mathematics, observed beta is 0.052 versus 0.023 under the full 67-model Gaussian copula, about 2.5 times underpricing, with 90 percent CI 1.7 to 3.4 and k equals 17. The effect recurs on execution-graded code, where beta is 0.079. Re-asking the same GPQA-Diamond questions in free-response rather than multiple-choice form reopens the tail, with beta 0.127 and a five-judge panel with kappa 0.73 to 0.92, locating co-failure in answer format rather than subject. At matched quality, low-rho heterogeneous ensembles beat high-rho Self-MoA, but on checkable tasks in our pool, combining models rarely beats the single best model without a strong query-level routing signal. Gains come from models failing on different questions, not from adding more models.