A decodability criterion predicts when hidden-state selection beats majority voting in large language models

Zhixiang wang, Ziliang Hong, Ulas Bagci

Combining the answers a large language model (LLM) samples for a question into one decision is a test-time information fusion problem, usually solved by majority voting. Voting is…