
























Abstract:Self-consistency boosts inference-time performance by sampling multiple reasoning traces in parallel and voting. However, in constrained domains like math and code, this strategy is compute-inefficient because it samples with replacement, repeatedly revisiting the same high-probability prefixes and duplicate completions. We propose Distinct Leaf Enumeration (DLE), a deterministic decoding method that treats truncated sampling as traversal of a pruned decoding tree and systematically enumerates distinct leaves instead of sampling with replacement. This strategy improves inference efficiency in two ways. Algorithmically, it increases coverage of the truncated search space under a fixed budget by exploring previously unvisited high-probability branches. Systemically, it reuses shared prefixes and reduces redundant token generation. Empirically, DLE explores higher-quality reasoning traces than stochastic self-consistency, yielding better performance on math, coding, and general reasoning tasks.
| Subjects: | Machine Learning (cs.LG) |
| Cite as: | arXiv:2604.20500 [cs.LG] |
| (or arXiv:2604.20500v1 [cs.LG] for this version) | |
| https://doi.org/10.48550/arXiv.2604.20500 arXiv-issued DOI via DataCite (pending registration) |
From: Xueyan Li [view email]
[v1]
Wed, 22 Apr 2026 12:42:03 UTC (1,711 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。