How reliable are LLMs when it comes to playing dice? 文章

ArXiv CS.CL2026-06-12NEWSen作者: Luca Avena, Gianmarco Bet, Bernardo Busoni

详细信息

来源站点
ArXiv CS.CL
作者
Luca Avena, Gianmarco Bet, Bernardo Busoni
文章类型
NEWS
语言
en
发布日期
2026-06-12

摘要

arXiv:2606.07515v2 Announce Type: replace Abstract: We investigate the probabilistic reasoning capabilities of large language models through a controlled benchmarking study on discrete probability problems. We constructed two datasets, respectively a set of standard exercises and a set of counterintuitive exercises, designed to trigger heuristic reasoning, and evaluated 8 state-of-the-art models, each tested with and without Chain-of-Thought prompting. Models achieve an average accuracy of 0.96 on standard problems but only 0.59 on counterintuitive ones. We further provide empirical evidence of token bias: performance drops by over 20% when canonical formulations are replaced by disguised variants. Embedding misleading suggestions in the prompt reduces performance by up to 34%, with no model proving immune. Taken together, the reported findings suggest that current LLMs are not yet genuine probabilistic reasoners, despite their success in advanced mathematical problems.

相关事件

暂无数据

相关公司

暂无数据

相关人物

暂无数据

相关产品

暂无数据