A disagreement-based router that decides per math problem whether to accept, majority-vote, or rewrite improves accuracy by 3–7% with fewer samples than fixed test-time scaling methods.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
baseline 1
citation-polarity summary
fields
cs.AI 1years
2026 1verdicts
CONDITIONAL 1roles
baseline 1polarities
baseline 1representative citing papers
citing papers explorer
-
When to Vote, When to Rewrite: Disagreement-Guided Strategy Routing for Test-Time Scaling
A disagreement-based router that decides per math problem whether to accept, majority-vote, or rewrite improves accuracy by 3–7% with fewer samples than fixed test-time scaling methods.