Suncheng Xiang

CoBa: Cost-Effective Test-Time Scaling via Compute-Balanced Routing

This paper formulates test-time reasoning as a compute-allocation problem in which a system must decide whether the next unit of compute should be spent on generation, verification, or stopping, and introduces CoBa, a compute-balanced routing policy that first obtains a small set of candidates, applies cheap verification broadly, and routes uncertain or high-value candidates to stronger verification.