The authors model test-time reasoning as a sequential search in which candidate responses are expanded token by token.
Confidence filtering gives beam search stronger test-time scaling guarantees
The authors prove that a modified beam search can reduce its dependence on token-level coverage from quadratic to nearly linear under specified assumptions.
Top University
Qijia He · Yu Huang · Yuan Cheng · Yuxin Chen · Yingbin Liang
The Ohio State University · University of Pennsylvania · National University of Singapore
Research Digest··2 min read
He et al.
Why this paper
From University of Pennsylvania and 2 others
In one line
Confidence-filtered beam search reduces test-time sample complexity from quadratic to nearly linear and provably outperforms sequence-level inference.
What we could check
- ·No code link found
- ·No weights link found
- ·No dataset link found
- ·No compute details found
- ✓Limitations stated by the authors
- ·No benchmark numbers found
Observed from the paper text and links we have. Absence here means we did not find it, not that it does not exist.
§