Skip to content
Preprint

Oracle Gap and Signal Fidelity: A Fixed-Pool Diagnostic for Test-Time Collaboration

Jul 2026 · 0 citations · 33 references
Computer Science

TL;DR

This framework yields a practical pre-deployment diagnostic: estimate the oracle gap, then measure coverage, signal fidelity, and harm before investing in collaboration.

Abstract

Test-time collaboration, including self-consistency, best-of-N selection, critic models, and verifier pipelines, is often credited with broadly improving LLM reasoning, yet its gains are uneven and sometimes negative. We ask when training-free collaboration should be expected to help. For a fixed candidate pool, we decompose a selector or verifier's net gain into measurable factors: recoverable mass, verification-signal coverage, conditional selection quality, and harm to already-correct outputs. This reframes collaboration as a candidate-selection problem rather than as an intrinsic property of a multi-agent topology. Across LiveCodeBench, MATH Level-5 hard subjects, and GPQA-Diamond, gains are bounded first by the oracle gap and then by signal fidelity, which we measure directly as candidate-level agreement between verifier verdicts and official labels. On LiveCodeBench, a public-test verifier (MCC 0.825) gains +8.14 percentage points (pp) over a first-sample baseline; a generated-test verifier (MCC 0.248) improves by +2.70pp and is not statistically distinguishable from an LLM selector, but operates at near-zero harm versus the selector's 4.69% harm rate. On MATH, a symbolic answer-equivalence selector beats self-consistency by +4.67pp, while LLM selectors are negative. On GPQA-Diamond, recoverable mass is only 3.03% and 87.54% of candidate pools are answer-identical; a weaker model's pools shrink both further, suggesting that oracle gap is a joint property of task, model, and sampling configuration. Our framework yields a practical pre-deployment diagnostic: estimate the oracle gap, then measure coverage, signal fidelity, and harm before investing in collaboration.

View source

Similar papers

Conference Open access 2026

Your Reasoning Model is Secretly a Reward Model - Optimization-Free Verification from Experience

This paper introduces C LUE (Clustering and Experience-based Verification) , a training-free, non-parametric verifier that improves selection and reranking in Large Language Model outputs and finds that correct and incorrect solutions exhibit measurable geometric differences in their hidden-state trajectories.

Zhenwen Liang, Ruosen Li, Yujun Zhou et al. · 0 citations
Jul 2026

Best-of-Evidence: Best-of-N Selection under Partial Verification

Best-of-Evidence (BoE) is introduced, an inference-time selection framework that keeps the BoN candidate pool fixed, represents reusable claims with a signed candidate--factor graph, and allocates a limited budget to evidence actions that can change the final choice.

Ce Zhang, Teng Fang, Yuxia Wang et al. · 0 citations
#reinforcement learning Preprint Aug 2026

AutoVerifier: Residual-Guided Non-Parametric Optimization for Reference-Based Answer Verification

This work proposes AutoVerifier, a residual-guided non-parametric optimization method that learns biases from recurring verifier errors and promotes them to code modules or prompt guidance only after replay validation detects no direct regressions, keeping accepted updates auditable, editable, and reusable.

Zelong Zhao, Zhihui Shi, Min-Qi Shi · 0 citations
Preprint Jul 2026

Position: It's Time to Optimize LLMs for Self-Consistency

This position paper observes that a wide variety of techniques designed to improve specific aspects of LM behavior-targeting properties as diverse as adversarial robustness and factual coherence-can be understood as special cases of a common "consistency optimization" procedure and addressed with a standard set of opti...

Itamar Hagay Pres, Belinda Z. Li, L. Ruis et al. · 2 citations
Conference Open access 2026

When Models Hesitate: Answer Instability as a Label-Free Uncertainty Signal for LLMs

This work proposes answer instability, defined as the variability of a model’s final answer across repeated stochastic generations of the same prompt, as a simple, label-free, and black-box uncertainty signal, and demonstrates its utility for selective prediction and targeted repair, improving reliability without acces...

J. M. Araña, Kristine Ann M. Carandang, Ethan Robert A. Casin et al. · 0 citations

Scaling Test-Time Compute via Generative Verification in Constrained Parameter Regimes

This project investigates scaling test-time compute through a Generative Verifier (GV) on the Countdown mathematical reasoning task using a computationally constrained 0.5B parameter regime, hypothesizing that the “verification gap” will widen at higher values of N due to the model’s limited semantic capacity.

Mohammad Rehan Ghori · 0 citations

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