A benchmark for reasoning over probability operators--inference over sentences with gradable epistemic modals containing 14,320 procedurally-generated English prompts across fifteen inference templates, systematically varying question form, negation strategy, and surface content is introduced.
Abstract
Both expressions of uncertainty and inferences are ubiquitous in natural language, and valid inferences over natural-language expressions of uncertainty are necessary for not only everyday conversations but also for high-stakes domains such as medicine and law. While large language models are increasingly evaluated on logical reasoning tasks, disentangling principled, symbolic reasoning from clever surface-level pattern matching is fraught with difficulty. We introduce a benchmark for reasoning over probability operators--inference over sentences with gradable epistemic modals (e.g., probably, might, must) containing 14,320 procedurally-generated English prompts across fifteen inference templates, systematically varying question form, negation strategy, and surface content. Evaluating 29 models, we find that most show answer biases independent of the logical form, a systematic preference for Yes or No. We summarize this with a competence floor: the worse of a model's accuracy on Yes-correct and No-correct items. Only 9 of 29 models exceed random chance. We also test variations in question form, verb phrases/activity, and both the gender and origin of names used in the prompts, finding biases across every axis.
A declarative probabilistic framework for pre-training evaluation that makes the semantic structure of model behavior explicit and provides new formal tools for relating evaluation to learning, and links evaluation and learning through a shared semantics.
Kyle Richardson, C. Anderson, Pranav Balakrishnan et al.· 1 citation
Logical reasoning with large language models (LLMs) is a critical capability, as it reflects a system's ability to correctly deduce hypotheses from a given context using faithful deductive processes. However, LLM reasoning has often been shown to be sensitive to small surface-level variations in problem formulation, ra...
Ramya Keerthy Thatikonda, W. Buntine, Ehsan Shareghi· 0 citations
This work delineates LLM reasoning boundaries and presents a new paradigm for fine-grained capability assessment, which suggests that genuine reasoning is demonstrated only when a model follows logical rules despite conflicting prior knowledge.
Fangfei Yan, Jianbo Yao, Michael K. Chen et al.· Proceedings of the 32nd ACM...· 1 citation
DTC is introduced, a framework that estimates confidence by counting tokens at which two models strongly disagree during decoding, and finds that their count is almost negatively associated with answer accuracy, thereby serving as a simple yet effective signal for uncertainty quantification.
Fei-Yang Li, Sheng-Jing Liu, Qi Zhan et al.· 0 citations
A single encoder trained contrastively to isolate the targeted fact, utilizing synthetic data generated by an LLM and dataset both disjoint from all evaluation settings improves performance on 120 of 126 evaluation settings (95%) spanning 18 model dataset combinations across language and vision-language models.
Joseph Hoche, Quentin Guimard, Gianni Franchi· 0 citations
This paper introduces Tasks over Application Manuals (TAM), a benchmark for evaluating long-horizon procedural reasoning and shows that current benchmarks may overestimate LLM reasoning ability and miss a key challenge: reliably following long, rule-based procedures.
Utkarsh Soni, S. Murtaza, Yi-Fan Nie et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.