Intrinsic Self-Verification via Affirmative Token Probabilities

This direction is merged into another direction: verbalized confidence estimation. Its last version stays readable and citable here.

Version 1 of 116 papers19 conceptsfrozen 2026-10-04

Large Language Models (LLMs) are notorious for hallucinating with confidence. While they can generate fluent, authoritative-sounding prose, their internal probability distributions for long sequences often fail to distinguish between fact and fiction. However, a growing body of research suggests that LLMs possess a "hidden" sense of their own correctness that can be unlocked by changing how we ask them to evaluate themselves.

Instead of looking at the average probability of a generated sentence, researchers have found that forcing a model to perform a binary "Yes/No" verification task provides a much more accurate signal of its internal certainty.

The Failure of Sequence Probability

When an LLM generates a sentence, the probability of that sentence is the product of the probabilities of every individual token. This metric is often a poor proxy for truth because it is heavily biased by linguistic frequency and surface-level fluency. A model might assign a high probability to a common misconception simply because the phrasing is familiar.

Jie Ren and Balaji Lakshminarayanan demonstrated in Self-evaluation Improves Selective Generation in Large Language Models that while LLMs struggle to judge their own quality using standard metrics, they excel when the task is framed as a multiple-choice "exam." By prompting a model to judge its own answer with a simple "Yes" or "No," the probability of the "Yes" token becomes a highly calibrated confidence score. This allows the model to "abstain" from answering when the affirmative token's probability is low, significantly reducing errors in selective generation.

Extracting the Affirmative Signal

The core mechanism of this research direction is the binary verification score. The process typically follows three steps:

  1. Generation: The model produces a candidate answer or reasoning path.
  2. Verification Prompting: The model is prompted with its own answer and asked a follow-up question, such as "Is the above answer correct? Answer Yes or No."
  3. Probability Extraction: Rather than looking at the text the model generates next, researchers extract the softmax probability (or log-probability) assigned to the specific token for "Yes" or "True."

This approach treats self-verification as a classification task. Mark Steyvers and colleagues in What large language models know and what people think they know argue that this secondary inference step generates a probability score that reflects internal certainty more accurately than token likelihoods. Similarly, Boyang Xue showed in MlingConf that this method holds across multiple languages, provided the prompt is aligned with the model's "native" cultural context.

Internal Proxies for Correctness

Beyond explicit "Yes/No" prompts, models appear to have even more direct internal signals of success. Hyunseok Lee and Jihoon Tack introduced ReVISE (ReVISE: Learning to Refine at Test-Time via Intrinsic Self-Verification), which uses the probability of the termination token (EOS) as a proxy for confidence. The intuition is that a model is more likely to "want" to end a sequence if it "believes" the preceding reasoning is complete and correct.

This concept is taken further in LaSeR (LaSeR: Reinforcement Learning with Last-Token Self-Rewarding) by Wenkai Yang. By aligning the log-probability of a single terminal token with actual correctness, models can be trained via reinforcement learning to internalize verification. This eliminates the need for expensive external reward models, as the model provides its own scalar signal for solution quality at the cost of a single token.

Applications in Reasoning and Consistency

This internal confidence signal is being used to make existing LLM techniques more efficient and accurate:

Teaching Models to Know What They Don't Know

While these signals exist intrinsically, they can be significantly improved through targeted training. Sanyam Kapoor and Andrew J. Wilson introduced Calibration-Tuning (CT) (Calibration-Tuning: Teaching Large Language Models to Know What They Don’t Know), a fine-tuning protocol that explicitly teaches models to estimate the probability that their own answers are correct. By training the model to respond to an "uncertainty query," the researchers produced models that are far better at recognizing their own limits.

Despite these advances, challenges remain. Juyeon Heo and Miao Xiong found that while these methods work well for factual knowledge, they still struggle to detect when a model has failed to follow complex, multi-constraint instructions (Do LLMs estimate uncertainty well in instruction-following?). The future of self-aware AI likely lies in deeper probing of these internal states to bridge the gap between what a model says and what it "knows."

Papers in this version

History & citationVersion 1 · 2026-10-04

Merged into another direction · Permanent link

View frozen version 1

Cite this direction

Latest version (a living page):

@misc{lacuna_intrinsic_self_verification_via_affirmat_0809a52e,
  title = {Intrinsic Self-Verification via Affirmative Token Probabilities},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/intrinsic-self-verification-via-affirmative-token-probabilities/rdr_0809a52e81c54e0f8591e42b4c1a39f6},
  note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-21},
}

This exact version (version 1, frozen text):

@misc{lacuna_intrinsic_self_verification_via_affirmat_0809a52e_v1,
  title = {Intrinsic Self-Verification via Affirmative Token Probabilities},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/intrinsic-self-verification-via-affirmative-token-probabilities/rdr_0809a52e81c54e0f8591e42b4c1a39f6/v/1},
  note = {Version 1, frozen 2026-10-04. Accessed 2026-11-21},
}