A weighted set cover algorithm prunes intermediate hypotheses during self-consistency, cutting token use by 10 to 35 percent across five LLMs on three math benchmarks while keeping accuracy.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CL 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Confidence-Weighted Token Set Cover for Early Hypothesis Pruning in Self-Consistency
A weighted set cover algorithm prunes intermediate hypotheses during self-consistency, cutting token use by 10 to 35 percent across five LLMs on three math benchmarks while keeping accuracy.