Can reading logit distributions break ties in LLM judging?
Standard LLM judges output discrete scores that create frequent ties between different solutions. Could computing expectations over scoring-token logits instead yield continuous scores that meaningfully discriminate between complex outputs?
The concrete mechanism behind LLM-as-a-Verifier is a decoding change, not a training one. A standard LM judge is prompted to emit a discrete score token ("7 out of 10"), which quantizes the judgment and produces frequent ties between complex solutions that genuinely differ. LLM-as-a-Verifier instead computes the expectation over the distribution of scoring-token logits — a probabilistic read of how much mass the model puts on each score — yielding a continuous value. Because two solutions that both round to "7" almost always have different logit distributions, the continuous score separates them, substantially reducing tie rates.
This matters because ties are not a cosmetic annoyance; they are lost signal. Any pipeline that ranks candidates — best-of-N selection, RLAIF, multi-agent arbitration — degrades when the verifier cannot discriminate, and Do LLM judges systematically favor LLM-generated arguments? shows the same judging layer already carries bias. Reading logits rather than sampled tokens recovers the fine-grained separation the argmax throws away, and does so with no extra model and no training — the information was always in the distribution.
The deeper point connects to the verification-as-scaling-axis thesis: continuous scoring is what makes the "granularity" axis dial actually turn. You cannot meaningfully scale score granularity if the output is a coarse integer; expectation-over-logits is the operation that makes granularity a continuous knob, therefore enabling the calibration gains the framework claims.
Inquiring lines that read this note 4
This note is a source for these research framings, grouped by the broader line of inquiry each explores. Scan the bold lines of inquiry; follow any specific question forward.
How do language models inherit human biases from training data? Can ensemble evaluation methods reduce bias more than single judges?Related concepts in this collection 2
This note in its neighbourhood — explore the map, then jump to a related concept in the list below.
Click a node to walk · click center to open · click Open in graph to see this note in the full knowledge graph
-
Do LLM judges systematically favor LLM-generated arguments?
When LLMs evaluate debates between human and AI-written arguments, do they show a built-in preference for AI writing? This matters because it could corrupt feedback loops used to train models.
relates: the judging layer this improves also carries systematic bias that discrimination alone does not fix
-
Can smaller models in panels outperform a single large judge?
Does replacing one large language model judge with a diverse panel of smaller models improve evaluation quality while reducing cost and bias? This matters because LLM-based evaluation is widespread but suffers from expense and family-specific bias.
parallel: an orthogonal way to sharpen judgments, by ensembling rather than reading logits
Related papers in this collection 8
Papers most semantically related to this note, ranked by cosine similarity in the embedding space.
- Can You Trust LLM Judgments? Reliability of LLM-as-a-Judge
- Learning to Plan & Reason for Evaluation with Thinking-LLM-as-a-Judge
- J1: Incentivizing Thinking in LLM-as-a-Judge via Reinforcement Learning
- Overconfidence in LLM-as-a-Judge: Diagnosis and Confidence-Driven Solution
- Checklists Are Better Than Reward Models For Aligning Language Models
- RM-R1: Reward Modeling as Reasoning
- DecepChain: Inducing Deceptive Reasoning in Large Language Models
- Reward Reasoning Model
Original note title
taking the expectation over scoring-token logits gives continuous verifier scores that break the ties discrete LLM judges produce