Key points
- The paradox: Mean token confidence works for easy problems but fails catastrophically on hard ones. On LiveCodeBench-V6 problems where models score below 20%, wrong answers have higher mean confidence (μ=9.03) than correct ones (μ=8.79), and the wrong-answer tail dominates.
- Consilience score: A one-line formula replacing mean confidence for verifier-free test-time scaling.
- $C_{initial}$: mean confidence over the first W tokens (after skipping the leading P tokens that are dominated by the shared prompt).
- $C_{final}$: mean confidence over the last W tokens.
- $\alpha = 3$ is fixed and transfers across models and datasets with no re-tuning.
- Critical isolation step: Modern reasoning models (DeepSeek-R1, Qwen3, GPT-OSS) emit a
<think>...</think>(or<|channel|>final) block. Confidence must be computed only on the reasoning segment; the answer segment trivially echoes the conclusion and pollutes the signal. - Four path categories (2×2 of initial × final confidence):
- Premature collapse (high / high): confidently wrong on hard problems.
- Degradation (high / low): confidence collapses mid-reasoning.
- Consilient convergence (low / high) ✓: explores then commits. This is the target shape.
- Full perplexity (low / low): the model cannot solve the problem.
- Results across four benchmarks:
- LiveCodeBench-V6: GPT-OSS-120B 65.7% → 69.7%; Qwen3 54.9% → 58.1%.
- HMMT and GPQA: significant gains.
- SWE-bench Verified with mini-swe-agent: GPT-OSS-120B 23.0% → 26.9%; Qwen3-Coder-Next 65.3% → 67.3%.
- Difficulty-stratified LiveCodeBench: flat on Easy, +12.2 to +13.7 pp on Medium, more than 2× improvement on Hard.
- Why it matters: Unlike Self-Consistency (needs extractable, comparable answers) and Process Reward Models (need training), Consilience requires only log-probabilities and works for free-form generation and agent decisions.
- Hyperparameter robustness: Fixed α=3, k=20%, skip=5% recovers 72–78% of per-set optimal gain and still yields +2.2 pp when transferred from LiveCodeBench to HMMT.
- Code: https://github.com/LechengKong/consilience
- Paper: Consilience for Verifier-Free Test-Time Scaling, Lecheng Kong, Like Hui, Haitao Mao (UIUC + Microsoft). arXiv ID referenced in the source post: 2608.09898 (https://arxiv.org/abs/2608.09898)
$$S = C_{final} - \alpha \cdot C_{initial}$$
Method summary
For each candidate reasoning path:
1. Strip the final-answer segment using </think> or <|channel|>final.
2. Skip the leading P prompt-overlap tokens; compute mean log-prob over the first W reasoning tokens → $C_{initial}$.
3. Compute mean log-prob over the last W reasoning tokens → $C_{final}$.
4. Score $S = C_{final} - \alpha \cdot C_{initial}$ and select the path with the highest S.
Broader interpretation
The authors frame Consilience as instantiating a general principle: *exploration should be valued, not penalized*. Mean-confidence selection is pure exploitation—it picks the path the model was already most committed to. Low initial confidence is reframed as a signal that the model acknowledged multiple hypotheses before converging, the temporal analog of cognitive humility in human experts.