Skip to content
DraconiticResearch
Search Sources API
203,948 studies31 sourcesUpdated 19 min ago
PreprintCC BY 4.0arXiv

Certified by Abstention: Distribution-Free Guarantees for Chain-of-Thought Verifiers at Small Calibration Budgets

Abstract

Signals that predict whether a chain-of-thought (CoT) trace is correct are compared by AUC, but deploying one requires a threshold with a guarantee. We ask what distribution-free selective guarantees deliver for CoT verifiers at realistic calibration budgets of tens to a few hundred labelled problems, using seven open models, five verifier signals and 37,000 graded traces. The central observation is validity by abstention: an (α,δ)-valid procedure that issues a certificate with probability Pfire bounds the failure probability of an issued certificate only by δ/Pfire, so a certificate that rarely fires can be valid and wrong every time it is used. In a simulation with known risk the standard certificate fails in at most 0.3% of calibration draws but in up to 69% of those in which it fires. A certification floor and a lattice condition for Benjamini-Hochberg conformal selection explain why certificates abstain at these budgets, and the data bear them out: the standard certificate returns nothing or a large accepted set, and an unreadable residual-stream probe buys two to three times the coverage of the readable signals, an edge a cross-fitted reconstruction cannot recover linearly from the readable features. We then give a floor-started fixed-sequence certificate, valid without monotonicity assumptions, that covers more than the Bonferroni certificate on every model-signal pair and raises coverage at the non-vacuous target 0.75π0 from 0.05 to 0.16, although the floor keeps absolute coverage small. Finally, a certificate cannot see what matters after deployment: under benchmark shift the error among accepted traces tracks the new task's base error, and under best-of-n selection against the verifier it rises past the target while the empirical failure frequency stays below δ, because abstention absorbs the failures.

Related

  1. Abstention Spends Its Budget on Local Label Variance More Than on Novelty: Auditing Conformal Calibration and Selective Prediction under Molecular Scaffold Shift
    Arnav Srivastava, Krishna Kassetty
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  2. Certified Inference and Training for Deep Equilibrium Networks: A Continuation Framework with Polynomial Complexity Guarantees
    Alex Borisevich
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  3. Conformal Policy Learning with Distribution-Free Safety Guarantees
    Ying Jin, Naoki Egami
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  4. Risk-Averse Bayesian Games with an Unknown Type Distribution: Bayesian Learning, Equilibrium Analysis, and Finite-Sample Guarantees
    Yuan Tao, Huifu Xu
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  5. Attribution-State Conformal Forecasting: Residual-Independent Explanation States for Uncertainty Calibration Under Distribution Shift
    Shiza Riaz Memon, Saad Ahmed Qazi
    MathematicsPeer-reviewedCC BY 4.0General mathematicsCrossref
BibTeX
@misc{balaji2026certified,
  title = {{Certified by Abstention: Distribution-Free Guarantees for Chain-of-Thought Verifiers at Small Calibration Budgets}},
  author = {Arjun Balaji},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.09541},
  eprint = {2610.09541},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.09541},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Certified by Abstention: Distribution-Free Guarantees for Chain-of-Thought Verifiers at Small Calibration Budgets
AU  - Arjun Balaji
PY  - 2026
DA  - 2026/10/07
PB  - arXiv
DO  - 10.48550/arxiv.2610.09541
UR  - https://arxiv.org/abs/2610.09541
AB  - Signals that predict whether a chain-of-thought (CoT) trace is correct are compared by AUC, but deploying one requires a threshold with a guarantee. We ask what distribution-free selective guarantees deliver for CoT verifiers at realistic calibration budgets of tens to a few hundred labelled problems, using seven open models, five verifier signals and 37,000 graded traces. The central observation is validity by abstention: an (α,δ)-valid procedure that issues a certificate with probability P_fire bounds the failure probability of an issued certificate only by δ/P_fire, so a certificate that rarely fires can be valid and wrong every time it is used. In a simulation with known risk the standard certificate fails in at most 0.3% of calibration draws but in up to 69% of those in which it fires. A certification floor and a lattice condition for Benjamini-Hochberg conformal selection explain why certificates abstain at these budgets, and the data bear them out: the standard certificate returns nothing or a large accepted set, and an unreadable residual-stream probe buys two to three times the coverage of the readable signals, an edge a cross-fitted reconstruction cannot recover linearly from the readable features. We then give a floor-started fixed-sequence certificate, valid without monotonicity assumptions, that covers more than the Bonferroni certificate on every model-signal pair and raises coverage at the non-vacuous target 0.75π_0 from 0.05 to 0.16, although the floor keeps absolute coverage small. Finally, a certificate cannot see what matters after deployment: under benchmark shift the error among accepted traces tracks the new task's base error, and under best-of-n selection against the verifier it rises past the target while the empirical failure frequency stays below δ, because abstention absorbs the failures.
ER  -