A*-decoding applies A* search with a PRM heuristic to LLM decoding, improving accuracy per generated token on MATH500 and AIME 2024 compared to best-of-N and particle filtering.
Kcts: Knowledge- constrained tree search decoding with token-level hallucination detection, 2023
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.AI 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
A*-Decoding: Token-Efficient Inference Scaling
A*-decoding applies A* search with a PRM heuristic to LLM decoding, improving accuracy per generated token on MATH500 and AIME 2024 compared to best-of-N and particle filtering.