Skip to content

Quantifying Diversity of Thought: A Predictive Law of Weighted LLM Ensemble Lift

Jul 2026 · arXiv.org · Vol abs/2607.17384 · 4 citations · 62 references
Computer Science

TL;DR

An experimentally verified formal law is provided for calculating the uplift that diversity of thought provides in Large Language Model (LLM) ensembles through an exact decomposition of LLM ensemble lift into rescue and damage masses, which yields a compact heuristic for calculating uplift.

Abstract

This paper provides an experimentally verified formal law for calculating the uplift that diversity of thought provides in Large Language Model (LLM) ensembles. From first principles, we derive an exact decomposition of LLM ensemble lift into rescue and damage masses, which yields a compact heuristic for calculating uplift. From this we extract the metrics which predict ensemble performance: an accuracy-adjusted correctness correlation, $\phi_{\mathrm{adj}}$, together with the accuracy gap and collective accuracy of the pair. We test the law on 767,520 inferences from ten open-weight models over two graduate-level science benchmarks, together with a novel agentic cybersecurity benchmark in which each model conducts digital-forensics investigations by multi-turn tool use in a network-isolated sandbox (23,520 graded trials including abstentions); all votes are released openly. Calibrated once on SuperGPQA at a 40:60 vote split, the heuristic predicts lift on the calibration set with Spearman's $\rho=0.84$ and, with its coefficients frozen, transfers to two datasets never used in calibration ($\rho=0.51$ on GPQA Diamond and $0.84$ on the forensic tasks), whilst the measured swap mass tracks realised lift with $R^2\ge 0.96$ throughout. Raw $\phi$ has almost no predictive power ($R^2\le 0.09$ throughout); the accuracy-adjusted $\phi_{\mathrm{adj}}$ is markedly superior ($R^2=0.67$ on SuperGPQA), and the heuristic combining these metrics is the most stable pre-pooling predictor across the three datasets.

View source

Similar papers

#natural language process... Preprint Sep 2026

ProbPlug: A Plugin Uncertainty Network for Reliable Confidence in LLM Binary Classification

Experiments show that ProbPlug provides more reliable confidence estimates, improves classification performance with negligible additional overhead, and exhibits strong generalization across tasks, indicating that ProbPlug serves as a practical solution for confidence estimation in LLM-based classification.

Jianzong Wang, Chuhang Liu, Bo-Tao Zhao et al. · 0 citations
#artificial intelligence Preprint Sep 2026

Pinocchio: Fast Uncertainty Estimates for Black-Box Language Models

Pinocchio is introduced, an external calibrator that estimates the correctness of responses from black-box API models that needs only a single forward pass to generate an uncertainty estimate and requires no access to the target model's logits, weights, or internal states.

K. D. Hayes, Arka Pal, Hao-Song Zhang et al. · 0 citations
Review Aug 2026

POOL: Propagated Uncertainty Over Lookalikes

This work instantiate this framework with p, a hybrid estimator that combines verbal confidence with spectral answer diversity computed from the negative von Neumann entropy of sampled answer embeddings, and achieves higher average AUROC than verbal confidence and sampling-based uncertainty while using half as many sam...

Rounak Sharma, Ananya B. Sai, Soumyabrata Pal · 0 citations
Preprint Aug 2026

What Proves You Wrong: Benchmarking Language Models on Falsifiable Research Ideation

The Lit2Test benchmark centers on a six-field contract organized around a falsifying outcome, so that every proposal precommits the observation that would prove it wrong, making its quality decidable in the first place rather than merely arguable.

Zi-Yue Wang, Aomufei Yuan, Yi-Ran Yao et al. · 2 citations

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