Explorerβ€ΊArtificial Intelligenceβ€ΊAI
Research PaperResearchia:202607.16067

Partially Correlated Verifier Cascades in LLM Harnesses: Concave Log-Odds, Polynomial Reliability, and Blind-Spot Ceilings

Jiangang Han

Abstract

Serial verification gates are a core reliability primitive in LLM harnesses: a candidate answer is returned only if $k$ verifier calls all accept it. Under conditionally independent gates, the recent Odds Law (arXiv:2606.15712) shows that posterior log-odds grow linearly in $k$, so failure decays exponentially, and states that "a tight theory of partially correlated verifier cascades remains open." This note gives a minimal such theory. Modeling the per-instance false-accept rate on the generato...

Submitted: July 16, 2026Subjects: AI; Artificial Intelligence

Description / Details

Serial verification gates are a core reliability primitive in LLM harnesses: a candidate answer is returned only if kk verifier calls all accept it. Under conditionally independent gates, the recent Odds Law (arXiv:2606.15712) shows that posterior log-odds grow linearly in kk, so failure decays exponentially, and states that "a tight theory of partially correlated verifier cascades remains open." This note gives a minimal such theory. Modeling the per-instance false-accept rate on the generator's own errors as a latent variable α∼GΞ±\sim G (de Finetti), the exact cascade posterior is β„“k=β„“0βˆ’ln⁑mk\ell_k = \ell_0 - \ln m_k, with mkm_k the kk-th moment of GG. Then: (i) β„“k\ell_k is concave in kk for every non-degenerate GG -- the Odds Law is its tangent at the first gate and an upper bound; (ii) for Beta(a,b)(a,b) latents, failure decays polynomially, 1βˆ’rk≍kβˆ’b1-r_k \asymp k^{-b}, with correlation parameter ρv=1/(a+b+1)ρ_v = 1/(a+b+1); (iii) a blind-spot atom of mass 1βˆ’Ο€1-Ο€ at Ξ±=1Ξ±=1 caps the evidence extractable from any number of gates at βˆ’ln⁑(1βˆ’Ο€)-\ln(1-Ο€) nats, so reliability saturates below 1; (iv) letting the true-accept rate also vary (β∼HΞ²\sim H) yields a trichotomy -- gates eventually always help, plateau, or actively harm -- decided by the upper-tail exponents of GG and HH, with closed-form crossover k†k^\dagger. The mechanism is survivorship: errors surviving gates are the high-Ξ±Ξ± ones. The theory is measurable: RR repeated verdicts per instance identify the first RR moments of GG, so two verdicts identify ρvρ_v; beta-binomial likelihood and NPMLE recover the reliability curve and the ill-posed ceiling. In synthetic tests, independence-based extrapolation underestimates failure by 20x at k=5k=5 and ~3000x at k=10k=10; the correlated fit at R=8R=8 tracks held-out depths. The practical lever is decorrelation -- changing model family, modality, or evidence source -- not adding gates.


Source: arXiv:2607.13918v1 - http://arxiv.org/abs/2607.13918v1 PDF: https://arxiv.org/pdf/2607.13918v1 Original Link: http://arxiv.org/abs/2607.13918v1

Please sign in to join the discussion.

No comments yet. Be the first to share your thoughts!

Access Paper
View Source PDF
Submission Info
Date:
Jul 16, 2026
Topic:
Artificial Intelligence
Area:
AI
Comments:
0
Bookmark