Saved in:
| Main Authors: | , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2604.26644 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913072896016384 |
|---|---|
| author | Lin, Zhimin Ji, Yixin Li, Jinpeng Luo, Yu Li, Dong Fang, Junhua Li, Juntao Zhang, Min |
| author_facet | Lin, Zhimin Ji, Yixin Li, Jinpeng Luo, Yu Li, Dong Fang, Junhua Li, Juntao Zhang, Min |
| contents | Large Reasoning Models (LRMs) achieve strong performance on mathematical reasoning tasks but remain unreliable on challenging instances. Existing test-time scaling methods, such as repeated sampling, self-correction, and tree search, improve performance at the cost of increased computation, yet often exhibit diminishing returns on hard problems. We observe that output disagreement is strongly correlated with instance difficulty and prediction correctness, providing a useful signal for guiding instance-level strategy selection at test time. Based on this insight, we propose a training-free framework that formulates test-time scaling as an instance-level routing problem, rather than allocating more computation within a single strategy, dynamically selecting among different scaling strategies based on output disagreement. The framework applies lightweight resolution for consistent cases, majority voting for moderate disagreement, and rewriting-based reformulation for highly ambiguous instances. Experiments on seven mathematical benchmarks and three models show that our method improves accuracy by 3% - 7% while reducing sampling cost compared to existing approaches. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_26644 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | When to Vote, When to Rewrite: Disagreement-Guided Strategy Routing for Test-Time Scaling Lin, Zhimin Ji, Yixin Li, Jinpeng Luo, Yu Li, Dong Fang, Junhua Li, Juntao Zhang, Min Artificial Intelligence Large Reasoning Models (LRMs) achieve strong performance on mathematical reasoning tasks but remain unreliable on challenging instances. Existing test-time scaling methods, such as repeated sampling, self-correction, and tree search, improve performance at the cost of increased computation, yet often exhibit diminishing returns on hard problems. We observe that output disagreement is strongly correlated with instance difficulty and prediction correctness, providing a useful signal for guiding instance-level strategy selection at test time. Based on this insight, we propose a training-free framework that formulates test-time scaling as an instance-level routing problem, rather than allocating more computation within a single strategy, dynamically selecting among different scaling strategies based on output disagreement. The framework applies lightweight resolution for consistent cases, majority voting for moderate disagreement, and rewriting-based reformulation for highly ambiguous instances. Experiments on seven mathematical benchmarks and three models show that our method improves accuracy by 3% - 7% while reducing sampling cost compared to existing approaches. |
| title | When to Vote, When to Rewrite: Disagreement-Guided Strategy Routing for Test-Time Scaling |
| topic | Artificial Intelligence |
| url | https://arxiv.org/abs/2604.26644 |