LLM-as-a-Verifier: A General-Purpose Verification Framework
Using an LLM to verify another LLM's outputs is already common practice, but most approaches produce coarse binary scores that aren't very reliable. This paper reframes verification as a scaling axis — like pre-training compute — and shows that computing continuous scores from logit distributions, then scaling granularity, repetition, and criteria decomposition, yields substantially better signal without any additional training. Directly applicable if you're building evaluation pipelines or using LLM judges to filter agent outputs.
Takeaways
- Treating verification scores as continuous distributions over logits outperforms discrete LLM-judge scoring for separating correct from incorrect solutions.
- Decomposing evaluation criteria and aggregating sub-scores improves calibration beyond what single-prompt judges achieve.
- Verification quality scales predictably with compute investment, making it a tunable parameter in your evaluation pipeline.