Skip to content

Self-Evaluation Is Already There: Eliciting Latent Judge Calibration in Base LLMs with Minimal Data

Jun 2026 · arXiv.org · Vol abs/2606.05122 · 2 citations · 47 references
Computer Science

TL;DR

Self-Evaluation Elicitation (SEE) is introduced, a method that surfaces a latent ability to predict how a judge will score its own output through a short cycle comprising a calibration-coupled reinforcement learning phase that improves the answer and predicts the judge, followed by a masked distillation phase that sharpens the prediction while leaving the answer untouched.

Abstract

Large language models are increasingly evaluated by other models, raising a natural question: can a model predict how a judge will score its own output? We find that the ability is largely present before any targeted training: prompted few-shot, a base model already predicts an external judge's multi-attribute quality scores on open-ended responses well above chance across three benchmarks. We introduce Self-Evaluation Elicitation (SEE), a method that surfaces this latent ability through a short cycle comprising a calibration-coupled reinforcement learning phase that improves the answer and predicts the judge, followed by a masked distillation phase that sharpens the prediction while leaving the answer untouched. From 160 unique examples, roughly 31x fewer than a reinforcement learning baseline, SEE improves held-out calibration across three benchmarks while preserving answer quality. The elicited self-evaluation is sharply localized within the model's own token distribution and stable across judges it was never trained against, indicating a transferable notion of quality rather than a single judge's preference. These results reframe judge-aligned self-evaluation as a problem of elicitation rather than acquisition.

View source

Similar papers

#natural language process... Preprint Aug 2026

Small Language Models as Judges for Rubric-Based Reinforcement Learning

This work studies whether smaller language models can serve as efficient and reliable rubric-based judges, and compares three ways of extracting criterion-level judgments from small models: Generative verdicts, Yes/No Logprob margins, and Probe judges.

Feng-Yu Xie, Yilun Zhao, Bingsen Chen et al. · 0 citations
#machine learning Preprint Aug 2026

Do Language Models Know Their Own Constraints?

Comparing supervised fine tuning and Group Relative Policy Optimization against an untrained baseline on a four tier Constraint Awareness Benchmark shows the reward based signal is the more destructive of the two: a reward that penalizes banned ingredient tokens regardless of framing learns a context independent suppre...

Arin Agarwal · 0 citations

Can Language Models Learn When to Abstain? Policy Learning and Calibrated Answer Selection

A useful language model should know when to answer and when to say"I don't know."Can we improve that decision by training the model itself or by training a separate component to check its answers? We study both approaches on Qwen3-14B for factual questions, using a score that rewards correct answers, penalizes mistakes...

Juan R. Terven, Diana-Margarita Córdova-Esparza, R. Gómez et al. · 0 citations
#artificial intelligence Preprint Aug 2026

JudgePanel: A Compact Judge with Panel Deliberation via Adaptive Multi-Reward Reinforcement Learning

This work proposes the first framework to equip a single compact judge with multi-agent panel deliberation capability at single-model inference cost, and introduces AdaReward, an adaptive multi-reward RL algorithm that dynamically rebalances reward component weights as different objectives saturate at different rates d...

Yi-Yue Qian, Shi-Nan Zhang, Huan Song et al. · 0 citations
#artificial intelligence Preprint Oct 2026

What Should SFT Learn? Conditional Information Gain for Generalizable Post-Training

Supervised fine-tuning (SFT) remains a widely used approach for post-training large language models, because fixed demonstrations can directly introduce desired reasoning strategies and behavioral patterns. Yet forcing a model to imitate externally provided trajectories may also interfere with behaviors already support...

Yuxuan Gu, Ke-Quan Niu, Xiao-Cheng Feng et al. · 0 citations
#natural language process... Preprint Sep 2026

Can Large Language Models Forecast What Researchers Study Next?

Threshold and judge diagnostics further clarify the limits of interpreting realization as precise anticipation and provides a common task for studying which research ideas a community subsequently pursues and how reliably this outcome can be measured.

Fenghai Li, Zi-Han Tang, Hao-Fei Yu et al. · 1 citation

Related blog posts

MIT News · Artificial Intelligence Oct 15, 2026

AI model decodes the language cells use to communicate

A new computational approach reveals how cells communicate to assemble into tissues. This could accelerate stem cell engineering, improve disease models, and inform therapies.

Microsoft Research Blog Oct 15, 2026

Proof-based general-purpose computing with Magnetar

Zero-knowledge proofs can verify computing results without rerunning workloads or exposing sensitive data. Magnetar helps bring them into the mainstream with support for standard programming languages, major speed gains, and quantum-resistant security. The post Proof-based general-purpose computing with Magnetar appeared first on Microsoft Research.

MIT News · Artificial Intelligence Sep 24, 2026

Estimating suicide risk from text

A new language-processing tool could help identify the highest-risk individuals from natural language, enabling swifter interventions.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.